QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#176534#5414. Stop, Yesterday Please No MorebrzWA 3ms3560kbC++201.8kb2023-09-11 19:24:122023-09-11 19:24:13

Judging History

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

  • [2023-09-11 19:24:13]
  • 评测
  • 测评结果:WA
  • 用时:3ms
  • 内存:3560kb
  • [2023-09-11 19:24:12]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define cn getchar
template<class TY>void read(TY &x){
	x=0;int f1=1;char ch=cn();
	while(ch<'0'||ch>'9'){if(ch=='-')f1=-1;ch=cn();}
	while(ch>='0'&&ch<='9')x=x*10+(ch-'0'),ch=cn(); x*=f1;
}
template<class TY>void write2(TY x){
	if(x>9)write2(x/10);
	putchar(x%10+'0');
}
template<class TY>void write(TY x){
	if(x<0)putchar('-'),x=-x;
	write2(x);
}
int n,m,k,len;
char s[1000010];

int main()
{
	int Te;read(Te);while(Te--){
		read(n); read(m); read(k);
		char ch = getchar(); len=0;
		while(ch<'A' || ch>'Z')ch = getchar();
		while(ch>='A' && ch<='Z')s[++len] = ch,ch=getchar();
		vector<vector<int>> sum(n+1,vector<int>(m+1,0));
		
		int mi1=0,ma1=0,mi2=0,ma2=0;
		int x=0,y=0;
		for(int i=1;i<=len;i++){
			if(s[i]=='U')x--;
			if(s[i]=='D')x++;
			if(s[i]=='L')y--;
			if(s[i]=='R')y++;
			mi1=min(mi1,x);
			ma1=max(ma1,x);
			mi2=min(mi2,y);
			ma2=max(ma2,y);
		}
		int a=0,b=0,c=0,d=0;
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++){
				if(i+mi1>=1 && i+ma1<=n && j+mi2>=1 && j+ma2<=m){
					if(!a)a=i,b=j;
					c=i,d=j;
				}
			}
		// printf("%d %d %d %d\n",a,b,c,d);
		if(a==0){
			if(!k)write(n*m),puts("");
			else puts("0");
			continue;
		}
		
		x=1+n-a,y=1+m-b;
		int X=c-a+1,Y=d-b+1;
		sum[x][y]=1;
		for(int i=1;i<=len;i++){
			if(s[i]=='U')x++;
			if(s[i]=='D')x--;
			if(s[i]=='L')y++;
			if(s[i]=='R')y--;
			if(x>=1 && x<=n && y>=1 && y<=m)sum[x][y]=1;
			// printf(": %d %d\n",x,y);
		}
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
				sum[i][j]+=sum[i-1][j] + sum[i][j-1] -sum[i-1][j-1];
		int ans=0;
		for(int i=X;i<=n;i++)
			for(int j=Y;j<=m;j++){
				int p=sum[i][j] - sum[i-X][j] - sum[i][j-Y] + sum[i-X][j-Y];
				if(X*Y - p == k)ans++;
			}
		write(ans);puts("");
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3560kb

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
2
1
3
15
1
240
5
0
0
2
2
18
1
2
0
2
1
1
1
1
1
0
0
1
2
3
0
2
2
9
14
1
320
1
2
1
0
0
2
0
1
0
0
2
0
22
1
51
3
7
6
1
0
48
28
8
1
2
1
1
2
1
1
1
2
44
0
2
0
0
4
30
0
1
105
4
1
17
0
66
3
11
28
1
3
1
3
3
1
90
1
0
1
1
48
8
3
2
0
30
1
1
1
1
1
1
2
2
0
2
0
1
0
1
0
1
2
48
1
0
225
1
1
1
2
11
2
90
2
2
228
1
...

result:

wrong answer 3rd numbers differ - expected: '20', found: '2'