QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#832874 | #9799. Magical Palette | liqingyang# | WA | 48ms | 7608kb | C++17 | 859b | 2024-12-26 10:03:07 | 2024-12-26 10:03:08 |
Judging History
answer
#include<iostream>
#include<algorithm>
using namespace std;
int T,n,m,a[1000010];
void print(bool op)
{
if(op)
{
for(int i=0;i<m;i++)
{
cout<<a[n+i]<<" ";
}
cout<<endl;
for(int i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
cout<<endl;
return;
}
for(int i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
cout<<endl;
for(int i=0;i<m;i++)
{
cout<<a[n+i]<<" ";
}
cout<<endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>T;
while(T--)
{
cin>>n>>m;
bool op=0;
if(n>m)
{
swap(n,m);
op=1;
}
if(n>=3||(n==2&&m!=3))
{
cout<<"No"<<endl;
continue;
}
cout<<"Yes"<<endl;
if(n==2&&m==3)
{
a[0]=1,a[1]=2,a[2]=1,a[3]=3,a[4]=5;
print(op);
continue;
}
a[0]=1%m;
for(int i=0;i<m;i++)
{
a[i+1]=i;
}
print(op);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3580kb
input:
2 2 3 2 2
output:
Yes 1 2 1 3 5 No
result:
ok 2 cases (2 test cases)
Test #2:
score: 0
Accepted
time: 44ms
memory: 7608kb
input:
1 1 1000000
output:
Yes 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...
result:
ok 1 cases (1 test case)
Test #3:
score: 0
Accepted
time: 48ms
memory: 7532kb
input:
1 1000000 1
output:
Yes 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 10...
result:
ok 1 cases (1 test case)
Test #4:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: -100
Wrong Answer
time: 0ms
memory: 3584kb
input:
1 2 499999
output:
No
result:
wrong answer Wrong Verdict (test case 1)