QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#785455 | #9799. Magical Palette | MENDAX | WA | 41ms | 3712kb | C++20 | 1018b | 2024-11-26 18:00:27 | 2024-11-26 18:00:28 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int N = 1e4 + 10,INF=1e9+10;
int gcd(int a,int b){
return b?gcd(b,a%b):a;
}
void solve() {
int n,m;
cin>>n>>m;
if(gcd(n,m)!=1){
cout<<"No"<<endl;
}
else {
cout<<"Yes"<<endl;
if(n==1&&m==1){
cout<<0<<endl;
cout<<0<<endl;
}
else if(n==1){
cout<<1<<endl;
for(int i=0;i<m;i++)cout<<i<<" ";
cout<<endl;
}
else if(m==1){
for(int i=0;i<n;i++)cout<<i<<" ";
cout<<endl;
cout<<1<<endl;
}else if(n<m){
for(int i=1;i<=n;i++)cout<<i<<" ";
cout<<endl;
int no=1;
for(int i=1;i<=m;i++){
cout<<no<<" ";
no+=n;
}
cout<<endl;
}
else{
int no=1;
for(int i=1;i<=n;i++){
cout<<no<<" ";
no+=m;
}
cout<<endl;
for(int i=1;i<=m;i++)cout<<i<<" ";
cout<<endl;
}
}
}
signed main() {
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int T;cin >> T;
while (T--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3608kb
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: 41ms
memory: 3552kb
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: 37ms
memory: 3580kb
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: 0ms
memory: 3644kb
input:
1 2 500000
output:
No
result:
ok 1 cases (1 test case)
Test #5:
score: 0
Accepted
time: 19ms
memory: 3580kb
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: 0ms
memory: 3644kb
input:
1 500000 2
output:
No
result:
ok 1 cases (1 test case)
Test #7:
score: 0
Accepted
time: 23ms
memory: 3628kb
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: 0ms
memory: 3636kb
input:
1 3 333333
output:
No
result:
ok 1 cases (1 test case)
Test #9:
score: -100
Wrong Answer
time: 12ms
memory: 3712kb
input:
1 3 333332
output:
Yes 1 2 3 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:
wrong answer Duplicated Color 2 (test case 1)