QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #407238 | #5414. Stop, Yesterday Please No More | xiaole | WA | 0ms | 5588kb | C++23 | 3.4kb | 2024-05-08 11:54:21 | 2024-05-08 11:54:22 |
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 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;
}
}
for (ll i = 1; i <= n; i++)
{
d[i][1]=1;
}
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(lx<1 or ly<1 or rx>n or ry>m){
if(k==0) cout<<n*m<<"\n";
else cout<<0<<"\n";
return;
}
ll clx=lx,cly=ly,crx=rx,cry=ry;
ll now=(rx-lx+1)*(ry-ly+1);
reverse(s.begin(),s.end());
for (ll i = 0; i < s.size(); i++)
{
if(s[i]=='U'){
lx++;rx++;
if(vis[lx][ly]==false)
for (ll j = lx; j <= rx; j++)
{
d[j][ly]++;
d[j][ry+1]--;
}
vis[lx][ly]=true;
}
if(s[i]=='D'){
lx--;rx--;
if(vis[lx][ly]==false)
for (ll j = lx; j <= rx; j++)
{
d[j][ly]++;
d[j][ry+1]--;
}vis[lx][ly]=true;
}
if(s[i]=='L'){
ly++;ry++;
if(vis[lx][ly]==false)
for (ll j = lx; j <= rx; j++)
{
d[j][ly]++;
d[j][ry+1]--;
}vis[lx][ly]=true;
}
if(s[i]=='R'){
ly--;ry--;
if(vis[lx][ly]==false)
for (ll j = lx; j <= rx; j++)
{
d[j][ly]++;
d[j][ry+1]--;
}vis[lx][ly]=true;
}
}
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 = clx; i <= crx; i++)
{
for (ll j = cly; j <= cry; 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;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 5588kb
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: 0ms
memory: 4072kb
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 0 0 7 15 18 240 2 0 0 2 2 18 13 1 0 2 108 4 0 1 0 0 0 15 3 0 0 1 2 9 0 5 320 1 5 3 0 0 8 0 0 0 0 1 0 22 18 51 10 1 6 0 1 48 28 8 63 11 49 0 4 2 0 9 9 44 0 0 1 0 4 30 2 99 105 4 0 17 0 66 1 11 28 52 15 56 0 5 0 90 14 0 11 3 48 12 15 8 0 30 4 5 1 1 16 45 19 17 0 19 0 16 0 0 0 20 13 48 10 6 225 ...
result:
wrong answer 3rd numbers differ - expected: '20', found: '0'