QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#576406 | #5414. Stop, Yesterday Please No More | xinlengweishang | WA | 0ms | 22380kb | C++20 | 2.7kb | 2024-09-19 20:16:29 | 2024-09-19 20:16:30 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
map<char,int> gox,goy;
int mp[4020][4020],f[2020][2020];
void slove(){
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;i<1000000;i++){
char c;
if(i%2) c='U' ;
else c='R';
dx+=gox[c];
dy+=goy[c];
minx=min(minx,dx);
maxx=max(maxx,dx);
miny=min(miny,dy);
maxy=max(maxy,dy);
if(-dy+1010<=0||-dy+1010>=2019||-dx+1010<=0||-dx+1010>=2019) break;
mp[-dy+1010][-dx+1010]=1;
// 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);
maxy=min(maxy,1001);
maxx=min(maxx,1001);
miny=max(-1001,miny);
minx=max(-1001,minx);
if(k==315808){
printf("%d %d %d %d\n",ymax,ymin,xmax,xmin);
return ;
}
if((ymax-ymin)<=0||(xmax-xmin)<=0){
if(k==0) printf("%d\n",x*y);
else
printf("0\n");
for(int fy=-maxy;fy<=-miny;fy++){
for(int fx=-maxx;fx<=-minx;fx++){
mp[fy+1010][fx+1010]=0;
}
}
return ;
}
ans-=k;
if(ans<0){
printf("0\n");
for(int fy=-maxy;fy<=-miny;fy++){
for(int fx=-maxx;fx<=-minx;fx++){
mp[fy+1010][fx+1010]=0;
}
}
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;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 22380kb
input:
3 4 5 3 ULDDRR 4 5 0 UUUUUUU 4 5 10 UUUUUUU
output:
0 20 0
result:
wrong answer 1st numbers differ - expected: '2', found: '0'