QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#218532 | #5414. Stop, Yesterday Please No More | kokomiisbest | AC ✓ | 26ms | 20552kb | C++14 | 1.9kb | 2023-10-18 14:37:44 | 2023-10-18 14:37:44 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
//\xd5\xfd\xc4\xd1\xd4\xac\xcf\xe0\xb6\xd4\xd4˶\xaf\xa3\xa1
//\xb4\xa6\xc0\xed\xb4\xfc\xca\xf3\xb5\xc4\xd4˶\xaf\xba\xdc\xc2鷳\xa3\xacת\xbb\xaf\xb3ɴ\xa6\xc0\xed\xb1߽\xe7\xbaͶ\xb4\xb5\xc4\xd4˶\xaf\xa3\xa1
const int N = 1e3+10;
const int SN=1e6+10;
char s[SN];
int f[N*2][N*2];
int n,m,K;
int ans;
void solve(){
cin>>n>>m>>K;
cin>>s+1;
int U=1,D=n,L=1,R=m;//ά\xbb\xa4\xb1߽\xe7
for(int i=1,u=1,d=n,l=1,r=m;s[i];i++){
if(s[i]=='U') u++,d++;
else if(s[i]=='D') u--,d--;
else if(s[i]=='L') l++,r++;
else l--,r--;
U=max(U,u);
D=min(D,d);
L=max(L,l);
R=min(r,R);
}
if(U>D||L>R)//\xcc\xd8\xc5\xd0û\xd3\xd0һֻ\xb4\xfc\xca\xf3\xb4\xe6\xbb\xee
{
if(K==0) cout<<n*m<<endl;
else cout<<0<<endl;
return;
}
//\xbc\xc6\xcb㻹\xd3м\xb8ֻ\xb4\xfc\xca\xf3\xd0\xe8Ҫ\xd3ö\xb4\xbd\xe2\xbe\xf6
int delta = (D-U+1)*(R-L+1)-K;
if(delta<0){
cout<<0<<endl;
return;
}
//\xbc\xc7¼\xb6\xb4\xb5\xc4ƫ\xd2\xc6\xc1\xbf
//ƫ\xd2Ʒ\xb6Χ\xca\xc7[-n,n] [-m,m],\xb6\xbc+n+1,m+1\xb1\xe4\xb3ɷǸ\xba\xca\xfd
for(int i=0;i<n*2+5;i++){
for(int j=0;j<m*2+5;j++){
f[i][j]=0;
}
}
int basic_r=n+1,basic_c=m+1;
f[basic_r][basic_c]=1;
for(int i=1,r=basic_r,c=basic_c;s[i];i++){
if(s[i]=='U') r++;
else if(s[i]=='D') r--;
else if(s[i]=='L') c++;
else c--;
f[r][c]=1;
}
//\xb6\xfeάǰ\xbaʹ\xa6\xc0\xedһ\xb8\xf6\xbf\xe9\xc7\xf8\xd3\xf2\xd3ж\xe0\xc9ٿ\xd3
for(int i=1;i<n*2+5;i++){
for(int j=1;j<m*2+5;j++){
f[i][j]=f[i][j]+f[i-1][j]+f[i][j-1]-f[i-1][j-1];
}
}
ans=0;
//ö\xbe\xd9\xd5ҵ\xbd\xb6\xb4\xcb\xf9\xd3п\xc9\xc4ܵij\xf5ʼ\xd7\xf8\xb1\xea
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
int basicr=basic_r-i,basicc=basic_c-j;
int x1=U+basicr,x2=D+basicr,y1=L+basicc,y2=R+basicc;
int t=f[x2][y2]-f[x1-1][y2]-f[x2][y1-1]+f[x1-1][y1-1];
if(t==delta) ans++;
}
}
cout<<ans<<endl;
}
int main(){
int t;
cin>>t;
while(t--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 0
Accepted
time: 2ms
memory: 6632kb
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 99 18 15 34 240 15 0 0 13 14 18 26 16 1 19 108 8 2 2 3 7 0 30 16 21 0 8 10 9 15 5 320 11 7 3 0 0 12 0 11 0 0 14 0 22 36 51 23 7 6 4 2 48 28 8 63 22 49 13 10 4 108 10 18 44 0 15 9 0 4 30 14 99 105 10 14 17 0 66 10 11 28 52 34 56 33 14 56 90 14 0 121 3 48 30 36 13 0 30 7 8 3 11 16 45 20 34 0...
result:
ok 1060 numbers
Test #3:
score: 0
Accepted
time: 3ms
memory: 20136kb
input:
1 1000 1000 979065 DDUULULUDULLULLDLUULURRLDURLRDLRRUURUUUDLRLUUDUUDUDLLDDDULU
output:
958416
result:
ok 1 number(s): "958416"
Test #4:
score: 0
Accepted
time: 3ms
memory: 20128kb
input:
1 1000 1000 943471 LRLDLURLDLRDRDUULULRDDLLRURDUURLLDDLDLDDLLLUUURLDRUDRLLUUUUUDLUUDLURURRDLRLRRRLULRRULURLRRDLDRLUDRRLDDLUDRRLLUDLLLRDULRRRRLDUUDRDLULUUUUDRRDULUDLLUUDLDURDRRLRRLDRLDDRURURLUULRRLDLLRLRDRRUULDLDLULLDLLRULLRUULURDURRLUUDUULLULDLRUDDLRLRLLUDDDLLLUDRRLDDULRRURRDURDDRDLLULRLULURLRDLLURD...
output:
889224
result:
ok 1 number(s): "889224"
Test #5:
score: 0
Accepted
time: 24ms
memory: 20400kb
input:
1 1000 1000 315808 LLRURURRDDDULLDDUDRDLRLLLDDDLUDRDURLDULRLRULUUDLUULUUDULLLLDDURLDUULUUDLLDLLDRUDUULRLLRLRUURLRLULLDDLLDUDLLRUUDRLDLUULDLLDRRRURDULLDRRRDURURDRLDURURUDLURLDURRLRRUDUDURDRLRRRDLRRURLURUDRRLDLRULLDLUURDURLURLLRDLRDRUURURDRUDUUUDLRRLUDLUUDUDDRRDUULUUDDRLLULDUUDRURRDRLULRLULDURLURUDLLD...
output:
426
result:
ok 1 number(s): "426"
Test #6:
score: 0
Accepted
time: 3ms
memory: 19448kb
input:
1 1000 1000 986018 LLULDRRRDDURRUDRUURRRDDLUUDUULRULRDULLD
output:
972180
result:
ok 1 number(s): "972180"
Test #7:
score: 0
Accepted
time: 2ms
memory: 19424kb
input:
1 1000 1000 945431 DDRRURUUDLDULLDLDDLRULDLLDDRRLUDRLUURRLDRDLURUURRRRLRURLURULLLDRDDDRRRLDLDRLRDDUURRURDDDLRUURLUURLRDUDDDLLDUURLDLUDLLRRDUUDRLUULLUULDLURRUDLUURLRLRURDUDRRRDRLRUDLLLLURLULRLRLRRDDUDLRLDUUUULUDLLURRLURRDLRURRRULDDLLLRLRDLUDLLDDRULDUULRDDUUDDUDLURDULLDUDDLULRULDRLDDULDULLUDLULUDRURRR...
output:
893000
result:
ok 1 number(s): "893000"
Test #8:
score: 0
Accepted
time: 26ms
memory: 20404kb
input:
1 1000 1000 460035 RDDUURDULDDLDDLDDLDRRULLRLUURLURRRDRUDDDRDLDLDULUDLRLLRRLRRURRRDLRLUDRDURULDRRDDDDDDLRLDULUULDUDRLLUUUURUUDRURLRRULDRDRUUUUULULRURDDRLRULLLRDRRULUDDUDDLLLRDRUULUUDDRLURDLDURRDLRRLDRRUDLUULRDLURULLDLRLLDDURDUDLDULDLLRULRDLRLUULLUDRUDDDLRRDULULLRUURLUURRLLLLRLDRURLLRLDRRDDDRLUUUUDUL...
output:
417
result:
ok 1 number(s): "417"
Test #9:
score: 0
Accepted
time: 7ms
memory: 20224kb
input:
1 1000 1000 992010 LLLLLDLDRRLUDRR
output:
1999
result:
ok 1 number(s): "1999"
Test #10:
score: 0
Accepted
time: 3ms
memory: 19432kb
input:
1 1000 1000 919600 LLDLRUDRLURRUDRDRRDLRUDLRRRUUULDLDURDDDRUURRRLLURULDRLRLULLULDRULULRLRRRURLDDDRUUULUDLLLLRRLLRDDRDULUDLRLRLDRLUDUDURRULUULLDULUULDLLDRDULUDLDULDDUULDDRRURDRDULRRLDRRDUURURRLUUUDRRLDRRDDLULRDDLDLLRLRLLLRULUUUURRRLDLRUDRRLRURDRLDULLLUDRULLDLDRRUUDLRRLLRLDDLUDLRLRRURUUDUULUDURDURRLUU...
output:
944
result:
ok 1 number(s): "944"
Test #11:
score: 0
Accepted
time: 26ms
memory: 20552kb
input:
1 1000 1000 804351 DLRLDLLLLUDRDURRLDDRRLRUULURURDDDRDLRUDDULRRLLULURDRUUDRURRLURRRDRURRDRLULRDLRRDRRDDUDLUDLDULRUURRLRUUDRLDDRDDUUDULUULUUUDLRURULLRDUUDDDRRLDRUDDUUDRURLRDRUDLRLDDRRLLRLRDUDDULLULRLLDDUDDDUULDULLRRULULDUUULUDRRDRLUDLRRDDUDLRRDDLDLDRUULRRRRRLRLULLRDDRDDDULDRRURUDDLURLRLURLRDRULUDULUU...
output:
640000
result:
ok 1 number(s): "640000"