QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#698414#5414. Stop, Yesterday Please No Moresix_sspRE 3ms6032kbC++231.7kb2024-11-01 19:24:022024-11-01 19:24:39

Judging History

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

  • [2024-11-01 19:24:39]
  • 评测
  • 测评结果:RE
  • 用时:3ms
  • 内存:6032kb
  • [2024-11-01 19:24:02]
  • 提交

answer

#include<cstdio>
#include<cstdio>
#include<iostream>
using namespace std;
int n, m, K, ans;
string s;
int f[2005][2005];
void ssp() {
    scanf("%d%d%d", &n, &m, &K);
    cin>>s;
	s=' '+s;
    int U =1,D=n,L=1,R=m;
    int u = 1, d = n, l = 1, r = m;
    for (int i = 1;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)
	 {
        if (K == 0) printf("%d\n", n * m);
        else printf("0\n");
        return;
    }
    int cha = (D - U + 1) * (R - L + 1) - K;
    if (cha < 0) 
	{
        printf("0\n");
        return;
    }
    for (int i = 0; i <= n * 2 + 5; i++) 
	for (int j = 0; j <= m * 2 + 5; j++)
	 f[i][j] = 0;
    int BR = n + 1, BC = m + 1;
    f[BR][BC] = 1;
    for (int i = 1, r = BR, c = BC; s[i]; i++) {
        if (s[i] == 'U') r++;
        else if (s[i] == 'D') r--;
        else if (s[i] == 'L') c++;
        else if (s[i] == 'R') c--;
        f[r][c] = 1;
    }
    for (int i = 1; i <= n * 2 + 5; i++) 
	for (int j = 1; j <= m * 2 + 5; j++) 
	f[i][j] += f[i][j - 1];
    for (int i = 1; i <= n * 2 + 5; i++) 
	for (int j = 1; j <= m * 2 + 5; j++) 
	f[i][j] += f[i - 1][j];
    ans = 0;
    for(int i=1;i<=n;i++) 
	for(int j=1;j<=m;j++)
	 {
        int bR=BR-i,bC=BC-j;
        int t=f[D+bR][R+bC]-f[U-1+bR][R+bC]-f[D+bR][L-1+bC]+f[U-1+bR][L-1+bC];
        if(t==cha)
		  ans++;
    }
    printf("%d\n", ans);
}

int main() {
    int T; 
	scanf("%d", &T);
    while (T--) 
	ssp();
    return 0;
}

詳細信息

Test #1:

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

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

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: -100
Runtime Error

input:

1
1000 1000 979065
DDUULULUDULLULLDLUULURRLDURLRDLRRUURUUUDLRLUUDUUDUDLLDDDULU

output:


result: