QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #781264 | #9799. Magical Palette | 2366503423 | WA | 41ms | 3624kb | C++14 | 1.3kb | 2024-11-25 15:27:21 | 2024-11-25 15:27:21 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;cin>>t;
while(t--)
{
int n,m;cin>>n>>m;
int zhun=(n*m)/2;
if(n==1||m==1)
{
if(n==1)
{
cout<<1<<'\n';
for(int i=0;i<m;i++) cout<<i<<' ';
cout<<'\n';
}
else
{
for(int i=0;i<n;i++) cout<<i<<' ';
cout<<'\n';
cout<<1<<'\n';
}
continue;
}
if(n==2||m==2)
{
if(n==2&&m%2==0)
{
cout<<"No"<<'\n';
continue;
}
if(m==2&&n%2==0)
{
cout<<"No"<<'\n';
continue;
}
cout<<"Yes"<<'\n';
if(n==2)
{
cout<<1<<' '<<2<<' '<<'\n';
for(int i=0,j=1;i<zhun;i++,j+=2) cout<<j<<' ';
cout<<'\n';
}
else
{
for(int i=0,j=1;i<zhun;i++,j+=2) cout<<j<<' ';
cout<<'\n';
cout<<1<<' '<<2<<'\n';
}
}
else
{
cout<<"No"<<'\n';
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
input:
2 2 3 2 2
output:
Yes 1 2 1 3 5 No
result:
ok 2 cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 41ms
memory: 3624kb
input:
1 1 1000000
output:
1 0 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 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 ...
result:
wrong answer Token parameter [name=verdict] equals to "1", doesn't correspond to pattern "Yes|No" (test case 1)