QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #780591 | #9799. Magical Palette | comeintocalm | WA | 45ms | 7072kb | C++20 | 2.2kb | 2024-11-25 11:44:25 | 2024-11-25 11:44:26 |
Judging History
answer
#include <bits/stdc++.h>
const int N = 1e6 + 5;
// int a[N], b[N];
// int n, m;
// int mp[105][105];
//
// void get_a_b_mp() {
// for (int i = 1; i <= n; ++i) {
// a[i] = i;
// }
// for (int i = 1; i <= m; ++i) {
// b[i] = (i - 1) * n + 1;
// }
// for (int i = 1; i <= n; ++i) {
// for (int j = 1; j <= m; ++j) {
// mp[i][j] = a[i] * b[j] % (n * m);
// }
// }
// }
//
// int chk() {
// std::set<int> st;
// for (int i = 1; i <= n; ++i) {
// for (int j = 1; j <= m; ++j) {
// st.insert(mp[i][j]);
// }
// }
// return st.size() == n * m;
// }
int main() {
// freopen("b.out", "w", stdout);
// printf(" ");
// for (n = 1; n <= 30; ++n) {
// printf("%2d ", n);
// }
// puts("");
// for (n = 1; n <= 30; ++n) {
// printf("%2d ", n);
// for (m = 1; m <= 30; ++m) {
// get_a_b_mp();
// printf("%2d ", chk());
// }
// puts("");
// }
int T;
scanf("%d", &T);
while (T--) {
int n, m;
bool rev = false;
scanf("%d%d", &n, &m);
if (n > m) {
std::swap(n, m);
rev = true;
}
std::vector<int> a(n), b(m);
bool ans = true;
for (int i = 1; i <= n; ++i) {
if (std::__gcd(i, m) != 1) {
ans = false;
break;
}
}
if (!ans) {
puts("No");
continue;
}
for (int i = 1; i <= n; ++i) {
a[i - 1] = i;
}
if (n > 1) {
for (int i = 1; i <= m; ++i) {
b[i - 1] = (i - 1) * n + 1;
}
} else {
for (int i = 0; i < m; ++i) {
b[i] = i;
}
}
if (rev) {
std::swap(n, m);
std::swap(a, b);
}
puts("Yes");
for (int i = 0; i < n; ++i) {
printf("%d%c", a[i], " \n"[i == n - 1]);
}
for (int i = 0; i < m; ++i) {
printf("%d%c", b[i], " \n"[i == m - 1]);
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 4104kb
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: 45ms
memory: 6980kb
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: 45ms
memory: 7072kb
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: 1ms
memory: 5292kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 27ms
memory: 5416kb
input:
1 2 499999
output:
Yes 1 2 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63 65 67 69 71 73 75 77 79 81 83 85 87 89 91 93 95 97 99 101 103 105 107 109 111 113 115 117 119 121 123 125 127 129 131 133 135 137 139 141 143 145 147 149 151 153 155 157 159 161 163 165 167 169 171 173...
result:
ok 1 cases (1 test case)
Test #6:
score: 0
Accepted
time: 1ms
memory: 5424kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: 0
Accepted
time: 27ms
memory: 5428kb
input:
1 499999 2
output:
Yes 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63 65 67 69 71 73 75 77 79 81 83 85 87 89 91 93 95 97 99 101 103 105 107 109 111 113 115 117 119 121 123 125 127 129 131 133 135 137 139 141 143 145 147 149 151 153 155 157 159 161 163 165 167 169 171 173 175...
result:
ok 1 cases (1 test case)
Test #8:
score: 0
Accepted
time: 0ms
memory: 4624kb
input:
1 3 333333
output:
No
result:
ok 1 cases (1 test case)
Test #9:
score: -100
Wrong Answer
time: 0ms
memory: 4492kb
input:
1 3 333332
output:
No
result:
wrong answer Wrong Verdict (test case 1)