QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#785240 | #9799. Magical Palette | coloury | WA | 84ms | 3560kb | C++23 | 1.2kb | 2024-11-26 17:17:49 | 2024-11-26 17:17:50 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const char nl = '\n';
typedef long long ll;
typedef long double ld;
typedef long long int lli;
const int MOD = 1'000'000'007;
void solve(){
int n,m;
cin >> n >> m;
if(gcd(n,m) != 1){
cout << "No" << nl;
return;
}
cout << "Yes" << nl;
if(n == 1){
cout << 1 << nl;
for(int i = 1 ;i <= m;i++){
cout << i << " ";
}
cout << nl;
}else if(m == 1){
for(int i = 1 ;i <= n;i++){
cout << i << " ";
}
cout << nl;
cout << 1 << nl;
}
if(n > m){
for(int i = 0;i < n;i++){
cout << i * 2 + 1 << " ";
}
cout << nl;
int j = 0;
while(j < m && (1 << j) <= n * m){
cout << (1 << j) << " ";
j++;
}
for(;j < m;j++){
cout << 2 * m + 1 + 2 * j << " ";
}
cout << nl;
}else{
int j = 0;
while(j < n && (1 << j) <= n * m){
cout << (1 << j) << " ";
j++;
}
for(;j < n;j++){
cout << 2 * m + 1 + 2 * j << " ";
}
cout << nl;
for(int i = 0;i < m;i++){
cout << i * 2 + 1 << " ";
}
cout << nl;
}
}
int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int t = 1;
cin >> t;
while(t--){
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3504kb
input:
2 2 3 2 2
output:
Yes 1 2 1 3 5 No
result:
ok 2 cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 84ms
memory: 3560kb
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:
wrong answer Integer parameter [name=b[1000000]] equals to 1000000, violates the range [0, 999999] (test case 1)