Submission #3336101


Source Code Expand

#include "bits/stdc++.h"

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,n,0)
#define pb push_back
#pragma GCC optimize ("-O3")

using namespace std;

// #define DEBUG_IS_VALID

#ifdef DEBUG_IS_VALID
#define DEB 1 
#else
#define DEB 0
#endif
#define DUMPOUT cout
#define dump(...) if(DEB) DUMPOUT<<"  "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<"    "; if(DEB) dump_func(__VA_ARGS__)
template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;}
template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; }
template<typename T>ostream& operator << (ostream& os, set<T>& st){for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;}
template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; }

void dump_func(){DUMPOUT << endl;}
template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);}
template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;}
template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;}

using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;

const int mod=1e9+7,INF=1<<29;
const double EPS=1e-12,PI=3.1415926535897932384626;
const ll lmod = 1e9+7,LINF=1LL<<59; 

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N,M,K; cin >> N >> M >> K ;
  vvi c(N,vi(M));
  rep(i,N) rep(j,M) c[i][j] = i*M+j+1;
  int now = 0;
  rep(i,N){
    int row = 0;
    REP(j,1,M-i){
      if(K-now<M) break;
      swap(c[j-1],c[j]);
      now += M;
    }
  }

  rep(i,N){
    rep(j,M){
      REP(k,1,M-j){
        if(now==K) break;
        swap(c[i][k-1],c[i][k]);
        now++;
      }
    }
    if(now==K) break;
  }
  rep(i,N) rep(j,M) cout << c[i][j] << (j!=M-1 ? " " : "\n");
  return 0;
}

Submission Info

Submission Time
Task D - NMパズル
User kurarrr
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2662 Byte
Status RE
Exec Time 98 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 1
AC × 45
WA × 11
RE × 27
Set Name Test Cases
Sample 00_sample_00
All 00_sample_00, 10_random_00, 10_random_01, 10_random_02, 10_random_03, 10_random_04, 10_random_05, 10_random_06, 10_random_07, 10_random_08, 10_random_09, 20_unbalance_NM_00, 20_unbalance_NM_01, 20_unbalance_NM_02, 20_unbalance_NM_03, 20_unbalance_NM_04, 20_unbalance_NM_05, 20_unbalance_NM_06, 20_unbalance_NM_07, 20_unbalance_NM_08, 20_unbalance_NM_09, 30_very_unbalance_NM_00, 30_very_unbalance_NM_01, 30_very_unbalance_NM_02, 30_very_unbalance_NM_03, 30_very_unbalance_NM_04, 30_very_unbalance_NM_05, 30_very_unbalance_NM_06, 30_very_unbalance_NM_07, 30_very_unbalance_NM_08, 30_very_unbalance_NM_09, 40_equal_NM_00, 40_equal_NM_01, 40_equal_NM_02, 40_equal_NM_03, 40_equal_NM_04, 40_equal_NM_05, 40_equal_NM_06, 40_equal_NM_07, 40_equal_NM_08, 40_equal_NM_09, 50_nearly_minimum_K_00, 50_nearly_minimum_K_01, 50_nearly_minimum_K_02, 50_nearly_minimum_K_03, 50_nearly_minimum_K_04, 50_nearly_minimum_K_05, 50_nearly_minimum_K_06, 50_nearly_minimum_K_07, 50_nearly_minimum_K_08, 50_nearly_minimum_K_09, 60_nearly_maximum_K_00, 60_nearly_maximum_K_01, 60_nearly_maximum_K_02, 60_nearly_maximum_K_03, 60_nearly_maximum_K_04, 60_nearly_maximum_K_05, 60_nearly_maximum_K_06, 60_nearly_maximum_K_07, 60_nearly_maximum_K_08, 60_nearly_maximum_K_09, 70_nearly_middle_K_00, 70_nearly_middle_K_01, 70_nearly_middle_K_02, 70_nearly_middle_K_03, 70_nearly_middle_K_04, 70_nearly_middle_K_05, 70_nearly_middle_K_06, 70_nearly_middle_K_07, 70_nearly_middle_K_08, 70_nearly_middle_K_09, 80_hand_01, 80_hand_02, 80_hand_03, 80_hand_04, 99_max_NMK_02, 99_max_NM_min_K_01, 99_max_NM_rand_K_03, 99_max_NM_rand_K_04, 99_max_NM_rand_K_05, 99_max_NM_rand_K_06, 99_max_NM_rand_K_07, 99_min_NMK_00
Case Name Status Exec Time Memory
00_sample_00 AC 1 ms 256 KB
10_random_00 RE 97 ms 256 KB
10_random_01 RE 97 ms 256 KB
10_random_02 AC 1 ms 256 KB
10_random_03 WA 2 ms 256 KB
10_random_04 RE 97 ms 256 KB
10_random_05 RE 98 ms 256 KB
10_random_06 RE 98 ms 256 KB
10_random_07 RE 98 ms 256 KB
10_random_08 RE 97 ms 256 KB
10_random_09 WA 1 ms 256 KB
20_unbalance_NM_00 AC 1 ms 256 KB
20_unbalance_NM_01 WA 2 ms 256 KB
20_unbalance_NM_02 WA 1 ms 256 KB
20_unbalance_NM_03 RE 98 ms 256 KB
20_unbalance_NM_04 RE 96 ms 256 KB
20_unbalance_NM_05 AC 2 ms 256 KB
20_unbalance_NM_06 RE 98 ms 256 KB
20_unbalance_NM_07 RE 97 ms 256 KB
20_unbalance_NM_08 WA 1 ms 256 KB
20_unbalance_NM_09 AC 1 ms 256 KB
30_very_unbalance_NM_00 RE 98 ms 256 KB
30_very_unbalance_NM_01 WA 1 ms 256 KB
30_very_unbalance_NM_02 RE 96 ms 256 KB
30_very_unbalance_NM_03 RE 96 ms 256 KB
30_very_unbalance_NM_04 WA 1 ms 256 KB
30_very_unbalance_NM_05 RE 96 ms 256 KB
30_very_unbalance_NM_06 AC 1 ms 256 KB
30_very_unbalance_NM_07 WA 1 ms 256 KB
30_very_unbalance_NM_08 AC 1 ms 256 KB
30_very_unbalance_NM_09 AC 1 ms 256 KB
40_equal_NM_00 AC 1 ms 256 KB
40_equal_NM_01 AC 1 ms 256 KB
40_equal_NM_02 AC 1 ms 256 KB
40_equal_NM_03 AC 2 ms 384 KB
40_equal_NM_04 AC 1 ms 256 KB
40_equal_NM_05 AC 2 ms 384 KB
40_equal_NM_06 AC 1 ms 256 KB
40_equal_NM_07 AC 1 ms 256 KB
40_equal_NM_08 AC 1 ms 256 KB
40_equal_NM_09 AC 1 ms 256 KB
50_nearly_minimum_K_00 AC 1 ms 256 KB
50_nearly_minimum_K_01 AC 1 ms 256 KB
50_nearly_minimum_K_02 AC 1 ms 256 KB
50_nearly_minimum_K_03 AC 1 ms 256 KB
50_nearly_minimum_K_04 AC 1 ms 256 KB
50_nearly_minimum_K_05 AC 1 ms 256 KB
50_nearly_minimum_K_06 AC 1 ms 256 KB
50_nearly_minimum_K_07 AC 1 ms 256 KB
50_nearly_minimum_K_08 AC 2 ms 384 KB
50_nearly_minimum_K_09 AC 1 ms 256 KB
60_nearly_maximum_K_00 RE 96 ms 256 KB
60_nearly_maximum_K_01 AC 1 ms 256 KB
60_nearly_maximum_K_02 AC 1 ms 256 KB
60_nearly_maximum_K_03 AC 1 ms 256 KB
60_nearly_maximum_K_04 AC 2 ms 256 KB
60_nearly_maximum_K_05 RE 97 ms 256 KB
60_nearly_maximum_K_06 AC 1 ms 256 KB
60_nearly_maximum_K_07 WA 2 ms 256 KB
60_nearly_maximum_K_08 RE 97 ms 256 KB
60_nearly_maximum_K_09 WA 1 ms 256 KB
70_nearly_middle_K_00 RE 96 ms 256 KB
70_nearly_middle_K_01 RE 97 ms 256 KB
70_nearly_middle_K_02 AC 1 ms 256 KB
70_nearly_middle_K_03 RE 96 ms 256 KB
70_nearly_middle_K_04 RE 97 ms 256 KB
70_nearly_middle_K_05 RE 96 ms 256 KB
70_nearly_middle_K_06 RE 97 ms 256 KB
70_nearly_middle_K_07 WA 1 ms 256 KB
70_nearly_middle_K_08 RE 96 ms 256 KB
70_nearly_middle_K_09 RE 97 ms 256 KB
80_hand_01 RE 97 ms 256 KB
80_hand_02 AC 1 ms 256 KB
80_hand_03 AC 1 ms 256 KB
80_hand_04 AC 1 ms 256 KB
99_max_NMK_02 AC 2 ms 384 KB
99_max_NM_min_K_01 AC 2 ms 384 KB
99_max_NM_rand_K_03 AC 2 ms 384 KB
99_max_NM_rand_K_04 AC 2 ms 384 KB
99_max_NM_rand_K_05 AC 2 ms 384 KB
99_max_NM_rand_K_06 AC 2 ms 384 KB
99_max_NM_rand_K_07 AC 2 ms 384 KB
99_min_NMK_00 AC 1 ms 256 KB