QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#154514#6309. Aqreqzez#WA 1ms4132kbC++141.7kb2023-08-31 18:41:182023-08-31 18:41:18

Judging History

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

  • [2023-08-31 18:41:18]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:4132kb
  • [2023-08-31 18:41:18]
  • 提交

answer

#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e3+5,M=N*40+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,m,A[N][N];
void print(){
	int tot=0;
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) tot+=A[i][j];
	printf("%d\n",tot);
	for(int i=1;i<=n;i++) {
		for(int j=1;j<=m;j++) printf("%d",A[i][j]);printf("\n");
	}
}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	if(n<4&&m<4){
		printf("%d\n",n*m);
		for(i=1;i<=n;i++){
			for(j=1;j<=m;j++) Pc('1');printf("\n");
		}
		return;
	}
	if(n<4){
		for(i=1;i<=n;i++){
			for(j=1;j<=m;j++) {
				if(i&1){
					A[i][j]=(j%4!=0);
				}else {
					A[i][j]=(j%4!=2);
				}
			}
		}
		print();return ;
	}
	if(m<4){
		for(i=1;i<=n;i++){
			for(j=1;j<=m;j++) {
				if(j&1){
					A[i][j]=(i%4!=0);
				}else {
					A[i][j]=(i%4!=2);
				}
			}
		}
		print();return;
	}
	for(i=1;i<=m;i++) if(i%4==0) A[1][i]=0;else A[1][i]=1;
	for(i=1;i<=m;i++) if(i%4==2) A[2][i]=0;else A[2][i]=1;
	for(i=1;i<=m;i++) if(i%4==3) A[3][i]=0;else A[3][i]=1;
	for(i=1;i<=m;i++) if(A[1][i]&&A[2][i]&&A[3][i]) A[4][i]=0;else A[4][i]=1;
	for(i=5;i<=n;i++) {
		for(j=1;j<=m;j++) A[i][j]=A[i-4][j];
	}
	print();
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}

详细

Test #1:

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

input:

3
2 2
3 4
3 8

output:

4
11
11
9
1110
1011
1110
18
11101110
10111011
11101110

result:

ok ok (3 test cases)

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 4132kb

input:

361
2 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
2 13
2 14
2 15
2 16
2 17
2 18
2 19
2 20
3 2
3 3
3 4
3 5
3 6
3 7
3 8
3 9
3 10
3 11
3 12
3 13
3 14
3 15
3 16
3 17
3 18
3 19
3 20
4 2
4 3
4 4
4 5
4 6
4 7
4 8
4 9
4 10
4 11
4 12
4 13
4 14
4 15
4 16
4 17
4 18
4 19
4 20
5 2
5 3
5 4
5 5
5 6
5 7
5 8
5 9
5 1...

output:

4
11
11
6
111
111
6
1110
1011
8
11101
10111
9
111011
101110
11
1110111
1011101
12
11101110
10111011
14
111011101
101110111
15
1110111011
1011101110
17
11101110111
10111011101
18
111011101110
101110111011
20
1110111011101
1011101110111
21
11101110111011
10111011101110
23
111011101110111
1011101110111...

result:

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