QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#122057	#6309. Aqre	P3KO	WA	0ms	3308kb	C++20	2.5kb	2023-07-09 12:31:36	2023-07-09 12:31:40

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-07-09 12:31:40]
评测

测评结果：WA
用时：0ms
内存：3308kb

查看

[2023-07-09 12:31:36]
提交

answer

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

const int MAXN=1e3+5;
const int MAXM=1e3+5;

int n,m;
int a[MAXN][MAXM];

//10111
//11101
//11011
//01110
//10111

//1101
//1110
//
int main(){
	int t;cin>>t;
	while(t--){
		cin>>n>>m;
		int ans=n*m;
		if(max(n,m)<=3){
			for(int i=1;i<=n;i++){
				for(int j=1;j<=m;j++){
					a[i][j]=1;
				}
			}
		}else if(min(n,m)==3&&(max(m,n)-min(m,n))%4==0){
			if(n==3){
				for(int i=1;i<=n;i++){
					for(int j=1;j<=m;j++)
						if(i==1||i==3){
							if(j%4==0)a[i][j]=0,ans--;
							else a[i][j]=1;
						}else{
							if(j%4==2)a[i][j]=0,ans--;
							else a[i][j]=1;
						}
				}
			}else{
				for(int i=1;i<=n;i++){
					if(i%2==1)a[i][1]=a[i][2]=a[i][3]=1;
					else if(i%4==2)a[i][1]=a[i][3]=1,a[i][2]=0,ans--;
					else a[i][1]=a[i][3]=0,a[i][2]=1,ans-=2;
				}
			}
		}else if(n%4==2&&m%4==2){
			for(int i=1;i<=n;i++)
				for(int j=1;j<=m;j++){
				if(i%4==1){
					if(j%4==3)a[i][j]=0,ans--;
					else a[i][j]=1;
				}else if(i%4==2){
					if(j%4==0)a[i][j]=0,ans--;
					else a[i][j]=1;
				}else if(i%4==3){
					if(j%4==2)a[i][j]=0,ans--;
					else a[i][j]=1;
				}else{
					if(j%4==1)a[i][j]=0,ans--;
					else a[i][j]=1;
				}
			}
		}else if(n%4==1&&m%4==1||n%4==1&&m%4==2){
			for(int i=1;i<=n;i++)
				for(int j=1;j<=m;j++){
				if(i%4==1){
					if(j%4==3)a[i][j]=0,ans--;
					else a[i][j]=1;
				}else if(i%4==2){
					if(j%4==1)a[i][j]=0,ans--;
					else a[i][j]=1;
				}else if(i%4==3){
					if(j%4==0)a[i][j]=0,ans--;
					else a[i][j]=1;
				}else{
					if(j%4==2)a[i][j]=0,ans--;
					else a[i][j]=1;
				}
			}
		}else if(n%4==1&&m%4==3){
			for(int i=1;i<=n;i++)
				for(int j=1;j<=m;j++){
				if(i%4==1){
					if(j%4==0)a[i][j]=0,ans--;
					else a[i][j]=1;
				}else if(i%4==2){
					if(j%4==2)a[i][j]=0,ans--;
					else a[i][j]=1;
				}else if(i%4==3){
					if(j%4==3)a[i][j]=0,ans--;
					else a[i][j]=1;
				}else{
					if(j%4==1)a[i][j]=0,ans--;
					else a[i][j]=1;
				}
			}
		}else{
			for(int i=1;i<=n;i++)
				for(int j=1;j<=m;j++){
					if(i%4==1){
						if(j%4==2)a[i][j]=0,ans--;
						else a[i][j]=1;
					}else if(i%4==2){
						if(j%4==0)a[i][j]=0,ans--;
						else a[i][j]=1;
					}else if(i%4==3){
						if(j%4==3)a[i][j]=0,ans--;
						else a[i][j]=1;
					}else{
						if(j%4==1)a[i][j]=0,ans--;
						else a[i][j]=1;
					}
				}
		
		}
		cout<<ans<<"\n";
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				cout<<a[i][j];
			}
			cout<<"\n";
		}
	}
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0

Wrong Answer

time: 0ms

memory: 3308kb

input:

output:

result:

wrong answer 1s are not connected. (test case 2)