QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #788261 | #9799. Magical Palette | CodeChild# | WA | 248ms | 53968kb | C++20 | 756b | 2024-11-27 16:22:52 | 2024-11-27 16:22:57 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve()
{
int n, m;
cin >> n >> m;
int mod = n * m;
vector<int> a(n), b(m);
for (int i = 0; i < n; ++i)
a[i] = (1 + i * m) % mod;
for (int i = 0; i < m; ++i)
b[i] = (1 + i * n) % mod;
set<int> s;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
s.insert(a[i] * b[j] % mod);
if (s.size() == mod) {
cout << "Yes" << endl;
for (int i : a)
cout << i << ' ';
cout << endl;
for (int i : b)
cout << i << ' ';
cout << endl;
}
else
cout<<"No"<<endl;
}
int main()
{
int t;
cin >> t;
while (t--)
solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3736kb
input:
2 2 3 2 2
output:
Yes 1 4 1 3 5 No
result:
ok 2 cases (2 test cases)
Test #2:
score: 0
Accepted
time: 243ms
memory: 53968kb
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:
ok 1 cases (1 test case)
Test #3:
score: 0
Accepted
time: 248ms
memory: 53968kb
input:
1 1000000 1
output:
Yes 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 101 ...
result:
ok 1 cases (1 test case)
Test #4:
score: 0
Accepted
time: 148ms
memory: 40216kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 175ms
memory: 52000kb
input:
1 2 499999
output:
Yes 1 500000 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 1...
result:
ok 1 cases (1 test case)
Test #6:
score: 0
Accepted
time: 109ms
memory: 40388kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: 0
Accepted
time: 135ms
memory: 51932kb
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: 129ms
memory: 44076kb
input:
1 3 333333
output:
No
result:
ok 1 cases (1 test case)
Test #9:
score: -100
Wrong Answer
time: 127ms
memory: 44008kb
input:
1 3 333332
output:
No
result:
wrong answer Wrong Verdict (test case 1)