QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#783152	#9799. Magical Palette	XiaoYang3	WA	31ms	8724kb	C++23	2.8kb	2024-11-26 00:01:19	2024-11-26 00:01:20

Judging History

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

[2024-11-26 00:01:20]
评测

测评结果：WA
用时：31ms
内存：8724kb

查看

[2024-11-26 00:01:19]
提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 1e5 + 5;
const ll P = 998244353;
ll m, n, x;
int a[N * 10], b[N * 10];
void solve() {
    cin >> n >> m;

    int fg = 0;
    if (n > m) {
        swap(n, m);
        fg = 1;
    }

    for (int i = 1; i <= n; i++) {
        a[i] = i;
    }
    ll now = 1;
    for (int j = 1; j <= m; j++) {
        b[j] = now;
        now += n;
    }

    if (n == 1) {
        if (fg) {
            cout << "Yes\n";
            for (int i = 1; i <= m; i++) {
                cout << b[i] << ' ';
            }
            cout << '\n';
            for (int i = 1; i <= n; i++) {
                cout << a[i] << ' ';
            }
            cout << '\n';

        } else {
            cout << "Yes\n";
            for (int i = 1; i <= n; i++) {
                cout << a[i] << ' ';
            }
            cout << '\n';
            for (int i = 1; i <= m; i++) {
                cout << b[i] << ' ';
            }
            cout << '\n';
        }
    } else if (n == 2) {
        if (m % 2) {
            if (fg) {
                cout << "Yes\n";
                for (int i = 1; i <= m; i++) {
                    cout << b[i] << ' ';
                }
                cout << '\n';
                for (int i = 1; i <= n; i++) {
                    cout << a[i] << ' ';
                }
                cout << '\n';

            } else {
                cout << "Yes\n";
                for (int i = 1; i <= n; i++) {
                    cout << a[i] << ' ';
                }
                cout << '\n';
                for (int i = 1; i <= m; i++) {
                    cout << b[i] << ' ';
                }
                cout << '\n';
            }
        } else {
            cout << "No\n";
        }
    } else {
        if (m % 2 && m % 3) {
            if (fg) {
                cout << "Yes\n";
                for (int i = 1; i <= m; i++) {
                    cout << b[i] << ' ';
                }
                cout << '\n';
                for (int i = 1; i <= n; i++) {
                    cout << a[i] << ' ';
                }
                cout << '\n';

            } else {
                cout << "Yes\n";
                for (int i = 1; i <= n; i++) {
                    cout << a[i] << ' ';
                }
                cout << '\n';
                for (int i = 1; i <= m; i++) {
                    cout << b[i] << ' ';
                }
                cout << '\n';
            }
        } else {
            cout << "No\n";
        }
    }
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 5640kb

input:

2
2 3
2 2

output:

Yes
1 2 
1 3 5 
No

result:

ok 2 cases (2 test cases)

Test #2:

score: -100

Wrong Answer

time: 31ms

memory: 8724kb

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)