QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#783440#9799. Magical PalettekuaileqiewuyouWA 39ms3944kbC++141.7kb2024-11-26 09:50:472024-11-26 09:50:49

Judging History

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

  • [2024-11-26 09:50:49]
  • 评测
  • 测评结果:WA
  • 用时:39ms
  • 内存:3944kb
  • [2024-11-26 09:50:47]
  • 提交

answer

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int T,n,m;


int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        
        if(n==2||m==2)
        {
            if(n==2&&m==2) printf("No\n");
            else
            {
                
                if(n==2&&m%2==1)
                {
                    printf("Yes\n");
                    printf("%d %d\n",1,2);
                    for(int i = 1;i<=m;i++)
                    {
                        printf("%d ",i*2-1);
                    }
                    printf("\n");
                }
                else if(n%2==1&&m==2)
                {
                    printf("Yes\n");
                    for(int i = 1;i<=n;i++)
                    {
                        printf("%d ",i*2-1);
                    }printf("\n");
   
                    
                    printf("1 2\n");
                    
                }
                else printf("No\n");
            }
        }
        else if(n==1||m==1)
        {
            printf("Yes\n");
            if(n==1)
            {
                printf("1\n");
                for(int i = 1;i<=m;i++)
                {
                    printf("%d ",i);
                }printf("\n");
            }
            else
            {
                for(int i = 1;i<=n;i++)
                {
                    printf("%d ",i);
                }printf("\n");
                printf("1\n");
            }
        }
        else
        {
            printf("No\n");
        }
    }
    
    
    
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 39ms
memory: 3832kb

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

result:

wrong answer Integer parameter [name=b[1000000]] equals to 1000000, violates the range [0, 999999] (test case 1)