QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#696727#5414. Stop, Yesterday Please No MorekaituoAC ✓31ms20408kbC++142.5kb2024-11-01 00:49:402024-11-01 00:49:42

Judging History

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

  • [2024-11-01 00:49:42]
  • 评测
  • 测评结果:AC
  • 用时:31ms
  • 内存:20408kb
  • [2024-11-01 00:49:40]
  • 提交

answer

#include<iostream>
using namespace std;
class Map{
   public:
    int map[2048][2048];
    void in(int x,int y){
        x=x+1024,y=y+1024;
        if(x<0||y<0||x>2000||y>2000){
            return;
        }
        else {
            this->map[x][y]=1;
        }
    };
    int get(int x,int y){
        x=x+1024,y=y+1024;
        if(x<0||y<0||x>2024||y>2024){
            return 0;
        }
        else {
            return this->map[x][y];
        }
    };
};
int max(int x,int y){
    return x>y?x:y;
}
int min(int x,int y){
    return x<y?x:y;
}
Map map;
int main(){
    int n ;
    cin>>n;
while(n--){
    int n,m,k;
    cin>>n>>m>>k;
    string in_str;
    cin>>in_str;
    int x=0,y=0;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=m;j++){
            map.map[i+1024][j+1024]=0;
            map.map[i+1024][-j+1024]=0;
            map.map[-i+1024][j+1024]=0;
            map.map[-i+1024][-j+1024]=0;
        }
    }

    int xl=0,yl=0,xh=n,yh=m;
    int lox=0,loy=0;
    map.in(lox,loy);
    for(auto i:in_str){
        switch (i)
        {
        case 'U':lox+=1;map.in(lox,loy);break;
        case 'D':lox-=1;map.in(lox,loy);break;
        case 'L':loy+=1;map.in(lox,loy);break;
        case 'R':loy-=1;map.in(lox,loy);break;
        default:
            break;
        }
        xl=max(lox,xl);
        yl=max(loy,yl);
        xh=min(lox+n,xh);
        yh=min(loy+m,yh);
        //cout<<xl<<" "<<yl<<" "<<"sd"<<xh<<" "<<yh<<endl;
    }

    for( int i=1025-n;i<1024+n;i++){
        map.map[i][0]+=map.map[i-1][0];
        map.map[0][i]+=map.map[0][i-1];
    }
    for(int i=1025-n;i<1024+n;i++){
        for(int j=1025-m;j<1024+m;j++){
            int u =map.map[i-1][j];
            int l =map.map[i][j-1];
            int lu =map.map[i-1][j-1];
            map.map[i][j]+=u+l-lu;
           // if(map.map[i][j]!=0)cout<<i-1024<<"yp"<<j-1024<<" "<<map.map[i][j]<<" |";
        }
    }
    long long re =0;
    int height=xh-xl;
    int width =yh-yl;
    //cout<<height<<" "<<width<<" ";
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){

            int rx= xl-i;
            int ry= yl-j;
            int hx=rx+height-1;
            int hy=ry+width-1;
            int ru= map.get(hx,hy)-map.get(rx-1,hy)-map.get(hx,ry-1)+map.get(rx-1,ry-1);
            //cout<<map.get(i,j)<<" ";
            //cout<<ru<<" ";
            if(height*width-ru==k)re+=1;
        }
    }
    //cout<<endl;
    if( width<=0||height<=0) cout<<(k==0?n*m:0)<<endl;
    else cout<<re<<endl;


}
}


Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5648kb

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: 9ms
memory: 7588kb

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: 7ms
memory: 19680kb

input:

1
1000 1000 979065
DDUULULUDULLULLDLUULURRLDURLRDLRRUURUUUDLRLUUDUUDUDLLDDDULU

output:

958416

result:

ok 1 number(s): "958416"

Test #4:

score: 0
Accepted
time: 7ms
memory: 19556kb

input:

1
1000 1000 943471
LRLDLURLDLRDRDUULULRDDLLRURDUURLLDDLDLDDLLLUUURLDRUDRLLUUUUUDLUUDLURURRDLRLRRRLULRRULURLRRDLDRLUDRRLDDLUDRRLLUDLLLRDULRRRRLDUUDRDLULUUUUDRRDULUDLLUUDLDURDRRLRRLDRLDDRURURLUULRRLDLLRLRDRRUULDLDLULLDLLRULLRUULURDURRLUUDUULLULDLRUDDLRLRLLUDDDLLLUDRRLDDULRRURRDURDDRDLLULRLULURLRDLLURD...

output:

889224

result:

ok 1 number(s): "889224"

Test #5:

score: 0
Accepted
time: 31ms
memory: 20328kb

input:

1
1000 1000 315808
LLRURURRDDDULLDDUDRDLRLLLDDDLUDRDURLDULRLRULUUDLUULUUDULLLLDDURLDUULUUDLLDLLDRUDUULRLLRLRUURLRLULLDDLLDUDLLRUUDRLDLUULDLLDRRRURDULLDRRRDURURDRLDURURUDLURLDURRLRRUDUDURDRLRRRDLRRURLURUDRRLDLRULLDLUURDURLURLLRDLRDRUURURDRUDUUUDLRRLUDLUUDUDDRRDUULUUDDRLLULDUUDRURRDRLULRLULDURLURUDLLD...

output:

426

result:

ok 1 number(s): "426"

Test #6:

score: 0
Accepted
time: 7ms
memory: 19652kb

input:

1
1000 1000 986018
LLULDRRRDDURRUDRUURRRDDLUUDUULRULRDULLD

output:

972180

result:

ok 1 number(s): "972180"

Test #7:

score: 0
Accepted
time: 7ms
memory: 19680kb

input:

1
1000 1000 945431
DDRRURUUDLDULLDLDDLRULDLLDDRRLUDRLUURRLDRDLURUURRRRLRURLURULLLDRDDDRRRLDLDRLRDDUURRURDDDLRUURLUURLRDUDDDLLDUURLDLUDLLRRDUUDRLUULLUULDLURRUDLUURLRLRURDUDRRRDRLRUDLLLLURLULRLRLRRDDUDLRLDUUUULUDLLURRLURRDLRURRRULDDLLLRLRDLUDLLDDRULDUULRDDUUDDUDLURDULLDUDDLULRULDRLDDULDULLUDLULUDRURRR...

output:

893000

result:

ok 1 number(s): "893000"

Test #8:

score: 0
Accepted
time: 29ms
memory: 20408kb

input:

1
1000 1000 460035
RDDUURDULDDLDDLDDLDRRULLRLUURLURRRDRUDDDRDLDLDULUDLRLLRRLRRURRRDLRLUDRDURULDRRDDDDDDLRLDULUULDUDRLLUUUURUUDRURLRRULDRDRUUUUULULRURDDRLRULLLRDRRULUDDUDDLLLRDRUULUUDDRLURDLDURRDLRRLDRRUDLUULRDLURULLDLRLLDDURDUDLDULDLLRULRDLRLUULLUDRUDDDLRRDULULLRUURLUURRLLLLRLDRURLLRLDRRDDDRLUUUUDUL...

output:

417

result:

ok 1 number(s): "417"

Test #9:

score: 0
Accepted
time: 7ms
memory: 19504kb

input:

1
1000 1000 992010
LLLLLDLDRRLUDRR

output:

1999

result:

ok 1 number(s): "1999"

Test #10:

score: 0
Accepted
time: 10ms
memory: 19664kb

input:

1
1000 1000 919600
LLDLRUDRLURRUDRDRRDLRUDLRRRUUULDLDURDDDRUURRRLLURULDRLRLULLULDRULULRLRRRURLDDDRUUULUDLLLLRRLLRDDRDULUDLRLRLDRLUDUDURRULUULLDULUULDLLDRDULUDLDULDDUULDDRRURDRDULRRLDRRDUURURRLUUUDRRLDRRDDLULRDDLDLLRLRLLLRULUUUURRRLDLRUDRRLRURDRLDULLLUDRULLDLDRRUUDLRRLLRLDDLUDLRLRRURUUDUULUDURDURRLUU...

output:

944

result:

ok 1 number(s): "944"

Test #11:

score: 0
Accepted
time: 25ms
memory: 20320kb

input:

1
1000 1000 804351
DLRLDLLLLUDRDURRLDDRRLRUULURURDDDRDLRUDDULRRLLULURDRUUDRURRLURRRDRURRDRLULRDLRRDRRDDUDLUDLDULRUURRLRUUDRLDDRDDUUDULUULUUUDLRURULLRDUUDDDRRLDRUDDUUDRURLRDRUDLRLDDRRLLRLRDUDDULLULRLLDDUDDDUULDULLRRULULDUUULUDRRDRLUDLRRDDUDLRRDDLDLDRUULRRRRRLRLULLRDDRDDDULDRRURUDDLURLRLURLRDRULUDULUU...

output:

640000

result:

ok 1 number(s): "640000"