QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#135187#6644. Red Black Gridsalvator_noster#WA 79ms3608kbC++142.0kb2023-08-05 12:36:562023-08-05 12:36:59

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-05 12:36:59]
  • 评测
  • 测评结果:WA
  • 用时:79ms
  • 内存:3608kb
  • [2023-08-05 12:36:56]
  • 提交

answer

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

#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)

using ll = long long;
int rd(){
	int x;
	scanf("%d",&x);
	return x;
}
int main(){
	rep(cas,1,rd()){
		int n=rd(),m=rd();
		bool fl=0;
		int cnt2=0,cnt3=0,cnt4=0;
		rep(i,1,n)rep(j,1,n){
			if((i+j)&1){
				if((i==1||i==n)&&(j==1||j==n))
					cnt2++;
				else if((i==1||i==n)||(j==1||j==n))
					cnt3++;
				else cnt4++;
			}
		}
		rep(t2,0,cnt2)rep(t3,0,cnt3)rep(t4,0,cnt4){
			if(fl)continue;
			int C2=t2,C3=t3,C4=t4;
			if(C2*2+C3*3+C4*4==m){
				fl=1;
				puts("Possible");
				rep(i,1,n){
							rep(j,1,n){
								if((i+j)&1){
									if((i==1||i==n)&&(j==1||j==n)){
										if(C2)printf("B"),C2--;
										else printf("R");
									}
									else if(((i==1||i==n)||(j==1||j==n))){
										if(C3)printf("B"),C3--;
										else printf("R");
									}
									else {
										if(C4)printf("B"),C4--;
										else printf("R");
									}
								}else printf("B");
							}
							puts("");
						}
			}
		}
		cnt2=cnt3=cnt4=0;
		rep(i,1,n)rep(j,1,n){
			if(((i+j)&1)==0){
				if((i==1||i==n)&&(j==1||j==n))
					cnt2++;
				else if((i==1||i==n)||(j==1||j==n))
					cnt3++;
				else cnt4++;
			}
		}
		rep(t2,0,cnt2)rep(t3,0,cnt3)rep(t4,0,cnt4){
			if(fl)continue;
			int C2=t2,C3=t3,C4=t4;
			if(C2*2+C3*3+C4*4==m){
				fl=1;
				puts("Possible");
				rep(i,1,n){
							rep(j,1,n){
								if(((i+j)&1)==0){
									if((i==1||i==n)&&(j==1||j==n)){
										if(C2)printf("B"),C2--;
										else printf("R");
									}
									else if(((i==1||i==n)||(j==1||j==n))){

										if(C3)printf("B"),C3--;
										else printf("R");
									}
									else {
										if(C4)printf("B"),C4--;
										else printf("R");
									}
								}else printf("B");
							}
							puts("");
						}
			}
		}
		if(!fl)puts("Impossible");
	}
}

详细

Test #1:

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

input:

2
3 6
3 1

output:

Possible
BBB
BBR
BRB
Impossible

result:

ok correct! (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 79ms
memory: 3556kb

input:

4424
1 0
2 4
2 3
2 2
2 1
2 0
3 12
3 11
3 10
3 9
3 8
3 7
3 6
3 5
3 4
3 3
3 2
3 1
3 0
4 24
4 23
4 22
4 21
4 20
4 19
4 18
4 17
4 16
4 15
4 14
4 13
4 12
4 11
4 10
4 9
4 8
4 7
4 6
4 5
4 4
4 3
4 2
4 1
4 0
5 40
5 39
5 38
5 37
5 36
5 35
5 34
5 33
5 32
5 31
5 30
5 29
5 28
5 27
5 26
5 25
5 24
5 23
5 22
5 21
5...

output:

Possible
B
Possible
BB
BB
Impossible
Possible
BB
RB
Impossible
Possible
BR
RB
Possible
BBB
BBB
BBB
Impossible
Possible
BBB
BBB
BBR
Possible
BBB
BBB
BRB
Possible
BBB
BBB
RBR
Impossible
Possible
BBB
BBR
BRB
Impossible
Possible
RBR
BBB
RBR
Possible
BBB
RBR
BRB
Possible
BBR
BRB
RBR
Impossible
Possible
B...

result:

wrong answer Condition failed: "getNum(vec) == k" (test case 2)