QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #782256 | #9799. Magical Palette | 0x3ea# | WA | 151ms | 51948kb | C++17 | 1.8kb | 2024-11-25 19:30:55 | 2024-11-25 19:30:56 |
Judging History
answer
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;
const int N = (1 << 16) + 10;
void solve()
{
int n, m;
cin >> n >> m;
if (n == 1 || m == 1)
{
cout << "Yes" << endl;
if (n == 1 && m == 1)
{
cout << "0" << endl;
cout << "0" << endl;
return;
}
if (n == 1)
{
cout << 1 << endl;
for (int i = 1; i <= m; i++)
cout << i - 1 << " ";
cout << endl;
return;
}
if (m == 1)
{
for (int i = 1; i <= n; i++)
cout << i - 1 << " ";
cout << endl;
cout << 1 << endl;
return;
}
}
vector<int> a(n + 1), b(m + 1);
a[1] = b[1] = 1;
for (int i = 2; i <= n; i++)
a[i] = a[i - 1] + m;
for (int i = 2; i <= m; i++)
b[i] = b[i - 1] + n;
set<int> s;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
s.insert((a[i] * b[j]) % (n * m));
// for (int i = 1; i <= n; i++)
// cout << a[i] << " ";
// cout << endl;
// for (int i = 1; i <= m; i++)
// cout << b[i] << " ";
// cout << endl;
// cout << s.size() << endl;
if (s.size() == n * m)
{
cout << "Yes" << endl;
for (int i = 1; i <= n; i++)
cout << a[i] << " ";
cout << endl;
for (int i = 1; i <= m; i++)
cout << b[i] << " ";
cout << endl;
}
else
cout << "No" << endl;
}
int main()
{
#ifdef x3ea
freopen("in.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int _ = 1;
cin >> _;
for (; _; _--)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3548kb
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: 39ms
memory: 3800kb
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: 46ms
memory: 3564kb
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: 132ms
memory: 40300kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 151ms
memory: 51948kb
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: 106ms
memory: 40408kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: 0
Accepted
time: 139ms
memory: 51872kb
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: 123ms
memory: 44016kb
input:
1 3 333333
output:
No
result:
ok 1 cases (1 test case)
Test #9:
score: -100
Wrong Answer
time: 126ms
memory: 44056kb
input:
1 3 333332
output:
No
result:
wrong answer Wrong Verdict (test case 1)