QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#783602#9799. Magical PaletteKleavesWA 36ms3628kbC++171.2kb2024-11-26 10:54:552024-11-26 10:54:56

Judging History

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

  • [2024-11-26 10:54:56]
  • 评测
  • 测评结果:WA
  • 用时:36ms
  • 内存:3628kb
  • [2024-11-26 10:54:55]
  • 提交

answer

#pragma GCC optimize(3)
#define _CRT_SECURE_NO_WARNINGS 1
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define testin freopen("testin1.txt", "r", stdin)
#define testout freopen("testout1.txt", "w", stdout)
#define NO cout<<"No"<<endl
#define YES cout<<"Yes"<<endl
#define MAYBE cout<<"MAYBE"<<endl
#define endl '\n'
#define ALL(x) x.begin(),x.end()
#define INS(x)inserter(x,x.begin())
using namespace std;
const ll MAXN = 1000010;
const ll INF = 0x3f3f3f3f;
const ll mod = 998244353;
bool DEBUG = false;
void solve() {
	ll n, m;
	cin >> n >> m;
	if (gcd(n, m) != 1) {
		cout << "No" << endl;
		return;
	}
	cout << "Yes" << endl;
	ll flag = 0;
	if (n < m) {
		flag = 1;
		swap(n, m);
	}
	if (flag == 0) {
		for (int i = 0; i < n; i++) {
			cout << 1 + i * m << ' ';
		}
		cout << endl;
	}
	for (int i = 0; i < m; i++) {
		cout << 1 + n * i << ' ';
	}
	cout << endl;
	if (flag == 1) {
		for (int i = 0; i < n; i++) {
			cout << 1 + i * m << ' ';
		}
		cout << endl;
	}
	return;
}
int main() {
	//testin;
	//freopen("case1out.txt", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 36ms
memory: 3584kb

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 1...

result:

wrong answer Integer parameter [name=b[1000000]] equals to 1000000, violates the range [0, 999999] (test case 1)