QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#783391#9799. Magical PalettekuaileqiewuyouWA 0ms3860kbC++141022b2024-11-26 09:29:512024-11-26 09:29:51

Judging History

This is the latest submission verdict.

  • [2024-11-26 09:29:51]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3860kb
  • [2024-11-26 09:29:51]
  • Submitted

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
            {
                printf("Yes\n");
                if(n==2)
                {
                    
                    printf("%d %d\n",1,2);
                    for(int i = 1;i<=m;i++)
                    {
                        printf("%d ",i*2-1);
                    }
                    printf("\n");
                }
                else
                {
                    for(int i = 1;i<=n;i++)
                    {
                        printf("%d ",i*2-1);
                    }
   
                    
                    printf("1 2\n");
                    
                }
            }
        }
    }
    
    
    
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 0ms
memory: 3600kb

input:

1
1 1000000

output:


result:

wrong output format Unexpected end of file - token expected (test case 1)