QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#407245 | #5414. Stop, Yesterday Please No More | xiaole | WA | 3ms | 5712kb | C++23 | 2.3kb | 2024-05-08 12:36:09 | 2024-05-08 12:36:11 |
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];
bool vis[1005][1005];
void add(ll lx,ll ly,ll rx,ll ry){
d[lx][ly]++;
d[lx][ry+1]--;
d[rx+1][ly]--;
d[rx+1][ry+1]++;
}
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,vis[i][j]=false;
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;}
if(s[i]=='D'){lx++;rx++;if(rx>n) rx=n;}
if(s[i]=='L'){ly--;ry--;if(ly<1) ly=1;}
if(s[i]=='R'){ly++;ry++;if(ry>m) ry=m;}
}
// if(lx>rx or ly>ry){
// if(k==0) cout<<n*m<<"\n";
// else cout<<0<<"\n";
// return;
// }
ll dele=(rx-lx+1)*(ry-ly+1)-k;
if(dele<0) {
cout<<0<<"\n";
return;
}
reverse(s.begin(),s.end());
add(lx,ly,rx,ry);vis[lx][ly]=true;
for (ll i = 0; i < s.size(); i++)
{
if(s[i]=='U'){
lx++,rx++;
if(vis[lx][ly]==false){
add(lx,ly,rx,ry);
}vis[lx][ly]=true;
}
if(s[i]=='D'){
lx--,rx--;
if(vis[lx][ly]==false){
add(lx,ly,rx,ry);
}vis[lx][ly]=true;
}
if(s[i]=='L'){
ly++,ry++;
if(vis[lx][ly]==false){
add(lx,ly,rx,ry);
}vis[lx][ly]=true;
}
if(s[i]=='R'){
ly--,ry--;
if(vis[lx][ly]==false){
add(lx,ly,rx,ry);
}vis[lx][ly]=true;
}
}
for (ll i = 1; i <= n; i++)
{
for (ll j = 1; j <= m; j++)
{
d[i][j]+=d[i-1][j]+d[i][j-1]-d[i-1][j-1];
}
}
ll ans=0;
for (ll i = 1; i <= n; i++)
{
for (ll j = 1; j <= m; j++)
{
if(d[i][j]==dele) ans++;
}
}
cout<<ans<<"\n";
}
int main(){
ios;ll _=1;cin>>_;
while (_--)solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5612kb
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: 5712kb
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:
wrong answer 606th numbers differ - expected: '1', found: '24'