Codeforces 990D 图论+思维

D. Graph And Its Complement

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Given three numbers $n,a,b$. You need to find an adjacency matrix of such an undirected graph that the number of components in it is equal to $a$, and the number of components in its complement is $b$. The matrix must be symmetric, and all digits on the main diagonal must be zeroes.

In an undirected graph loops (edges from a vertex to itself) are not allowed. It can be at most one edge between a pair of vertices.

The adjacency matrix of an undirected graph is a square matrix of size $n$ consisting only of "0" and "1", where $n$ is the number of vertices of the graph and the $i$-th row and the $i$-th column correspond to the $i$-th vertex of the graph. The cell $(i,j)$ of the adjacency matrix contains $1$if and only if the $i$-th and $j$-th vertices in the graph are connected by an edge.

A connected component is a set of vertices $X$ such that for every two vertices from this set there exists at least one path in the graph connecting this pair of vertices, but adding any other vertex to $X$ violates this rule.

The complement or inverse of a graph $G$ is a graph $H$ on the same vertices such that two distinct vertices of $H$ are adjacent if and only if they are not adjacent in $G$.

Input

In a single line, three numbers are given $n,a,b(1\le n\le 1000,1\le a,b\le n)$: is the number of vertexes of the graph, the required number of connectivity components in it, and the required amount of the connectivity component in it's complement.

Output

If there is no graph that satisfies these constraints on a single line, print "NO" (without quotes).

Otherwise, on the first line, print "YES"(without quotes). In each of the next $n$ lines, output $n$ digits such that $j$-th digit of $i$-th line must be $1$if and only if there is an edge between vertices $i$ and $j$ in $G$ (and $0$ otherwise). Note that the matrix must be symmetric, and all digits on the main diagonal must be zeroes.

If there are several matrices that satisfy the conditions — output any of them.

Examples

input

Copy

3 1 2

output

Copy

YES
001
001
110

input

Copy

3 3 3

output

Copy

NO

题意：构造一个n个顶点的图，使其有a个联通块，而他的补图有b个联通块。

题解：仔细想一下，会发现a与b中一定有一个为1.(若Va与Vb在一个联通块中，且存在Vc在另一个联通块中，则Va与Vb由Vc相连，在补图中也在同一个联通块内)。

所以当a,b均不为1时一定输出NO

要特别注意3,1,1和2,1,1的情况也是无法实现的。

代码：

#include <bits/stdc++.h>

using namespace std;

const int maxn = 300005;
int n, k, tmp, tot;
int a, b;
char str[maxn];
int ans[1005][1005];

int main()
{
    scanf("%d%d%d",&n, &a, &b);
    if (a != 1 && b != 1){
        printf("NO\n");
        return 0;
    }
    memset(ans,0,sizeof(ans));
    if (a == 1 && b == 1){
        if (n == 3 || n == 2){
            printf("NO\n");
        } else {
            printf("YES\n");
            for (int i=1; i<n; i++){
                ans[i][i+1] = ans[i+1][i] = 1;
            }
            for (int i=1; i<=n; i++){
                for (int j=1; j<=n; j++){
                    printf("%d",ans[i][j]);
                }
                cout<<endl;
            }
        }
        return 0;
    }
    if (a != 1){
        for (int i=2; i<=n-a+1; i++){
            ans[1][i] = 1;
            ans[i][1] = 1;
        }
    } else {
        for (int i=1; i<=n; i++)
            for (int j=1; j<=n; j++)
                if (i != j) ans[i][j] = 1;
        for (int i=2; i<=n-b+1; i++){
            ans[1][i] = 0;
            ans[i][1] = 0;
        }
    }
    cout<<"YES\n";
    for (int i=1; i<=n; i++){
        for (int j=1; j<=n; j++){
            printf("%d",ans[i][j]);
        }
        cout<<endl;
    }
    return 0;
}