QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #786624 | #9799. Magical Palette | Moemi_# | WA | 259ms | 54096kb | C++20 | 2.7kb | 2024-11-26 22:30:01 | 2024-11-26 22:30:02 |
Judging History
answer
#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>
#define sc_int(x) scanf("%d", &x)
#define x first
#define y second
#define pb push_back
using namespace std;
const int N = 5e6 + 10, M = 5010, MOD = 998244353;
const int inf = 1e9;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<string, int> PSI;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;
LL n, m;
int v1[N], v2[N];
void solve()
{
cin >> n >> m;
int p = n * m;
bool flag = 0;
if(n > m) swap(n, m), flag = 1;
vector<int> a(m);
a[0] = 1;
for(int i = 1; i < m; i ++) a[i] = a[i - 1] + n;
map<int, int> mp;
for(int i = 1; i <= n; i ++)
for(int j = 0; j < m; j ++)
{
mp[(i * a[j]) % (n * m)] = 1;
}
if(mp.size() == n * m)
{
if(!flag)
{
cout << "Yes" << endl;
for(int i = 1; i <= n; i ++) cout << i % p << " ";
cout << endl;
for(int i = 0; i < m; i ++) cout << a[i] % p << " ";
cout << endl;
}
else
{
cout << "Yes" << endl;
for(int i = 0; i < m; i ++) cout << a[i] % p << " ";
cout << endl;
for(int i = 1; i <= n; i ++) cout << i % p << " ";
cout << endl;
}
return;
}
mp.clear();
for(int i = 1, k = 1; i <= n; i ++, k += 2)
for(int j = 0; j < m; j ++)
{
mp[(k * a[j]) % (n * m)] = 1;
}
if(mp.size() == n * m)
{
if(!flag)
{
cout << "Yes" << endl;
for(int i = 1, k = 1; i <= n; i ++, k += 2) cout << k % p << " ";
cout << endl;
for(int i = 0; i < m; i ++) cout << a[i] % p << " ";
cout << endl;
}
else
{
cout << "Yes" << endl;
for(int i = 0; i < m; i ++) cout << a[i] % p << " ";
cout << endl;
for(int i = 1, k = 1; i <= n; i ++, k += 2) cout << k % p << " ";
cout << endl;
}
return;
}
cout << "No" << endl;
}
int main()
{
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
int T = 1;
cin >> T;
while(T --)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3588kb
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: 239ms
memory: 54096kb
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: 252ms
memory: 54052kb
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: 247ms
memory: 40460kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 176ms
memory: 51852kb
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 17...
result:
ok 1 cases (1 test case)
Test #6:
score: 0
Accepted
time: 259ms
memory: 40324kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: 0
Accepted
time: 173ms
memory: 52004kb
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: 233ms
memory: 40916kb
input:
1 3 333333
output:
No
result:
ok 1 cases (1 test case)
Test #9:
score: 0
Accepted
time: 232ms
memory: 51408kb
input:
1 3 333332
output:
Yes 1 3 5 1 4 7 10 13 16 19 22 25 28 31 34 37 40 43 46 49 52 55 58 61 64 67 70 73 76 79 82 85 88 91 94 97 100 103 106 109 112 115 118 121 124 127 130 133 136 139 142 145 148 151 154 157 160 163 166 169 172 175 178 181 184 187 190 193 196 199 202 205 208 211 214 217 220 223 226 229 232 235 238 241 2...
result:
ok 1 cases (1 test case)
Test #10:
score: 0
Accepted
time: 216ms
memory: 40796kb
input:
1 333333 3
output:
No
result:
ok 1 cases (1 test case)
Test #11:
score: 0
Accepted
time: 248ms
memory: 51400kb
input:
1 333332 3
output:
Yes 1 4 7 10 13 16 19 22 25 28 31 34 37 40 43 46 49 52 55 58 61 64 67 70 73 76 79 82 85 88 91 94 97 100 103 106 109 112 115 118 121 124 127 130 133 136 139 142 145 148 151 154 157 160 163 166 169 172 175 178 181 184 187 190 193 196 199 202 205 208 211 214 217 220 223 226 229 232 235 238 241 244 247 ...
result:
ok 1 cases (1 test case)
Test #12:
score: -100
Wrong Answer
time: 211ms
memory: 43268kb
input:
1 4 249999
output:
No
result:
wrong answer Wrong Verdict (test case 1)