QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #407227 | #5414. Stop, Yesterday Please No More | xiaole | WA | 3ms | 4024kb | C++23 | 3.2kb | 2024-05-08 11:14:48 | 2024-05-08 11:14:49 |
Judging History
answer
#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;using ll = long long;using PLL = pair<ll,ll>;
const ll MAX = 1e18;const ll MIN = -1e18;const ll INF=0x3f3f3f3f;
const ll Q = 2e5+9;const ll MOD = 1e9 + 7;
ll d[1005][1005];
void solve(){
ll n,m,k;cin>>n>>m>>k;
for (ll i = 0; i <= n; i++)
{
for (ll j = 0; j <= m; j++)
{
d[i][j]=0;
}
}
string s;cin>>s;
if(k==0){
cout<<n*m<<"\n";
return;
}
ll lx=1,ly=1;
ll rx=n,ry=m;
for (ll i = 0; i < s.size(); i++)
{
if(s[i]=='U'){
lx--;rx--;
if(lx<1) lx=1;
// for (ll j = lx; j <= rx; j++)
// {
// d[j][ly]++;
// d[j][ry+1]--;
// }
}
if(s[i]=='D'){
lx++;rx++;
if(rx>n) rx=n;
// for (ll j = lx; j <= rx; j++)
// {
// d[j][ly]++;
// d[j][ry+1]--;
// }
}
if(s[i]=='L'){
ly--;ry--;
if(ly<1) ly=1;
// for (ll j = lx; j <= rx; j++)
// {
// d[j][ly]++;
// d[j][ry+1]--;
// }
}
if(s[i]=='R'){
ly++;ry++;
if(ry>m) ry=m;
// for (ll j = lx; j <= rx; j++)
// {
// d[j][ly]++;
// d[j][ry+1]--;
// }
}
}
if(rx<1 or ry<1 or lx>n or ly>m){
if(k==0) cout<<n*m<<"\n";
else cout<<0<<"\n";
return;
}
ll now=(rx-lx+1)*(ry-ly+1);
reverse(s.begin(),s.end());
for (ll j = lx; j <= rx; j++)
{
d[j][ly]++;
d[j][ry+1]--;
}
for (ll i = 0; i < s.size(); i++)
{
if(s[i]=='U'){
lx++;rx++;
for (ll j = lx; j <= rx; j++)
{
d[j][ly]++;
d[j][ry+1]--;
}
}
if(s[i]=='D'){
lx--;rx--;
for (ll j = lx; j <= rx; j++)
{
d[j][ly]++;
d[j][ry+1]--;
}
}
if(s[i]=='L'){
ly++;ry++;
for (ll j = lx; j <= rx; j++)
{
d[j][ly]++;
d[j][ry+1]--;
}
}
if(s[i]=='R'){
ly--;ry--;
for (ll j = lx; j <= rx; j++)
{
d[j][ly]++;
d[j][ry+1]--;
}
}
}
// cout<<lx<<" "<<ly<<" "<<rx<<" "<<ry<<"\n";
ll ans=0;
for (ll i = 1; i <= n; i++)
{
for (ll j = 2; j <= m; j++)
{
d[i][j]+=d[i][j-1];
}
}
for (ll i = 1; i <= n; i++)
{
for (ll j = 1; j <= m; j++)
{
if(now-d[i][j]==k) ans++;
// cout<<d[i][j]<<" ";
}
// cout<<"\n";
}
cout<<ans<<"\n";
}
int main(){
ios;ll _=1;cin>>_;
while (_--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3792kb
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: 3ms
memory: 4024kb
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 17 9 18 15 21 240 14 0 0 5 1 18 3 16 1 31 108 8 1 2 3 7 0 29 4 20 0 8 10 9 6 5 320 3 5 3 0 0 7 0 11 0 0 8 128 22 18 51 23 5 6 3 9 48 28 8 1 22 49 13 10 2 12 6 18 44 0 14 5 0 4 30 14 99 105 2 27 17 0 66 10 11 28 52 32 8 22 14 0 90 15 0 22 3 48 29 20 9 0 30 6 8 3 10 16 45 16 17 0 20 0 21 0 6 0 ...
result:
wrong answer 3rd numbers differ - expected: '20', found: '17'