結果

問題 No.359 門松行列
ユーザー LayCurseLayCurse
提出日時 2016-04-17 22:43:53
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 5,111 bytes
コンパイル時間 1,362 ms
コンパイル使用メモリ 163,320 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-10-04 10:40:09
合計ジャッジ時間 1,986 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 WA -
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 1 ms
5,248 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 3 ms
5,248 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:92:17: warning: ‘j2’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   92 |       A[i2][j2] = L - chk[k];
      |       ~~~~~~~~~~^~~~~~~~~~~~
main.cpp:91:17: warning: ‘j1’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   91 |       A[i1][j1] = chk[k];
      |       ~~~~~~~~~~^~~~~~~~
main.cpp:92:17: warning: ‘i2’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   92 |       A[i2][j2] = L - chk[k];
      |       ~~~~~~~~~~^~~~~~~~~~~~
main.cpp:91:17: warning: ‘i1’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   91 |       A[i1][j1] = chk[k];
      |       ~~~~~~~~~~^~~~~~~~

ソースコード

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

template<class T> void sort(int N, T a[], void *mem = NULL){sort(a,a+N);}
template<class T1, class T2> void sort(int N, T1 a[], T2 b[], void *mem){int i;pair<T1,T2> *r=(pair<T1, T2>*)mem;rep(i,N)r[i].first=a[i],r[i].second=b[i];sort(r,r+N);rep(i,N)a[i]=r[i].first,b[i]=r[i].second;}
template<class T1, class T2, class T3> void sort(int N, T1 a[], T2 b[], T3 c[], void *mem){int i;pair<T1,pair<T2,T3> > *r=(pair<T1,pair<T2,T3> >*)mem;rep(i,N)r[i].first=a[i],r[i].second.first=b[i],r[i].second.second=c[i];sort(r,r+N);rep(i,N)a[i]=r[i].first,b[i]=r[i].second.first,c[i]=r[i].second.second;}
template<class T1, class T2, class T3, class T4> void sort(int N, T1 a[], T2 b[], T3 c[], T4 d[], void *mem){int i;pair<pair<T1,T2>,pair<T3,T4> > *r=(pair<pair<T1,T2>,pair<T3,T4> >*)mem;rep(i,N)r[i].first.first=a[i],r[i].first.second=b[i],r[i].second.first=c[i],r[i].second.second=d[i];sort(r,r+N);rep(i,N)a[i]=r[i].first.first,b[i]=r[i].first.second,c[i]=r[i].second.first,d[i]=r[i].second.second;}

template<class T> void unique(T arr[], int &sz, int sorted=0){int i,k=0;if(!sorted)sort(arr,arr+sz);rep(i,sz)if(!k||arr[k-1]!=arr[i])arr[k++]=arr[i];sz=k;}
template<class T, class S> void unique(T arr[], S val[], int &sz, void *mem, int sorted=0){int i,k=0;if(!sorted)sort(sz,arr,val,mem);rep(i,sz)if(!k||arr[k-1]!=arr[i])arr[k]=arr[i],val[k++]=val[i];else val[k-1] += val[i];sz=k;}
template<class T, class S, class V> void unique(T arr[], S v1[], V v2[], int &sz, void *mem, int sorted=0){int i,k=0;if(!sorted)sort(sz,arr,v1,v2,mem);rep(i,sz)if(!k||arr[k-1]!=arr[i])arr[k]=arr[i],v1[k]=v1[i],v2[k++]=v2[i];else v1[k-1] += v1[i],v2[k-1] += v2[i];sz = k;}

int isKado(int a, int b, int c){
  if(a != c && a < b && b > c) return 1;
  if(a != c && a > b && b < c) return 1;
  return 0;
}


int T, L;
int A[3][3];

int chk[11000], sz;

int main(){
  int i, j, k;
  int i1, i2, j1, j2;
  int res;

  reader(&T);
  while(T--){
    reader(&L);
    rep(i,3) rep(j,3) reader(A[i]+j);
    res = 0;

    k = 0;
    rep(i,3) rep(j,3) if(A[i][j]==0){
      if(k==0){
        i1 = i;
        j1 = j;
      } else {
        i2 = i;
        j2 = j;
      }
      k++;
    }

    sz = 0;
    rep(i,3) rep(j,3) if(A[i][j]){
      REP(k,-10,10) chk[sz++] = A[i][j] + k;
      REP(k,-10,10) chk[sz++] = L - A[i][j] + k;
    }
    chk[sz++] = 0;
    chk[sz++] = 1;
    chk[sz++] = L-1;
    chk[sz++] = L;
    unique(chk, sz);

    rep(k,sz){
      if(chk[k] <= 0 || chk[k] >= L) continue;
      A[i1][j1] = chk[k];
      A[i2][j2] = L - chk[k];

      rep(i,3) if(A[i][0] && A[i][1] && A[i][2] && isKado(A[i][0],A[i][1],A[i][2])==0) break; if(i<3) continue;
      rep(i,3) if(A[0][i] && A[0][i] && A[0][i] && isKado(A[0][i],A[1][i],A[2][i])==0) break; if(i<3) continue;
      if(A[0][0] && A[1][1] && A[2][2] && isKado(A[0][0],A[1][1],A[2][2])==0) continue;
      if(A[0][2] && A[1][1] && A[2][0] && isKado(A[2][0],A[1][1],A[0][2])==0) continue;
      
      res += chk[k+1] - chk[k];
    }

    writerLn(res);
  }

  return 0;
}
0