QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#794970 | #9799. Magical Palette | Legend_dy# | WA | 33ms | 3676kb | C++20 | 894b | 2024-11-30 17:13:37 | 2024-11-30 17:13:37 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, m;
cin >> n >> m;
if (n == 1 && m == 1) {
cout << "Yes\n0\n0\n";
return;
}
if (n == m) {
cout << "No\n";
return;
}
cout << "Yes\n";
if (n < m) {
for (int i = 1; i <= n; i++) {
cout << i << " \n"[i == n];
}
for (int i = 1; i <= m; i++) {
cout << (i - 1) * n + 1 << " \n"[i == m];
}
}else {
for (int i = 1; i <= n; i++) {
cout << (i - 1) * m + 1 << " \n"[i == n];
}
for (int i = 1; i <= m; i++) {
cout << i << " \n"[i == m];
}
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
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: 33ms
memory: 3676kb
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)