QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#809557#9874. Matrix Constructionwjh111WA 2ms3636kbC++11594b2024-12-11 15:55:352024-12-11 15:55:41

Judging History

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

  • [2024-12-11 15:55:41]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3636kb
  • [2024-12-11 15:55:35]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,m,i,t,j;
	cin>>t;
	while (t--){
		int u=1;
		cin>>n>>m;
		cout<<"YES\n";
		if (m==2){
			for (i=0;i<n;i++){
				cout<<u<<" "<<u+1<<"\n";
				u+=2;
			}
			cout<<"\n";
			continue;
		}
		for (i=1;i<=n;i++){
			if (i%2){
				cout<<u<<" ";
				for (j=2;j<=m;j++){
					cout<<u+m+1-j<<" ";
				}
				cout<<"\n";
			}
			else{
				for (j=1;j<=m;j++){
					cout<<u+m-j<<" ";
				}
				cout<<"\n";
			}
			u+=m;
		}
	}
} 

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
1 1
2 3

output:

YES
1 
YES
1 3 2 
6 5 4 

result:

ok All test cases passed. (2 test cases)

Test #2:

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

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 9 8 7 6 5 4 3 2 
18 17 16 15 14 13 12 11 10 
19 27 26 25 24 23 22 21 20 
36 35 34 33 32 31 30 29 28 
YES
1 12 11 10 9 8 7 6 5 4 3 2 
24 23 22 21 20 19 18 17 16 15 14 13 
25 36 35 34 33 32 31 30 29 28 27 26 
48 47 46 45 44 43 42 41 40 39 38 37 
49 60 59 58 57 56 55 54 53 52 51 50 
72 71 70 69 6...

result:

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