QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#791233 | #9799. Magical Palette | yolx# | WA | 47ms | 3660kb | C++20 | 2.0kb | 2024-11-28 17:38:04 | 2024-11-28 17:38:05 |
Judging History
answer
#include"bits/stdc++.h"
using namespace std;
#define ll long long
#define endl '\n'
#define fi first
#define se second
#define PLL pair<ll,ll>
#define PII pair<int,int>
#define vec vector
#define pb push_back
#define db double
const db pi = acos(-1.0);
const int N=1e5+10;
//const ll mod=1e9+7;
const ll mod=998244353;
ll lowbit(ll x){return x&-x;}
ll ksm(ll a,ll b,ll p){
a%=p;
ll res=1;
while(b){
if(b&1)res=res*a%p;
a=a*a%p;
b>>=1;
}
return res;
}
void solve(){
int n,m;cin>>n>>m;
if(n==1){
cout<<"Yes"<<endl;
cout<<1<<endl;
for(int i=1;i<=m;i++)cout<<i<<" ";
cout<<endl;
}
else if(m==1){
cout<<"Yes"<<endl;
for(int i=1;i<=n;i++)cout<<i<<" ";
cout<<endl;
cout<<1<<endl;
}
else if((n+m)&1){
if(n%2==0){
if(n>4)cout<<"No"<<endl;
else if(n==2){
cout<<"Yes"<<endl;
cout<<1<<" "<<2<<endl;
for(int i=1;i<=m;i++)cout<<i*2-1<<" ";
cout<<endl;
}
else{
cout<<"Yes"<<endl;
cout<<1<<" "<<2<<" "<<4<<m*2+1<<endl;
for(int i=1;i<=m;i++)cout<<i*2-1<<" ";
cout<<endl;
}
}
else{
if(m>4)cout<<"No"<<endl;
else if(m==2){
cout<<"Yes"<<endl;
for(int i=1;i<=n;i++)cout<<i*2-1<<" ";
cout<<endl;
cout<<1<<" "<<2<<endl;
}
else{
cout<<"Yes"<<endl;
for(int i=1;i<=n;i++)cout<<i*2-1<<" ";
cout<<endl;
cout<<1<<" "<<2<<" "<<4<<n*2+1<<endl;
}
}
}
else cout<<"No"<<endl;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int T=1;
cin>>T;
while(T--){
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
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: 47ms
memory: 3580kb
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)