| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 10320 | 陈颖钧 | 古墓旋转石门之谜 | C++ | Memory Limit Exceeded | 0 | 69 MS | 131300 KB | 696 | 2025-05-05 13:48:48 |
#include<iostream> using namespace std; int main(){ long long a[9999][9999]; long long b[9999][9999],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]; if(a[j][k]!=b[j][k]&&a[j][k]!=a[n-j][n-k]&&a[j][k]!=b[j][n-k]&&a[j][k]!=b[n-j][k]){ c++; } } } if(c>0){ cout<<"NO"<<endl; }else{ cout<<"YES"<<endl; } } return 0; }