QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#791270#9799. Magical Paletteyolx#WA 46ms3704kbC++202.1kb2024-11-28 17:46:262024-11-28 17:46:42

Judging History

你现在查看的是最新测评结果

  • [2024-11-28 17:46:42]
  • 评测
  • 测评结果:WA
  • 用时:46ms
  • 内存:3704kb
  • [2024-11-28 17:46:26]
  • 提交

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&&m==1){
        cout<<"Yes"<<endl;
        cout<<0<<endl;
        cout<<0<<endl;
    }
    else if(n==1){
        cout<<"Yes"<<endl;
        cout<<1<<endl;
        for(int i=0;i<m;i++)cout<<i<<" ";
        cout<<endl;
    }
    else if(m==1){
        cout<<"Yes"<<endl;
        for(int i=0;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: 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: 43ms
memory: 3668kb

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: 46ms
memory: 3592kb

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: 3704kb

input:

1
2 500000

output:

No

result:

ok 1 cases (1 test case)

Test #5:

score: 0
Accepted
time: 20ms
memory: 3648kb

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: 3580kb

input:

1
500000 2

output:

No

result:

ok 1 cases (1 test case)

Test #7:

score: 0
Accepted
time: 24ms
memory: 3660kb

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: 3620kb

input:

1
3 333333

output:

No

result:

ok 1 cases (1 test case)

Test #9:

score: -100
Wrong Answer
time: 0ms
memory: 3660kb

input:

1
3 333332

output:

No

result:

wrong answer Wrong Verdict (test case 1)