QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#218526#5414. Stop, Yesterday Please No MorekokomiisbestWA 0ms3676kbC++141.8kb2023-10-18 14:30:352023-10-18 14:30:35

Judging History

你现在查看的是最新测评结果

  • [2023-10-18 14:30:35]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3676kb
  • [2023-10-18 14:30:35]
  • 提交

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][N];
int n,m,K;
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;
    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];
        }
    }
    int 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: 0
Wrong Answer
time: 0ms
memory: 3676kb

input:

3
4 5 3
ULDDRR
4 5 0
UUUUUUU
4 5 10
UUUUUUU

output:

4
20
0

result:

wrong answer 1st numbers differ - expected: '2', found: '4'