Educational Codeforces Round 45 (Rated for Div. 2) D Graph And Its Complement(图的构造)

题意:构造一个图,使这个图的连通分量有a个,其补图的连通分量有b个,输出邻接矩阵
可以推出当min(a,b)!=1时输出no
a=b=1且n=2或者n=3时也为no
其余只要把一个连通分量里的x个点用x-1条边串起来就好了
哎,最后想到n=3也为no,可惜了..

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define inf 0x3f3f3f3f
#define pll pair<ll,ll>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define rep1(i,a,b) for(int i=a;i>=b;i--)
#define rson rt<<1|1,m+1,r
#define lson rt<<1,l,m
#define mod 323232323
using namespace std;
const int N=1000+100;
int arr[N][N];int main()
{#ifdef LOCAL_DEFINEfreopen("D:\\rush.txt","r",stdin);#endifios::sync_with_stdio(false),cin.tie(0);int n,a,b;cin>>n>>a>>b;if((n==2||n==3)&&a==1&&b==1){cout<<"NO"<<endl;return 0;}if(min(a,b)!=1){cout<<"NO"<<endl;}else{cout<<"YES"<<endl;int c=max(a,b);for(int i=1;i<=n-c;i++){arr[i][i+1]=1;arr[i+1][i]=1;}for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){if(i==j)cout<<0;else if(c!=a)cout<<!arr[i][j];elsecout<<arr[i][j];}cout<<endl;}}return 0;
}

转载于:https://www.cnblogs.com/ffgcc/p/10546390.html

Educational Codeforces Round 45 (Rated for Div. 2) D Graph And Its Complement(图的构造)相关推荐

Educational Codeforces Round 45 (Rated for Div. 2) A Commentary Boxes
题目描述: A 评论框波兰足球杯很快就要来了.来自世界各地的评论员将会参加到这个大事件中. 组织者已经建立了n个评论框,m个地方代表团将会到达世界杯.每个代表将会获得相同数量的评论框.如果任意一个 ...
Educational Codeforces Round 90 (Rated for Div. 2)（A, B, C, D, E）
Educational Codeforces Round 90 (Rated for Div. 2) Donut Shops 思路分三种情况: a==c/ba == c / ba==c/b这个时候两 ...
Educational Codeforces Round 104 (Rated for Div. 2) A,B,C,D,E
Educational Codeforces Round 104 (Rated for Div. 2) A,B,C,D,E A - Arena 题意 nnn 个英雄,他们的等级分别是 a1,a2,-, ...
Educational Codeforces Round 114 (Rated for Div. 2) （A ~ F）全题解
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Educational Codeforces Round 114 (Rated for Div. 2) ...
Educational Codeforces Round 106 (Rated for Div. 2)（A ~ E）题解（每日训练 Day.16 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 Educational Codeforces Round 106 (Rated for Div. ...
Educational Codeforces Round 37 (Rated for Div. 2) 1
Educational Codeforces Round 37 (Rated for Div. 2) A.Water The Garden 题意:Max想给花园浇水.花园可被视为长度为n的花园床,花园 ...
Educational Codeforces Round 89 (Rated for Div. 2)（A, B, C, D）
Educational Codeforces Round 89 (Rated for Div. 2) A. Shovels and Swords 思路题意非常简单,就是得到最多的物品嘛,我们假定a, ...
Educational Codeforces Round 114 (Rated for Div. 2) D. The Strongest Build 暴力 + bfs
传送门文章目录题意: 思路: 题意: 你有nnn个装备槽,每个槽里面有cic_ici个力量加成,对于每个槽只能选一个力量加成,现在给你mmm个力量组合[b1,b2,...,bn][b_1,b_2 ...
Educational Codeforces Round 72 (Rated for Div. 2) D. Coloring Edges dfs树/拓扑找环
传送门文章目录题意: 思路: 题意: 给你一张图,你需要给这个图的边染色,保证如果有环那么这个环内边的颜色不全相同,输出染色方案和用的颜色个数. n,m≤5e3n,m\le5e3n,m≤5e3 思 ...

Educational Codeforces Round 45 (Rated for Div. 2) D Graph And Its Complement(图的构造)

Educational Codeforces Round 45 (Rated for Div. 2) D Graph And Its Complement(图的构造)相关推荐

最新文章

热门文章