QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#784274#9799. Magical Palettenorth_hWA 45ms9000kbC++171.0kb2024-11-26 14:22:392024-11-26 14:22:40

Judging History

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

  • [2024-11-26 14:22:40]
  • 评测
  • 测评结果:WA
  • 用时:45ms
  • 内存:9000kb
  • [2024-11-26 14:22:39]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;

int main() {
    int t;
    cin >> t;
    while (t --) {
        int n, m;
        cin >> n >> m;
        if (__gcd(n, m) != 1) {
            cout << "No\n";
            return 0;
        }
        vector<int> row, col;
        for (int i = 0; i < n; i ++) row.push_back(i * m + 1);
        for (int i = 0; i < m; i ++) col.push_back(i * n + 1);
        cout << "Yes\n";
        for (auto i : row) cout << i << ' ';
        cout << '\n';
        for (auto i : col) cout << i << ' ';
        cout << '\n';
        // vector g(n + 1, vector<int>(m + 1));
        // for (int i = 1; i <= n; i ++) {
        //     for (int j = 1; j <= m; j ++) {
        //         g[i][j] = (row[i - 1] * col[j - 1]) % (n * m);
        //     }
        // }
        // for (int i = 1; i <= n; i ++) {
        //     for (int j = 1; j <= m; j ++) {
        //         cout << g[i][j] << ' ';
        //     }
        //     cout << '\n';
        // }
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 45ms
memory: 9000kb

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)