Codeforces 803 A. Maximal Binary Matrix (模拟
来源:互联网 发布:人工智能黑客类小说 编辑:程序博客网 时间:2024/06/05 02:47
Description
You are given matrix with n rows and n columns filled with zeroes. You should put k 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.
Input
The first line consists of two numbers n and k (1 ≤ n ≤ 100, 0 ≤ k ≤ 106).
Output
If the answer exists then output resulting matrix. Otherwise output -1.
Sample Input
2 1
3 2
Sample Output
1 0 0 0
1 0 0 0 1 0 0 0 0
题意
给您一个矩阵 和一个数字k问您是否能完全填充
填充规则按照字典序(从上到下)和中轴线对称的方法
题解:
一直没理解字典序是什么意思 后来想想就是按照从上到下的原则填充啊
我果然是个脑残
AC代码
#include <bits/stdc++.h>using namespace std;#define N 1000int vis[N][N];int main(){ int n, k; memset(vis,0,sizeof(vis)); scanf("%d%d",&n,&k); bool flag = true; if(k > n*n) flag = false; else { for(int i = 0;i < n; i++) { for(int j = 0;j < n; j++) { if(vis[i][j]) continue; else if(i==j && k!=0) { vis[i][j] = 1; k--; } else if (k>=2){ vis[i][j] = vis[j][i] = 1; k -= 2; } } } if(k) flag = false; } if(flag) { for(int i = 0;i < n; i++) { for(int j = 0;j < n; j++) { if(j==0) printf("%d",vis[i][j]); else printf(" %d",vis[i][j]); } printf("\n"); } } else puts("-1");return 0;}
- Codeforces 803 A. Maximal Binary Matrix (模拟
- 【CodeForces 803A】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
- Maximal Square,Given a 2D binary matrix filled with 0's and 1's, find the largest squar
- CodeForces 364A Matrix
- codeforces 803C Maximal GCD
- 【Codeforces 803 C. Maximal GCD】
- CodeForces-263A-Beautiful Matrix
- codeforces 263A Beautiful Matrix
- codeforces 691A 模拟
- Codeforces 67A【模拟】
- Codeforces 449A 模拟
- 微信小程序-页面跳转失败WAService.js:3 navigateTo:fail url not in app.json
- Minimum Inversion Number
- 4
- 字符串9:拼接最小字典序练习题
- 配置DSN时存在的问题
- Codeforces 803 A. Maximal Binary Matrix (模拟
- psrseInt第二个参数含义
- 统计学习精要 (Elements of Statistical Learning ) 习题 4.1
- eval()函数
- bzoj1877 晨跑
- 字符串10:空格替换练习题
- Centos7.3 安装Mysql5.7并修改初始密码
- 基于面向服务体系架构(SOA)和面向资源体系架构(ROA)的业务组件模型
- 字符串11:合法括号序列判断练习题