QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#799560	#9799. Magical Palette	xh_team^#	WA	47ms	11492kb	C++20	2.7kb	2024-12-05 15:52:31	2024-12-05 15:52:36

Judging History

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

[2024-12-05 15:52:36]
评测

测评结果：WA
用时：47ms
内存：11492kb

查看

[2024-12-05 15:52:31]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PII pair<int,int>
#define lson 2*p
#define rson 2*p+1
#define x first
#define y second
#define endl "\n"
const int N=1e6+10;
const int mod=1e9+7;
int n,m;
vector<int> a,b;
int vis[N];
void solve() {
    cin>>n>>m;
    int flag=0;
    if(n==m) {
        if(n==1) {
            cout<<"Yes"<<endl;
            cout<<0<<endl;
            cout<<0<<endl;
        } else {
            cout<<"No"<<endl;
        }
        return ;
    }
    if(n==1) {
        cout<<"Yes"<<endl;
        cout<<1<<endl;
        for(int i=1;i<=m;i++) cout<<i-1<<" ";
        cout<<endl;
        return ;
    }
    if(m==1) {
        cout<<"Yes"<<endl;
        for(int i=1;i<=n;i++) cout<<i-1<<" ";
        cout<<endl;
        cout<<1<<endl;
        return ;
    }
    if(n%2==0&&m%2==0) {
        cout<<"No"<<endl;
        return ;
    }
    if(n==2) {
        cout<<"Yes"<<endl;
        cout<<1<<" "<<2<<endl;
        for(int i=1;i<=m;i++) cout<<(i-1)*n+1<<" ";
        cout<<endl;
        return ;
    }
    if(m==2) {
        cout<<"Yes"<<endl;
        for(int i=1;i<=n;i++) cout<<(i-1)*m+1<<" ";
        cout<<endl;
        cout<<1<<" "<<2<<endl;
        return ;
    }
    if(n%2==1&&m%2==1) {
        if(vis[n]||vis[m]) {
            cout<<"No"<<endl;
            return ;
        }
        cout<<"Yes"<<endl;
        if(n<m) {
            for(int i=1;i<=n;i++) cout<<i<<" ";
            cout<<endl;
            for(int i=1;i<=m;i++) cout<<(i-1)*n+1<<" ";
            cout<<endl;
        } else {
            for(int i=1;i<=n;i++) cout<<(i-1)*m+1<<" ";
            cout<<endl;
            for(int i=1;i<=m;i++) cout<<i<<" ";
            cout<<endl;
        }
    } else if(n%2==0) {
        if(m<n) {
            cout<<"No"<<endl;
            return ;
        }
        if(vis[m]) {
            cout<<"No"<<endl;
            return ;
        }
        cout<<"Yes"<<endl;
        for(int i=1;i<=n;i++) cout<<i<<" ";
        cout<<endl;
        for(int i=1;i<=m;i++) cout<<(i-1)*n+1<<" ";
        cout<<endl;
    } else {
        if(n<m) {
            cout<<"No"<<endl;
            return ;
        }
        if(vis[n]) {
            cout<<"No"<<endl;
            return ;
        }
        cout<<"Yes"<<endl;
        for(int i=1;i<=n;i++) cout<<(i-1)*m+1<<" ";
        cout<<endl;
        for(int i=1;i<=m;i++) cout<<i<<" ";
        cout<<endl;
    }

}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
    int T=1;
    for(int i=2;i<N;i++) {
    	if(!vis[i]) {
    		for(int j=i*2;j<N;j+=i) vis[j]=1;
		}
	}
     cin>>T;
    while(T--) {
        solve();
    }
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 11ms

memory: 11492kb

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: 44ms

memory: 11428kb

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: 47ms

memory: 11420kb

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: 7ms

memory: 11424kb

input:

1
2 500000

output:

No

result:

ok 1 cases (1 test case)

Test #5:

score: 0

Accepted

time: 29ms

memory: 11420kb

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: 10ms

memory: 11480kb

input:

1
500000 2

output:

No

result:

ok 1 cases (1 test case)

Test #7:

score: 0

Accepted

time: 28ms

memory: 11428kb

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: 7ms

memory: 11452kb

input:

1
3 333333

output:

No

result:

ok 1 cases (1 test case)

Test #9:

score: -100

Wrong Answer

time: 6ms

memory: 11416kb

input:

1
3 333332

output:

No

result:

wrong answer Wrong Verdict (test case 1)