QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#135216#6643. Graphs and ColorsDelay_for_five_minutes#WA 0ms3596kbC++20854b2023-08-05 12:55:362023-08-05 12:55:37

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-05 12:55:37]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3596kb
  • [2023-08-05 12:55:36]
  • 提交

answer

#include<bits/stdc++.h>
int G[105][105];
void solve() {
    int n,k;
    scanf("%d%d",&n,&k);
    if (k > n / 2) {
        printf("NO\n");return ;
    }
    printf("YES\n");
    for(int i=1;i<=n;i+=2) {
        G[i][i+1] = (i+1)/2;
        for(int j=1;j<=i;j+=2) {
            // printf("%d %d\n",j,i);
            G[j][i] = (i + 1) / 2;
            G[j + 1][i] = (j + 1) / 2;
            G[j][i + 1] = (i + 1) / 2;
            G[j + 1][i + 1] = (j + 1) / 2;
        }
    }
    if (n % 2 == 1) {
        for(int i=1;i<n;i++) {
            G[i][n] = (i + 1) / 2;
        }
    }
    for(int i=2;i<=n;i++) {
        for(int j=1;j<i;j++) {
            printf("%d ",G[j][i] > k ? k : G[j][i]);
        }
        putchar('\n');
    }
}
int main() {
    int T;
    scanf("%d",&T);
    while(T--) {
        solve();
    }
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3596kb

input:

768
8 24
7 20
17 61
17 76
16 100
16 16
15 59
9 17
14 31
14 61
10 32
17 55
5 7
10 29
14 82
13 47
17 32
5 10
16 76
14 59
8 28
13 19
12 41
13 41
11 32
11 53
3 2
16 52
16 87
7 12
9 15
15 65
15 53
17 47
6 15
12 1
14 35
16 60
12 31
14 70
15 88
12 2
8 23
12 38
16 111
16 117
5 4
14 90
12 55
15 41
15 48
15 4...

output:

NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
YES
1 
1 1 
1 1 1 
1 1 1 1 
1 1 1 1 1 
1 1 1 1 1 1 
1 1 1 1 1 1 1 
1 1 1 1 1 1 1 1 
1 1 1 1 1 1 1 1 1 
1 1 1 1 1 1 1 1 1 1 
1 1 1 1 1 1 1 1 1 1 1 
NO
NO
NO
NO
NO
YES
1 
2 1 
2 1 2 
2 1 2 2 
2 1 2...

result:

wrong answer Graph is not correct (test case 42)