QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#135100#6643. Graphs and ColorsSolitaryDream#WA 0ms3652kbC++20913b2023-08-05 11:30:352023-08-05 11:30:38

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 11:30:38]
  • 评测
  • 测评结果：WA
  • 用时：0ms
  • 内存：3652kb
查看
  • [2023-08-05 11:30:35]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=1e2+1e1+7;

int T,n,k;

int ans[N][N];

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&k);
        if(k*(n-1)>n*(n-1)/2)
        {
            puts("NO");
            continue;
        }
        for(int i=1;i+1<=n;i+=2)
        {
            ans[i][i+1]=ans[i+1][i]=i;
            for(int j=1;j<i;j+=2)
            {
                ans[i][j]=ans[i+1][j+1]=i;
                ans[j][i]=ans[j+1][i+1]=i;
                ans[i+1][j]=ans[i][j+1]=j;
                ans[j][i+1]=ans[j+1][i]=j;
            }
        }
        if(n%2==1)
        {
            for(int i=1;i+1<=n;i+=2)
                ans[n][i]=ans[n][i+1]=i;
        }
        puts("YES");
        for(int i=1;i<=n;i++)
            for(int j=1;j<i;j++)
                printf("%d%c",min(ans[i][j],k)," \n"[j+1==i]);
    }
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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
1 2 2
2 1 2 2
1 2 2 2 2
2 1 2 2 2 ...

result:

wrong answer Graph is not correct (test case 52)
English 繁體中文 简体中文

Server Time: 2024-12-03 20:24:01 | OpenSource Project