QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #82383 | #5414. Stop, Yesterday Please No More | jyt0217 | WA | 2ms | 6044kb | C++14 | 1.3kb | 2023-02-27 18:42:33 | 2023-02-27 18:42:35 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1005;
char s[N*N];
int T,n,m,k,l,x,y,LX,LY,RX,RY,lx,rx,ly,ry,res,d,b[N][N],ss[N][N],ans;
void solve(){
ans=0;
for(int i=1;i<=n;++i)for(int j=1;j<=m;++j) b[i][j]=ss[i][j]=0;
scanf("%d%d%d%s",&n,&m,&k,s),k=n*m-k-1,l=strlen(s),LX=LY=lx=ly=1,RX=rx=n,RY=ry=m;
for(int i=0;i<l;++i){
if(s[i]=='U') ++LX,++RX;
if(s[i]=='D') --LX,--RX;
if(s[i]=='L') ++LY,++RY;
if(s[i]=='R') --LY,--RY;
lx=max(lx,LX),ly=max(ly,LY),rx=min(rx,RX),ry=min(ry,RY);
}
res=max(0,rx-lx+1)*max(0,ry-ly+1);
if(!res&&n*m-1==k) return printf("%d\n",n*m),void();
if(!res) return printf("0\n"),void();
d=k+1-(n*m-res);
x=lx,y=ly,lx=rx-lx+1,ly=ry-ly+1,b[x][y]=1;
for(int i=0;i<l;++i){
if(s[i]=='U') --x;
if(s[i]=='D') ++x;
if(s[i]=='L') --y;
if(s[i]=='R') ++y;
b[x][y]=1;
}
for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)
if(b[i][j]) ++ss[i][j],--ss[i][j+ly],--ss[i+lx][j],++ss[i+lx][j+ly];
for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)
ss[i][j]+=ss[i-1][j];
for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)
ss[i][j]+=ss[i][j-1];
for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)
if(ss[i][j]==d) ++ans;
printf("%d\n",ans);
}
int main(){
// freopen("1.in","r",stdin);
// freopen("1.out","w",stdout);
scanf("%d",&T);
while(T--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 5828kb
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: 2ms
memory: 6044kb
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 20 0 18 15 18 240 15 0 0 12 9 18 10 13 5 8 54 8 2 2 0 9 0 76 16 13 1 7 9 9 17 5 320 11 6 1 0 0 12 0 7 0 0 9 0 22 30 51 15 2 6 4 13 48 28 8 56 22 0 10 8 4 3 10 18 44 0 15 18 0 4 30 14 18 105 10 14 17 0 66 10 11 28 16 40 16 12 11 48 90 14 0 121 3 48 30 17 11 0 30 9 8 8 11 16 15 9 62 0 25 0 8 0 ...
result:
wrong answer 4th numbers differ - expected: '99', found: '0'