QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#793252#9799. Magical PaletteModCxWA 31ms3684kbC++171.5kb2024-11-29 18:00:312024-11-29 18:00:32

Judging History

This is the latest submission verdict.

  • [2024-11-29 18:00:32]
  • Judged
  • Verdict: WA
  • Time: 31ms
  • Memory: 3684kb
  • [2024-11-29 18:00:31]
  • Submitted

answer

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

void sol()
{
    int n, m;
    cin >> n >> m;
    if (n % 2 == 0 && m % 2 == 0)
    {
        cout << "No" << endl;
        return;
    }
    cout << "Yes" << endl;
    if (n % 2 && m % 2)
    {
        if (n < m)
        {
            for (int i = 1; i <= n; i++)
            {
                cout << i << " ";
            }
            cout << endl;

            for (int i = 1; i <= m; i++)
            {
                cout << 1 + n * (i - 1) << " \n"[i == m];
            }
        }
        else
        {
            for (int i = 1; i <= n; i++)
            {
                cout << 1 + m * (i - 1) << " ";
            }
            cout << endl;

            for (int i = 1; i <= m; i++)
            {
                cout << i << " \n"[i == m];
            }
        }
    }
    else if (m % 2)
    {
        for (int i = 1; i <= n; i++)
        {
            cout << i << " ";
        }
        cout << endl;

        for (int i = 1; i <= m; i++)
        {
            cout << 1 + n * (i - 1) << " \n"[i == m];
        }
    }
    else if (n % 2)
    {
        for (int i = 1; i <= n; i++)
        {
            cout << 1 + m * (i - 1) << " ";
        }
        cout << endl;

        for (int i = 1; i <= m; i++)
        {
            cout << i << " \n"[i == m];
        }
    }
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        sol();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3684kb

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)