QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#788175 | #9799. Magical Palette | walili# | WA | 23ms | 6916kb | C++20 | 772b | 2024-11-27 16:07:16 | 2024-11-27 16:07:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl '\n'
void oper(ll testcase_i) {
int n = 0, m = 0;
cin >> n >> m;
vector<int> a(n), b(m);
if (gcd(n, m) != 1) {
cout << "No\n";
return;
}
for (int i = 0; i < n; i++)
a[i] = i * m + 1;
for (int i = 0; i < m; i++)
b[i] = i * n + 1;
cout << "Yes\n";
for (int i = 0; i < n; i++)
cout << a[i] << ' ';
cout << '\n';
for (int i = 0; i < m; i++)
cout << b[i] << ' ';
cout << '\n';
}
int main() {
int ttt = 1;
cin>>ttt;
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
for (int i = 1; i <= ttt; i++) oper(i);
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
input:
2 2 3 2 2
output:
Yes 1 4 1 3 5 No
result:
ok 2 cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 23ms
memory: 6916kb
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 1...
result:
wrong answer Integer parameter [name=b[1000000]] equals to 1000000, violates the range [0, 999999] (test case 1)