QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#576321 | #5414. Stop, Yesterday Please No More | xinlengweishang | WA | 70ms | 35844kb | C++20 | 2.2kb | 2024-09-19 19:55:27 | 2024-09-19 19:55:27 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
map<char,int> gox,goy;
void slove(){
int mp[2020][2020],f[2020][2020];
char s[100010];
int dx=0,dy=0;
int minx=0,maxx=0,miny=0,maxy=0,y,x,k;
scanf("%d %d %d",&y,&x,&k);
scanf("%s",s);
mp[dy+1010][dx+1010]=1;
for(int i=0;s[i]!='\0';i++){
dx+=gox[s[i]];
dy+=goy[s[i]];
mp[-dy+1010][-dx+1010]=1;
minx=min(minx,dx);
maxx=max(maxx,dx);
miny=min(miny,dy);
maxy=max(maxy,dy);
// printf("%d %d\n",-dy,-dx);
}
int ymax=y-maxy,ymin=-miny;
int xmax=x-maxx,xmin=-minx;
int ans=(ymax-ymin)*(xmax-xmin);
// printf("%d %d %d %d\n",ymax,ymin,xmax,xmin);
if((ymax-ymin)<=0||(xmax-xmin)<=0){
if(k==0) printf("%d\n",x*y);
else
printf("0\n");
return ;
}
ans-=k;
if(ans<0){
printf("0\n");
return ;
}
int tt=0;
for(int fy=max(-y+ymin-2,-maxy-1);fy<=ymax;fy++){
for(int fx=max(-x+xmin-2,-maxx-1);fx<=xmax;fx++){
f[fy+1010][fx+1010]=f[fy-1+1010][fx+1010]+f[fy+1010][fx-1+1010]-f[fy-1+1010][fx-1+1010];
if(mp[fy+1010][fx+1010]) f[fy+1010][fx+1010]++;
// printf("%d %d %d %d\n",fy,fx,mp[fy+1010][fx+1010],f[fy+1010][fx+1010]);
}
}
for(int fy=0;fy<y;fy++){
for(int fx=0;fx<x;fx++){
// printf("f[%d][%d]=%d f[%d][%d]=%d ",-fy+ymax-1,-fx+xmax-1,f[-fy+ymax-1+1010][-fx+xmax-1+1010],-fy+ymax-1,-fx+xmin-1,f[-fy+ymax-1+1010][-fx+xmin-1+1010]);
// printf("f[%d][%d]=%d f[%d][%d]=%d\n",-fy+ymin-1,-fx+xmax-1,f[-fy+ymin-1+1010][-fx+xmax-1+1010],-fy+ymin-1,-fx+xmin-1,f[-fy+ymin-1+1010][-fx+xmin-1+1010]);
if(f[-fy+ymax-1+1010][-fx+xmax-1+1010]-f[-fy+ymax-1+1010][-fx+xmin-1+1010]-f[-fy+ymin-1+1010][-fx+xmax-1+1010]+f[-fy+ymin-1+1010][-fx+xmin-1+1010]==ans) tt++;
}
}
for(int fy=max(-y+ymin-2,-maxy-1)-1;fy<=ymax;fy++){
for(int fx=max(-x+xmin-2,-maxx-1)-1;fx<=xmax;fx++){
f[fy+1010][fx+1010]=0;
// printf("%d %d %d %d\n",fy,fx,mp[fy+1010][fx+1010],f[fy+1010][fx+1010]);
}
}
for(int fy=-maxy;fy<=-miny;fy++){
for(int fx=-maxx;fx<=-minx;fx++){
mp[fy+1010][fx+1010]=0;
}
}
printf("%d\n",tt);
return ;
}
int main(){
gox['U']=0,goy['U']=1;
gox['D']=0,goy['D']=-1;
gox['L']=-1,goy['L']=0;
gox['R']=1,goy['R']=0;
int T=1;
scanf("%d",&T);
for(int i=1;i<=T;i++) slove();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 35844kb
input:
3 4 5 3 ULDDRR 4 5 0 UUUUUUU 4 5 10 UUUUUUU
output:
2 20 0
result:
ok 3 number(s): "2 20 0"
Test #2:
score: -100
Wrong Answer
time: 70ms
memory: 35728kb
input:
1060 19 12 0 UDLDDUUUUDDDLLRDUDUURULUUUDRDUDRDRLRLRLULULLLDLDDRLUUUURUUUDDRLLRUUUDULURUULLRDRLRDDURDUUURRRLURLRUULRRUDURDLUUURDLURDDLUUURDDRLLURRDLRUDLRDRLLRRDRDDLDRURRRLUDULLLRUUDLRRURRDLLRRRDLLRDDDLRLRURURDDDL 11 1 0 UR 3 18 33 UDRLR 17 11 132 RLDRDLDRUU 6 10 13 UULUDDLRDLUUDLDD 1 15 0 D 6 20 50 D...
output:
228 11 2 4 3 15 2 240 2 0 0 1 3 18 4 3 0 15 2 0 0 0 0 0 0 1 0 1 0 1 0 9 24 0 320 0 0 0 0 0 3 0 1 4 0 0 0 22 1 51 0 6 6 0 0 48 28 8 0 0 0 0 1 0 0 2 0 44 0 0 0 0 4 30 0 0 105 0 1 17 0 66 0 11 28 0 0 0 0 0 0 90 0 2 0 0 48 0 0 0 0 30 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 1 48 0 0 225 0 0 0 0 11 0 90 0 0 228 0...
result:
wrong answer 3rd numbers differ - expected: '20', found: '2'