QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#810158#9799. Magical Palette0x3fWA 36ms5168kbC++14742b2024-12-11 20:08:432024-12-11 20:08:44

Judging History

This is the latest submission verdict.

  • [2024-12-11 20:08:44]
  • Judged
  • Verdict: WA
  • Time: 36ms
  • Memory: 5168kb
  • [2024-12-11 20:08:43]
  • Submitted

answer

#include <bits/stdc++.h>
#define ll long long

using namespace std;

void solve() {
	int n,m;cin>>n>>m;
	if(n==1) {
		cout<<"Yes\n";cout<<"1\n";
		for(int i=0;i<m;i++) cout<<i<<" \n"[i==m];
		return ;
	}
	if(m==1) {
		cout<<"Yes\n";
		for(int i=0;i<n;i++) cout<<i<<" \n"[i==m];cout<<"1\n";
		return ;
	}
	if((n&1)==(m&1)) {cout<<"No\n";return ;}
	vector<int> a(n+1,0),b(m+1,0);
	for(int i=1;i<=n;i++) a[i]=(i-1)*m+1;
	for(int i=1;i<=m;i++) b[i]=(i-1)*n+1;
	cout<<"Yes\n";
	for(int i=1;i<=n;i++) cout<<a[i]<<" \n"[i==n];
	for(int i=1;i<=m;i++) cout<<b[i]<<" \n"[i==m];
	return ;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int tc;cin>>tc;
	while(tc--) solve();
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3544kb

input:

2
2 3
2 2

output:

Yes
1 4
1 3 5
No

result:

ok 2 cases (2 test cases)

Test #2:

score: 0
Accepted
time: 36ms
memory: 3488kb

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: 32ms
memory: 3820kb

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

input:

1
2 500000

output:

No

result:

ok 1 cases (1 test case)

Test #5:

score: 0
Accepted
time: 16ms
memory: 5168kb

input:

1
2 499999

output:

Yes
1 500000
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 17...

result:

ok 1 cases (1 test case)

Test #6:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

1
500000 2

output:

No

result:

ok 1 cases (1 test case)

Test #7:

score: 0
Accepted
time: 15ms
memory: 5152kb

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

input:

1
3 333333

output:

No

result:

ok 1 cases (1 test case)

Test #9:

score: 0
Accepted
time: 9ms
memory: 4488kb

input:

1
3 333332

output:

Yes
1 333333 666665
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 ...

result:

ok 1 cases (1 test case)

Test #10:

score: 0
Accepted
time: 0ms
memory: 3548kb

input:

1
333333 3

output:

No

result:

ok 1 cases (1 test case)

Test #11:

score: 0
Accepted
time: 13ms
memory: 4484kb

input:

1
333332 3

output:

Yes
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 244 247 ...

result:

ok 1 cases (1 test case)

Test #12:

score: 0
Accepted
time: 7ms
memory: 4064kb

input:

1
4 249999

output:

Yes
1 250000 499999 749998
1 5 9 13 17 21 25 29 33 37 41 45 49 53 57 61 65 69 73 77 81 85 89 93 97 101 105 109 113 117 121 125 129 133 137 141 145 149 153 157 161 165 169 173 177 181 185 189 193 197 201 205 209 213 217 221 225 229 233 237 241 245 249 253 257 261 265 269 273 277 281 285 289 293 297 3...

result:

ok 1 cases (1 test case)

Test #13:

score: 0
Accepted
time: 0ms
memory: 3552kb

input:

1
249998 4

output:

No

result:

ok 1 cases (1 test case)

Test #14:

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

input:

1
14925 67

output:

No

result:

wrong answer Wrong Verdict (test case 1)