QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #808057 | #9874. Matrix Construction | lffan | WA | 3ms | 3644kb | C++14 | 494b | 2024-12-10 16:44:14 | 2024-12-10 16:44:14 |
Judging History
answer
#include<iostream>
using namespace std;
int main(){
int T;
cin>>T;
int n,m;
while(T--){
cin>>n>>m;
int total = m*n;
cout<<"yes"<<"\n";
if(m%2==0){
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cout<<i*m+j+1<<" ";
}
cout<<"\n";
}
}
else{
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(i%2==0)
cout<<i*m+j*2+1<<" ";
else
cout<<(i-1)/2*m+j*2+2<<" ";
}
cout<<"\n";
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
input:
2 1 1 2 3
output:
yes 1 yes 1 3 5 2 4 6
result:
ok All test cases passed. (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 3ms
memory: 3588kb
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 5 7 9 11 13 15 17 2 4 6 8 10 12 14 16 18 19 21 23 25 27 29 31 33 35 11 13 15 17 19 21 23 25 27 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 Duplicated element found in the matrix. (test case 1)