QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#810151#9799. Magical Palette0x3fWA 29ms3744kbC++14752b2024-12-11 20:06:092024-12-11 20:06:09

Judging History

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

  • [2024-12-11 20:06:09]
  • 评测
  • 测评结果:WA
  • 用时:29ms
  • 内存:3744kb
  • [2024-12-11 20:06:09]
  • 提交

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=1;i<=m;i++) cout<<i<<" \n"[i==m];
		return ;
	}
	if(m==1) {
		cout<<"Yes\n";
		for(int i=1;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: 3604kb

input:

2
2 3
2 2

output:

Yes
1 4
1 3 5
No

result:

ok 2 cases (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 29ms
memory: 3744kb

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)