QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#796883#9799. Magical PaletteMr_WayWA 32ms3668kbC++20791b2024-12-02 08:59:562024-12-02 08:59:57

Judging History

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

  • [2024-12-02 08:59:57]
  • 评测
  • 测评结果:WA
  • 用时:32ms
  • 内存:3668kb
  • [2024-12-02 08:59:56]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N (int)2e5 + 5
#define pdd pair<double, double>
#define pii pair<int, int>

int a, b, c, d, x, y, n, m, t, k, q, l, r, p, z, h;
int num[N];
string s;
map<int, int> mp;
int gcd(int a, int b) {
    return b?gcd(b,a%b):a;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	// 注意根据数据量调整N的大小
    cin >> t;
    while (t--) {
        cin >> n >> m;
        if (gcd(n,m)!=1) cout << "No\n";
        else {
            cout << "Yes\n";
            for (int i = 0; i < n; i++) cout << i * m + 1 << ' ';
            cout << '\n';
            for (int i = 0; i < m; i++) cout << i * n + 1<< ' ';
            cout<<"\n";
        }
    }
	return 0;
}

詳細信息

Test #1:

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

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

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)