QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#785337#9799. Magical PaletteQzong#WA 46ms5428kbC++14609b2024-11-26 17:34:472024-11-26 17:34:53

Judging History

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

  • [2024-11-26 17:34:53]
  • 评测
  • 测评结果:WA
  • 用时:46ms
  • 内存:5428kb
  • [2024-11-26 17:34:47]
  • 提交

answer

#include<cstdio>
int k[1000010];
void work(){
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n*m;i++)k[i]=0;
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
        int x=1+(i-1)*m,y=1+(j-1)*n;
        if(k[1ll*x*y%(n*m)]){
            puts("No");
            return ;
        }
        k[1ll*x*y%(n*m)]=1;
    }
    puts("Yes");
    for(int i=1;i<=n;i++)printf("%d ",1+(i-1)*m);
    puts("");
    for(int j=1;j<=m;j++)printf("%d ",1+(j-1)*n);
    puts("");
}
int main(){
    // freopen("a.in","r",stdin);
    int t;
    scanf("%d",&t);
    while(t--)work();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
2 3
2 2

output:

Yes
1 4 
1 3 5 
No

result:

ok 2 cases (2 test cases)

Test #2:

score: -100
Wrong Answer
time: 46ms
memory: 5428kb

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)