QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#793255#9799. Magical PaletteModCxWA 51ms3684kbC++171.9kb2024-11-29 18:02:562024-11-29 18:03:01

Judging History

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

  • [2024-11-29 18:03:01]
  • 评测
  • 测评结果:WA
  • 用时:51ms
  • 内存:3684kb
  • [2024-11-29 18:02:56]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

void sol()
{
    int n, m;
    cin >> n >> m;
    if(n == 1){
        cout << "Yes" << endl;
        cout << 1 << endl;
        for(int i = 0;i<m;i++){
            cout << i << " ";
        }
        cout << endl;
        return ;
    }
    if(m == 1){
        cout << "Yes" << endl;
        for(int i = 0;i<n;i++){
            cout << i << " ";
        }
        cout << endl;
        cout << 1 << endl;
        
        return ;
    }
    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: 3628kb

input:

2
2 3
2 2

output:

Yes
1 2 
1 3 5
No

result:

ok 2 cases (2 test cases)

Test #2:

score: 0
Accepted
time: 51ms
memory: 3672kb

input:

1
1 1000000

output:

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

result:

ok 1 cases (1 test case)

Test #3:

score: 0
Accepted
time: 39ms
memory: 3624kb

input:

1
1000000 1

output:

Yes
0 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 10...

result:

ok 1 cases (1 test case)

Test #4:

score: 0
Accepted
time: 0ms
memory: 3496kb

input:

1
2 500000

output:

No

result:

ok 1 cases (1 test case)

Test #5:

score: 0
Accepted
time: 22ms
memory: 3604kb

input:

1
2 499999

output:

Yes
1 2 
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63 65 67 69 71 73 75 77 79 81 83 85 87 89 91 93 95 97 99 101 103 105 107 109 111 113 115 117 119 121 123 125 127 129 131 133 135 137 139 141 143 145 147 149 151 153 155 157 159 161 163 165 167 169 171 17...

result:

ok 1 cases (1 test case)

Test #6:

score: 0
Accepted
time: 0ms
memory: 3536kb

input:

1
500000 2

output:

No

result:

ok 1 cases (1 test case)

Test #7:

score: 0
Accepted
time: 26ms
memory: 3684kb

input:

1
499999 2

output:

Yes
1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63 65 67 69 71 73 75 77 79 81 83 85 87 89 91 93 95 97 99 101 103 105 107 109 111 113 115 117 119 121 123 125 127 129 131 133 135 137 139 141 143 145 147 149 151 153 155 157 159 161 163 165 167 169 171 173 175...

result:

ok 1 cases (1 test case)

Test #8:

score: -100
Wrong Answer
time: 15ms
memory: 3600kb

input:

1
3 333333

output:

Yes
1 2 3 
1 4 7 10 13 16 19 22 25 28 31 34 37 40 43 46 49 52 55 58 61 64 67 70 73 76 79 82 85 88 91 94 97 100 103 106 109 112 115 118 121 124 127 130 133 136 139 142 145 148 151 154 157 160 163 166 169 172 175 178 181 184 187 190 193 196 199 202 205 208 211 214 217 220 223 226 229 232 235 238 241 2...

result:

wrong answer Wrong Verdict (test case 1)