結果

問題 No.223 1マス指定の魔方陣
ユーザー LayCurseLayCurse
提出日時 2015-06-05 22:54:50
言語 C++11
(gcc 11.4.0)
結果
RE  
実行時間 -
コード長 5,349 bytes
コンパイル時間 2,154 ms
コンパイル使用メモリ 172,692 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-06 14:20:10
合計ジャッジ時間 5,360 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 1 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,940 KB
testcase_11 AC 2 ms
6,944 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 2 ms
6,940 KB
testcase_14 AC 2 ms
6,940 KB
testcase_15 AC 1 ms
6,940 KB
testcase_16 AC 2 ms
6,944 KB
testcase_17 RE -
testcase_18 WA -
testcase_19 WA -
testcase_20 RE -
testcase_21 AC 1 ms
6,944 KB
testcase_22 WA -
testcase_23 RE -
testcase_24 RE -
testcase_25 WA -
testcase_26 WA -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 WA -
testcase_31 RE -
testcase_32 RE -
testcase_33 RE -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 AC 2 ms
6,940 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 RE -
testcase_42 RE -
testcase_43 WA -
testcase_44 WA -
testcase_45 AC 2 ms
6,940 KB
testcase_46 RE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void reader(double*)’:
main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   15 | void reader(double *x){scanf("%lf",x);}
      |                        ~~~~~^~~~~~~~~
main.cpp: In function ‘int main()’:
main.cpp:120:8: warning: ‘jj’ may be used uninitialized in this function [-Wmaybe-uninitialized]
  120 |   if(jj/4 != Y/4){
      |      ~~^~
main.cpp:114:8: warning: ‘ii’ may be used uninitialized in this function [-Wmaybe-uninitialized]
  114 |   if(ii/4 != X/4){
      |      ~~^~

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

#define VI vector<int>
#define VII vector<VI >

VII solve(int n){
  int i, j, k, ii, jj;
  VI per;
  VII res, bef, chk;

  rep(i,n) per.push_back(0);
  rep(i,n) res.push_back(per);

  if(n%2==1){
    k = 0;
    rep(i,n) rep(j,n){
      res[(n-j+2*i)%n][(n-i+j+(n/2))%n] = ++k;
    }
  }
  if(n%4==0){
    k = 0;
    rep(i,n) rep(j,n){
      ii = i%4; jj = j%4;
      k++;
      if( (ii==0||ii==3) && (jj==0||jj==3) ) res[i][j] = k;
      if( (ii==1||ii==2) && (jj==1||jj==2) ) res[i][j] = k;
    }
    k = 0;
    for(i=n-1;i>=0;i--) for(j=n-1;j>=0;j--){
      k++;
      if(res[i][j]==0) res[i][j] = k;
    }
  }
  if(n%4==2){
    chk = bef = solve(n/2);
    rep(i,n/2) rep(j,n/2) bef[i][j] = 4*(bef[i][j]-1);
    rep(i,n/2) rep(j,n/2) chk[i][j] = 'L';
    rep(i,n/4) rep(j,n/2) chk[n/2-1-i][j] = 'X';
    rep(j,n/2) chk[n/4+1][j] = 'U';
    swap(chk[n/4][n/4], chk[n/4+1][n/4]);
    rep(i,n/2) rep(j,n/2){
      if(chk[i][j]=='L'){
        res[2*i+0][2*j+0] = bef[i][j] + 4;
        res[2*i+0][2*j+1] = bef[i][j] + 1;
        res[2*i+1][2*j+0] = bef[i][j] + 2;
        res[2*i+1][2*j+1] = bef[i][j] + 3;
      }
      if(chk[i][j]=='U'){
        res[2*i+0][2*j+0] = bef[i][j] + 1;
        res[2*i+0][2*j+1] = bef[i][j] + 4;
        res[2*i+1][2*j+0] = bef[i][j] + 2;
        res[2*i+1][2*j+1] = bef[i][j] + 3;
      }
      if(chk[i][j]=='X'){
        res[2*i+0][2*j+0] = bef[i][j] + 1;
        res[2*i+0][2*j+1] = bef[i][j] + 4;
        res[2*i+1][2*j+0] = bef[i][j] + 3;
        res[2*i+1][2*j+1] = bef[i][j] + 2;
      }
    }
  }

  return res;
}

int main(){
  int i, j, k, ii, jj, iii, jjj;
  int a, b;
  int N, X, Y, Z;
  int m1, m2;
  int arr[1000];
  int tmp[10][10];

  reader(&N,&Y,&X,&Z);
  X--; Y--;
  VII res = solve(N);

  rep(i,N) rep(j,N) if(res[i][j]==Z){
    ii = i;
    jj = j;
  }

  if(ii/4 != X/4){
    a = ii/4;
    b = X/4;
    rep(i,4) rep(j,N) swap(res[a+i][j], res[b+i][j]);
  }

  if(jj/4 != Y/4){
    a = jj/4;
    b = Y/4;
    rep(i,4) rep(j,N) swap(res[j][a+i], res[j][b+i]);
  }




/*  
  rep(i,N) rep(j,N) if(res[i][j]==Z){
    ii = i;
    jj = j;
  }

  iii = ii/4*4;
  jjj = jj/4*4;
  ii -= iii;
  jj -= jjj;
  X -= iii;
  Y -= jjj;

  if( ((ii==0||ii==3)&&(jj==0||jj==3)) || ((ii==1||ii==2)&&(jj==1||jj==2)) ) m1 = 1; else m1 = 0;
  if( ((X ==0||X ==3)&&(Y ==0||Y ==3)) || ((X ==1||X ==2)&&(Y ==1||Y ==2)) ) m2 = 1; else m2 = 0;
  if(m1 != m2){
    rep(i,4) swap(res[i+iii][0+jjj],res[i+iii][2+jjj]);
    rep(i,4) swap(res[i+iii][1+jjj],res[i+iii][3+jjj]);
  }

  X += iii;
  Y += jjj;

*/


  rep(i,N) rep(j,N) if(res[i][j]==Z){
    ii = i;
    jj = j;
  }

  iii = ii/4*4;
  jjj = jj/4*4;
  ii -= iii;
  jj -= jjj;
  X -= iii;
  Y -= jjj;

  if(X!=ii){
    rep(j,4) swap(res[X+iii][j+jjj],res[ii+iii][j+jjj]);
    rep(i,4) swap(res[i+iii][X+jjj],res[i+iii][ii+jjj]);
  }

  X += iii;
  Y += jjj;



  rep(i,N) rep(j,N) if(res[i][j]==Z){
    ii = i;
    jj = j;
  }

  iii = ii/4*4;
  jjj = jj/4*4;
  ii -= iii;
  jj -= jjj;
  X -= iii;
  Y -= jjj;

  if(Y!=jj){
    rep(j,4) swap(res[Y+iii][j+jjj],res[jj+iii][j+jjj]);
    rep(i,4) swap(res[i+iii][Y+jjj],res[i+iii][jj+jjj]);
  }

  X += iii;
  Y += jjj;




  rep(i,N){
    rep(j,N) arr[j] = res[i][j];
    writerArr(arr, N);
  }

  return 0;
}
0