QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#815382 | #9799. Magical Palette | electrojay (Juncheng Zhang)# | WA | 32ms | 3688kb | C++14 | 1.3kb | 2024-12-15 13:40:03 | 2024-12-15 13:40:03 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n, m;
cin >> n >> m;
bool flag = false;
if (n > m)
{
swap(n, m);
flag = true;
}
if (n > 2)
{
cout << "No\n";
return;
}
if (n == 1)
{
cout << "Yes\n";
if (flag)
{
for (int i = 1; i <= m; i++)
cout << i << ' ';
cout << '\n';
cout << "1\n";
}
else
{
cout << "1\n";
for (int i = 1; i <= m; i++)
cout << i << ' ';
cout << '\n';
}
}
else
{
if (m % 2 == 0)
{
cout << "No\n";
return;
}
cout << "Yes\n";
if (flag)
{
for (int i = 0; i < m; i++)
cout << i * 2 + 1 << ' ';
cout << '\n';
cout << "1 2\n";
}
else
{
cout << "1 2\n";
for (int i = 0; i < m; i++)
cout << i * 2 + 1 << ' ';
cout << '\n';
}
}
}
signed main()
{
cin.tie(0)->ios::sync_with_stdio(false);
int t = 1;
cin >> t;
while (t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3688kb
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: 32ms
memory: 3560kb
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)