QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#809748#9874. Matrix ConstructionjiangzhihuiWA 2ms3708kbC++141.1kb2024-12-11 17:07:202024-12-11 17:07:24

Judging History

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

  • [2024-12-11 17:07:24]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3708kb
  • [2024-12-11 17:07:20]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int g[N][N];
void solve(){
	int n,m;
	cin>>n>>m;
	cout<<"YES\n";
	if(m%2==0){
		int res=1;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				cout<<res;
				res++;
				if(j==m)cout<<'\n';
				else cout<<' ';
			}
		}
	}else{
		if(n%2==1){
			int res=1;
			for(int i=1;i<=n;i++){
				if(i&1){
					for(int j=1;j<=m;j++){
						g[i][j]=res;
						res++;
					}
				}else{
					for(int j=m;j>=1;j--){
						g[i][j]=res;
						res++;
					}
				}
			}
		}else{
			int res=1;
			for(int i=1;i<n;i++){
				if(i&1){
					for(int j=1;j<=m;j++){
						g[i][j]=res;
						res++;
					}
				}else{
					for(int j=m;j>=1;j--){
						g[i][j]=res;
						res++;
					}
				}
			}
			g[n][m]=res;
			res++;
			for(int j=1;j<m;j++){
				g[n][j]=res;
				res++;
			}
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				cout<<g[i][j];
				if(j==m)cout<<'\n';
				else cout<<' ';
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T;
	cin>>T;
	while(T--){
		solve();
	}
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3648kb

input:

2
1 1
2 3

output:

YES
1
YES
1 2 3
5 6 4

result:

ok All test cases passed. (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 2ms
memory: 3708kb

input:

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

output:

YES
1 2 3 4 5 6 7 8 9
18 17 16 15 14 13 12 11 10
19 20 21 22 23 24 25 26 27
29 30 31 32 33 34 35 36 28
YES
1 2 3 4 5 6 7 8 9 10 11 12
13 14 15 16 17 18 19 20 21 22 23 24
25 26 27 28 29 30 31 32 33 34 35 36
37 38 39 40 41 42 43 44 45 46 47 48
49 50 51 52 53 54 55 56 57 58 59 60
61 62 63 64 65 66 67 6...

result:

wrong answer Duplicate sum found for adjacent elements at (1,2) and (2,2) (test case 1)