QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#781104 | #9799. Magical Palette | A_J1e# | WA | 38ms | 7076kb | C++23 | 950b | 2024-11-25 14:48:35 | 2024-11-25 14:48:35 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using i32 = int;
using i64 = long long;
using i128=__int128;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
auto solve=[&]()->void
{
int n, m; cin >> n >> m;
if (gcd(n, m) != 1) return cout << "No\n", void();
cout << "Yes\n";
vector<int> a(n + 1);
iota(a.begin(), a.end(), 0);
vector<int> b(m + 1);
for (int i = 1; i <= m; i ++ )
b[i] = (i - 1) * n + 1;
for (int i = 1; i <= n; i ++ )
cout << a[i] % (n * m) << " \n"[i == n];
for (int j = 1; j <= m; j ++ )
cout << b[j] % (n * m) << " \n"[j == m];
// for (int i = 1; i <= n; i ++ )
// for (int j = 1; j <= m; j ++ )
// cout << a[i] * b[j] % (n * m) << " \n"[j == m];
};
i32 t=1;
cin>>t;
while(t--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
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: 38ms
memory: 7052kb
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:
ok 1 cases (1 test case)
Test #3:
score: 0
Accepted
time: 30ms
memory: 7076kb
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: 0ms
memory: 3552kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 16ms
memory: 5296kb
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: 0ms
memory: 3788kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: -100
Wrong Answer
time: 11ms
memory: 5216kb
input:
1 499999 2
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:
wrong answer Duplicated Color 2 (test case 1)