Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
10374 | 陈颖钧 | 古墓旋转石门之谜 | C++ | Wrong Answer | 50 | 1 MS | 328 KB | 1264 | 2025-05-05 19:16:53 |
#include<iostream> using namespace std; int main(){ int a[99][99]; int b[99][99],n,m,i,j,k,c; cin>>n; for(i=0;i<n;i++){ cin>>m; c=0; for(j=1;j<=m;j++){ for(k=1;k<=m;k++){ cin>>a[j][k]; } } for(j=1;j<=m;j++){ for(k=1;k<=m;k++){ cin>>b[j][k]; } } for(j=1;j<=m;j++){ for(k=1;k<=m;k++){ if(a[j][k]!=b[j][k]){ if(a[j][k]!=b[m-j+1][m-k+1]){ if(a[j][k]!=b[j][m-k+1]){ if(a[j][k]!=b[m-j+1][k]){ if(a[j][k]!=b[j+m/2][k-m/2]){ if(a[j][k]!=b[j][k+m-1]){ if(a[j][k]!=b[j][k-m-1]){ if(a[j][k]!=b[j-m/2][k-m/2]){ if(a[j][k]!=b[j-m/2][k+m/2]){ if(a[j][k]!=b[j-m/2][k+m/2]){ c=1; } } } } } } } } } } } } if(c==1){ cout<<"NO"<<endl; }else{ cout<<"YES"<<endl; } } return 0; }