QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #809683 | #9874. Matrix Construction | wjh111 | WA | 2ms | 3704kb | C++11 | 621b | 2024-12-11 16:44:04 | 2024-12-11 16:44:08 |
Judging History
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,u;
cin>>t;
while (t--){
u=1;
cin>>n>>m;
cout<<"YES\n";
if (m%2==0){
for (i=0;i<n;i++){
for (j=0;j<m;j++){
cout<<u+j<<" ";
}
u+=m;
cout<<"\n";
}
}
else{
for (i=0;i<n;i++){
if (i%2==0){
cout<<u<<" ";
for (j=1;j<=m/2;j++){
cout<<u+j*2<<" "<<u+j*2-1<<" ";
}}
else{
for (j=u+m-1;j>=u;j--){
cout<<j<<" ";
}
}
u+=m;
cout<<"\n";
}
}
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3584kb
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: 3704kb
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 3 2 5 4 7 6 9 8 18 17 16 15 14 13 12 11 10 19 21 20 23 22 25 24 27 26 36 35 34 33 32 31 30 29 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 6...
result:
wrong answer Duplicate sum found for adjacent elements at (1,4) and (2,4) (test case 1)