QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#674308#5438. Half MixedxcyyyyyWA 162ms3940kbC++20935b2024-10-25 15:07:592024-10-25 15:08:00

Judging History

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

  • [2024-10-25 15:08:00]
  • 评测
  • 测评结果:WA
  • 用时:162ms
  • 内存:3940kb
  • [2024-10-25 15:07:59]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define N 1000005
int n,m;
vector<int> c,a[N];
void str(int n){
	int r=n*(n+1)/4-n,rn=n,l=n;
	while(r||n){
		while(l*(l-1)/2>r)--l;
		c.push_back(l);
		n-=l;r-=l*(l-1)/2;
	}
}
void work(){
	c.clear();
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)vector<int>().swap(a[i]);
	for(int i=0;i<n;i++)a[i].resize(m);
	if(n%4==3||n%4==0){
		puts("Yes");
		str(n);
		for(int j=0;j<m;j++){
			int i=0,now=0;
			for(int x:c){while(x--)a[i][j]=now,++i;now^=1;}
		}
		for(int i=0;i<n;i++,puts(""))
			for(int j=0;j<m;j++)
				printf("%d ",a[i][j]);
	}
	else if(m%4==0||m%3==0){
		puts("Yes");
		str(m);
		for(int i=0;i<n;i++){
			int j=0,now=0;
			for(int x:c){while(x--)a[i][j]=now,++j;now^=1;}
		}
		for(int i=0;i<n;i++,puts(""))
			for(int j=0;j<m;j++)
				printf("%d ",a[i][j]);
	}
	else puts("No");
}
int main(){
	int t;scanf("%d",&t);while(t--)
	work();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3788kb

input:

2
2 3
1 1

output:

Yes
0 1 0 
0 1 0 
No

result:

ok OK, Accepted. (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 162ms
memory: 3940kb

input:

5382
1 1
1 2
2 1
1 3
2 2
3 1
1 4
2 3
3 2
4 1
1 5
2 4
3 3
4 2
5 1
1 6
2 5
3 4
4 3
5 2
6 1
1 7
2 6
3 5
4 4
5 3
6 2
7 1
1 8
2 7
3 6
4 5
5 4
6 3
7 2
8 1
1 9
2 8
3 7
4 6
5 5
6 4
7 3
8 2
9 1
1 10
2 9
3 8
4 7
5 6
6 5
7 4
8 3
9 2
10 1
1 11
2 10
3 9
4 8
5 7
6 6
7 5
8 4
9 3
10 2
11 1
1 12
2 11
3 10
4 9
5 8
6 ...

output:

No
No
No
Yes
0 1 0 
No
Yes
0 
1 
0 
Yes
0 0 1 0 
Yes
0 1 0 
0 1 0 
Yes
0 0 
1 1 
0 0 
Yes
0 
0 
1 
0 
No
Yes
0 0 1 0 
0 0 1 0 
Yes
0 0 0 
1 1 1 
0 0 0 
Yes
0 0 
0 0 
1 1 
0 0 
No
Yes
0 0 0 1 1 0 
No
Yes
0 0 0 0 
1 1 1 1 
0 0 0 0 
Yes
0 0 0 
0 0 0 
1 1 1 
0 0 0 
No
No
No
Yes
0 0 0 1 1 0 
0 0 0 1 1 0 ...

result:

wrong answer Wrong Verdict (test case 16)