QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#783407 | #9799. Magical Palette | kuaileqiewuyou | WA | 47ms | 3824kb | C++14 | 1.6kb | 2024-11-26 09:38:03 | 2024-11-26 09:38:04 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int T,n,m;
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
if(n==2||m==2)
{
if(n==2&&m==2) printf("No\n");
else
{
printf("Yes\n");
if(n==2)
{
printf("%d %d\n",1,2);
for(int i = 1;i<=m;i++)
{
printf("%d ",i*2-1);
}
printf("\n");
}
else
{
for(int i = 1;i<=n;i++)
{
printf("%d ",i*2-1);
}printf("\n");
printf("1 2\n");
}
}
}
else if(n==1||m==1)
{
printf("Yes\n");
if(n==1)
{
printf("1\n");
for(int i = 1;i<=m;i++)
{
printf("%d ",i);
}printf("\n");
}
else
{
for(int i = 1;i<=n;i++)
{
printf("%d ",i);
}printf("\n");
printf("1\n");
}
}
else
{
printf("No\n");
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3772kb
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: 47ms
memory: 3824kb
input:
1 1 1000000
output:
Yes 1 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 10...
result:
wrong answer Integer parameter [name=b[1000000]] equals to 1000000, violates the range [0, 999999] (test case 1)