Submission #41028658
Source Code Expand
//This code is written by hmz,and hmz is cute!!!
#include<bits/stdc++.h>
using namespace std;
#define TY int
#define umap unordered_map
#define ull unsigned long long
#define pq priority_queue
#define mp make_pair
#define mod (TY)(1e9+7)
#define MAXN 35
#define MAXM 200005
#define MAXK 27
#define INF (TY)1e9
#define Birthday 20090321
#define Read(name) freopen(#name,"r",stdin);
#define Write(name) freopen(#name,"w",stdout);
#define For(i,a,b) for(TY i=(a);i<=(b);++i)
#define FOR(i,a,b) for(TY i=(a);i<(b);++i)
#define Rof(i,a,b) for(TY i=(a);i>=(b);--i)
#define ROF(i,a,b) for(TY i=(a);i>(b);--i)
inline TY qr(){
TY x=0,f=1;char op=getchar();
for(;op<'0'||op>'9';op=getchar())if(op=='-')f=-1;
for(;op>='0'&&op<='9';op=getchar())x=x*10+(op^48);
return x*f;
}inline bool ischar(char op){
if(op=='.'||op=='#')return true;
return false;
}inline char getc(){
char op=getchar();
while(!ischar(op))op=getchar();
return op;
}inline string qs(){
string op="";char u=getchar();
while(!ischar(u))u=getchar();
while(ischar(u))op+=u,u=getchar();
return op;
}inline void qw(TY x){
if(!x){putchar('0');return;}
if(x<0)putchar('-'),x=-x;
if(x>=10)qw(x/10);putchar(x%10+'0');
}inline void qw(TY x,char op){qw(x),putchar(op);}
inline void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
inline TY Ceil(TY a,TY b){return a/b+(a%b!=0);}
inline TY Mod(TY a){return (a>=mod?a-mod:a);}
inline TY Abs(TY a,TY b){return a>b?a-b:b-a;}
inline TY Pow(TY a,TY b){
TY ans=1,base=a;
while(b){
if(b&1)ans=ans*base%mod;
base=base*base%mod;b>>=1;
}return ans;
}TY n,m;
char a[MAXN][MAXN],b[MAXN][MAXN],C[MAXN][MAXN],lst[MAXN][MAXN];
inline bool check(TY x,TY y){
For(i,1,n)For(j,1,m)lst[i][j]=a[i][j];
For(i,1,n)For(j,1,m)C[i][j]=lst[i][(j+x-1)%m+1];
For(i,1,n)For(j,1,m)lst[i][j]=C[i][j];
For(i,1,n)For(j,1,m)C[i][j]=lst[(i+y-1)%n+1][j];
For(i,1,n)For(j,1,m)if(C[i][j]!=b[i][j])return false;
return true;
}
int main(){
n=qr();m=qr();
For(i,1,n)For(j,1,m)a[i][j]=getc();
For(i,1,n)For(j,1,m)b[i][j]=getc();
For(i,0,30)For(j,0,30)if(check(i,j)){
ws("Yes");return 0;
}ws("No");
return 0;
}
Submission Info
Submission Time
2023-04-29 21:09:22+0900
Task
B - Same Map in the RPG World
User
hmzqwq
Language
C++ (GCC 9.2.1)
Score
200
Code Size
2166 Byte
Status
AC
Exec Time
7 ms
Memory
3612 KiB
Compile Error
./Main.cpp: In function ‘void qw(int)’:
./Main.cpp:41:2: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
41 | if(x>=10)qw(x/10);putchar(x%10+'0');
| ^~
./Main.cpp:41:20: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
41 | if(x>=10)qw(x/10);putchar(x%10+'0');
| ^~~~~~~
./Main.cpp: In function ‘void ws(std::string)’:
./Main.cpp:18:34: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
18 | #define FOR(i,a,b) for(TY i=(a);i<(b);++i)
| ^
./Main.cpp:43:26: note: in expansion of macro ‘FOR’
43 | inline void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
| ^~~
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
200 / 200
Status
Set Name
Test Cases
Sample
00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All
00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 02_h_eq_2_w_eq_2_00.txt, 02_h_eq_2_w_eq_2_01.txt, 02_h_eq_2_w_eq_2_02.txt, 02_h_eq_2_w_eq_2_03.txt, 02_h_eq_2_w_eq_2_04.txt, 02_h_eq_2_w_eq_2_05.txt, 02_h_eq_2_w_eq_2_06.txt, 02_h_eq_2_w_eq_2_07.txt, 02_h_eq_2_w_eq_2_08.txt, 02_h_eq_2_w_eq_2_09.txt, 02_h_eq_2_w_eq_2_10.txt, 02_h_eq_2_w_eq_2_11.txt, 02_h_eq_2_w_eq_2_12.txt, 02_h_eq_2_w_eq_2_13.txt, 02_h_eq_2_w_eq_2_14.txt, 02_h_eq_2_w_eq_2_15.txt, 03_corner1_00.txt, 03_corner1_01.txt, 03_corner1_02.txt, 03_corner1_03.txt, 03_corner1_04.txt, 03_corner1_05.txt, 03_corner1_06.txt, 04_corner2_00.txt, 04_corner2_01.txt, 04_corner2_02.txt
Case Name
Status
Exec Time
Memory
00_sample_00.txt
AC
7 ms
3572 KiB
00_sample_01.txt
AC
2 ms
3584 KiB
00_sample_02.txt
AC
2 ms
3576 KiB
00_sample_03.txt
AC
3 ms
3408 KiB
01_random_00.txt
AC
2 ms
3416 KiB
01_random_01.txt
AC
1 ms
3516 KiB
01_random_02.txt
AC
2 ms
3476 KiB
01_random_03.txt
AC
5 ms
3580 KiB
01_random_04.txt
AC
2 ms
3412 KiB
01_random_05.txt
AC
6 ms
3580 KiB
01_random_06.txt
AC
4 ms
3468 KiB
01_random_07.txt
AC
2 ms
3412 KiB
02_h_eq_2_w_eq_2_00.txt
AC
2 ms
3420 KiB
02_h_eq_2_w_eq_2_01.txt
AC
2 ms
3404 KiB
02_h_eq_2_w_eq_2_02.txt
AC
1 ms
3572 KiB
02_h_eq_2_w_eq_2_03.txt
AC
2 ms
3572 KiB
02_h_eq_2_w_eq_2_04.txt
AC
2 ms
3576 KiB
02_h_eq_2_w_eq_2_05.txt
AC
2 ms
3504 KiB
02_h_eq_2_w_eq_2_06.txt
AC
2 ms
3572 KiB
02_h_eq_2_w_eq_2_07.txt
AC
2 ms
3480 KiB
02_h_eq_2_w_eq_2_08.txt
AC
3 ms
3580 KiB
02_h_eq_2_w_eq_2_09.txt
AC
2 ms
3416 KiB
02_h_eq_2_w_eq_2_10.txt
AC
2 ms
3400 KiB
02_h_eq_2_w_eq_2_11.txt
AC
2 ms
3568 KiB
02_h_eq_2_w_eq_2_12.txt
AC
2 ms
3508 KiB
02_h_eq_2_w_eq_2_13.txt
AC
2 ms
3544 KiB
02_h_eq_2_w_eq_2_14.txt
AC
2 ms
3464 KiB
02_h_eq_2_w_eq_2_15.txt
AC
2 ms
3416 KiB
03_corner1_00.txt
AC
2 ms
3508 KiB
03_corner1_01.txt
AC
2 ms
3572 KiB
03_corner1_02.txt
AC
2 ms
3472 KiB
03_corner1_03.txt
AC
1 ms
3612 KiB
03_corner1_04.txt
AC
2 ms
3504 KiB
03_corner1_05.txt
AC
2 ms
3504 KiB
03_corner1_06.txt
AC
2 ms
3400 KiB
04_corner2_00.txt
AC
2 ms
3468 KiB
04_corner2_01.txt
AC
2 ms
3572 KiB
04_corner2_02.txt
AC
2 ms
3404 KiB