CodeForces 803A Maximal Binary Matrix-【思维+构造】
来源:互联网 发布:java调用ocx控件实例 编辑:程序博客网 时间:2024/06/14 05:17
传送门:点击打开链接
You are given matrix with n rows and n columns filled with zeroes. You should putk ones in it in such a way that the resulting matrix is symmetrical with respect to the main diagonal (the diagonal that goes from the top left to the bottom right corner) and is lexicographically maximal.
One matrix is lexicographically greater than the other if the first different number in the first different row from the top in the first matrix is greater than the corresponding number in the second one.
If there exists no such matrix then output -1.
The first line consists of two numbers n and k (1 ≤ n ≤ 100,0 ≤ k ≤ 106).
If the answer exists then output resulting matrix. Otherwise output-1.
2 1
1 0 0 0
3 2
1 0 0 0 1 0 0 0 0
2 5
-1
题意:给一个n*n的矩阵,在矩阵中加入k个1,使矩阵为对称矩阵,并且从上到下从左到右都是最大的
解题:直接构造矩阵 但要注意第二个for要从 i 开始
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main(){int n,k;int a[110][110];while(scanf("%d%d",&n,&k)!=EOF){memset(a,0,sizeof(a));if(n*n < k){printf("-1\n");continue;}for(int i = 1; i <= n; i++){for(int j = i; j <= n; j++)//j从i 开始 {if(k == 0)break;if(i == j){a[i][j]=1;//对角线 从上往下 k--;}else{if(k == 1)//当 k=1 时 在对角线两边不能形成对称结构 continue;//不是break;当为1时 可以排在对角线上 a[i][j]=a[j][i]=1;//对角线两边;k-=2; }if(k == 0)break;}if(k == 0)break;}for(int i = 1; i <= n; i++){for(int j = 1; j <= n; j++)printf("%d%c",a[i][j],j == n ?'\n':' '); }}return 0;}
- CodeForces 803A Maximal Binary Matrix-【思维+构造】
- Codeforces 803 A. Maximal Binary Matrix (模拟
- Codeforces 803A Maximal Binary Matrix 题解
- CodeForces 803A Maximal Binary Matrix
- 【CodeForces 803A】Maximal Binary Matrix(模拟)
- 803A Maximal Binary Matrix
- CF#803 A. Maximal Binary Matrix(贪心)
- Educational Codeforces Round 20 Maximal Binary Matrix
- Codeforces803A Maximal Binary Matrix
- Codeforces 803C Maximal GCD【思维】
- 【Codeforces 803 A】+ 构造
- CF803C:Maximal GCD(思维 & 构造)
- Codeforces 364 A Matrix 题解(矩形构造)
- Codeforces 303A Lucky Permutation Triple 【构造 思维】
- 【思维 && 构造】CodeForces
- Maximal Square,Given a 2D binary matrix filled with 0's and 1's, find the largest squar
- CodeForces 364A Matrix
- codeforces-754【A思维】
- nginx rewrite proxy_pass location实践及正则匹配
- 二叉堆
- 流程图解Spring Framework(五) Spring BeanFactoryPostProcessor如何工作的?
- java基础之细节补充
- Linux(centos)环境+xmanager+eclipse安装使用
- CodeForces 803A Maximal Binary Matrix-【思维+构造】
- Thinkphp5 Auth权限认证
- JSP取不到modelandview传过来的值
- 研发工程师必会的Linux命令
- 趣图:新出了一些有趣的动物技术书
- 17 天拿到 70 份面试,这个程序员是如何做的?
- 为Ubuntu 16.04 添加永久免费https SSL证书(解决python2.7
- 【树形dp】二叉苹果树
- 流程图解Spring Framework(六) Spring BeanPostProcessor如何工作的?