QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#780018 | #9799. Magical Palette | iliyian | WA | 32ms | 3700kb | C++23 | 885b | 2024-11-24 23:35:48 | 2024-11-24 23:35:48 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
void solve() {
int n, m;
std::cin >> n >> m;
if (std::gcd(n, m) != 1) {
std::cout << "No\n";
return;
}
std::cout << "Yes\n";
if (n < m) {
for (int i = 1; i <= n; i++) {
std::cout << (n - i + 1) % (n * m) << ' ';
}
std::cout << '\n';
for (int i = 1; i <= m; i++) {
std::cout << (m + (i - 1) * n + m * n) % (m * n) << ' ';
}
std::cout << '\n';
} else {
for (int i = 1; i <= n; i++) {
std::cout << (n + (i - 1) * m + m * n) % (m * n) << ' ';
}
std::cout << '\n';
for (int i = 1; i <= m; i++) {
std::cout << (m - i + 1) % (n * m) << ' ';
}
std::cout << '\n';
}
}
signed main() {
std::cin.tie(nullptr)->sync_with_stdio(false);
int t = 1;
std::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: 3580kb
input:
2 2 3 2 2
output:
Yes 2 1 3 5 1 No
result:
ok 2 cases (2 test cases)
Test #2:
score: 0
Accepted
time: 29ms
memory: 3660kb
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: 32ms
memory: 3644kb
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: 3572kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 12ms
memory: 3640kb
input:
1 2 499999
output:
Yes 2 1 499999 500001 500003 500005 500007 500009 500011 500013 500015 500017 500019 500021 500023 500025 500027 500029 500031 500033 500035 500037 500039 500041 500043 500045 500047 500049 500051 500053 500055 500057 500059 500061 500063 500065 500067 500069 500071 500073 500075 500077 500079 5000...
result:
ok 1 cases (1 test case)
Test #6:
score: 0
Accepted
time: 0ms
memory: 3700kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: 0
Accepted
time: 15ms
memory: 3584kb
input:
1 499999 2
output:
Yes 499999 500001 500003 500005 500007 500009 500011 500013 500015 500017 500019 500021 500023 500025 500027 500029 500031 500033 500035 500037 500039 500041 500043 500045 500047 500049 500051 500053 500055 500057 500059 500061 500063 500065 500067 500069 500071 500073 500075 500077 500079 500081 50...
result:
ok 1 cases (1 test case)
Test #8:
score: 0
Accepted
time: 0ms
memory: 3700kb
input:
1 3 333333
output:
No
result:
ok 1 cases (1 test case)
Test #9:
score: -100
Wrong Answer
time: 8ms
memory: 3640kb
input:
1 3 333332
output:
Yes 3 2 1 333332 333335 333338 333341 333344 333347 333350 333353 333356 333359 333362 333365 333368 333371 333374 333377 333380 333383 333386 333389 333392 333395 333398 333401 333404 333407 333410 333413 333416 333419 333422 333425 333428 333431 333434 333437 333440 333443 333446 333449 333452 33...
result:
wrong answer Duplicated Color 666664 (test case 1)