Codeforces Round #423 (Div. 2)
codeforces 423 A. Restaurant Tables 【水题】
//注意,一个人选座位的顺序,先去单人桌,没有则去空的双人桌,再没有则去有一个人坐着的双人桌。读清题意。
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int n, a, b, bb, x;
int main()
{
int ans = ;
scanf("%d%d%d", &n, &a, &b);
while(n--) {
scanf("%d", &x);
if(x==) {
if(a) a--;
else if(b) b--, bb++;
else if(bb) bb--;
else ans++;
}
else {
if(b) b--;
else ans += ;
}
}
printf("%d\n", ans);
return ;
}
codeforces 423 B. Black Square 【模拟】
题意:求需要将几块W涂成B能使所有B组成方形
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = ;
char s[N][N];
int n, m, ans;
int main()
{
int i, j, cnt = ;
scanf("%d%d", &n, &m);
int l1=m-, l2=n-, r1=, r2=;
for(i = ; i < n; ++i) scanf("%s", s[i]);
for(i = ; i < n; ++i) {
for(j = ; j < m; ++j) {
if(s[i][j] == 'B') {
cnt++;
l1 = min(l1, j); l2 = min(l2, i);
r1 = max(r1, j); r2 = max(r2, i);
}
}
}
int len = max(r1-l1+, r2-l2+);
if(len > min(n, m)) ans = -;
else if(!cnt) ans = ;
else { ans = len*len - cnt; }
printf("%d\n", ans);
return ;
}
codeforces 423 C. String Reconstruction 【字符串】
题意:给你n个子串的出现次数和出现位置,构造原字符串,要求字典序最小。
//对每个子串出现位置判断有没有和前一个位置的区间重复,从没有重复的部分继续构造,避免超时。
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 2e6+;
char s[N], t[N];
int n, k, x, ans;
int main()
{
memset(s, 'a', sizeof(s));
int i, j, r = ;
scanf("%d", &n);
while(n--) {
scanf("%s %d", t, &k);
int len = strlen(t);
int pre = -len;
for(i = ; i < k; ++i) {
scanf("%d", &x);
for(j = max(, len-(x-pre)); j < len; ++j)
s[j+x-] = t[j];
pre = x;
r = max(r, x+len-);
}
}
for(i = ; i < r; ++i)
printf("%c", s[i]);
puts("");
return ;
}
codeforces 423 D. High Load 【构造】
题意:给出结点总数n和出口结点数k,(出口结点度数为1,其他结点度数至少为2, 结点编号为1~n)构造网络,使得两个最远的出口节点之间的距离最小的。(两节点之间的距离是这两个节点之间的线数)。输出最远结点之间的最小距离 和 构造出的网络。
题解:就是构造一棵深度最小的树,先将k个结点都与根结点相连,然后依次将剩余结点与这k个结点相连,层次性加深树的深度即可。
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int n, k, m, h, d;
int main()
{
int i, ans;
scanf("%d%d", &n, &k);
h = (n-) / k;
d = (n-) % k;
if(!d) ans = * h;
else if(d == ) ans = * h + ;
else ans = * h + ;
printf("%d\n", ans);
for(i = ; i <= k+; ++i) printf("1 %d\n", i);
for(i = k+; i <= n; ++i) printf("%d %d\n", i, i-k);
return ;
}
Codeforces Round #423 (Div. 2)的更多相关文章
- Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals)
Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals) A.String Reconstruction B. High Load C ...
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) E. DNA Evolution 树状数组
E. DNA Evolution 题目连接: http://codeforces.com/contest/828/problem/E Description Everyone knows that D ...
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) D. High Load 构造
D. High Load 题目连接: http://codeforces.com/contest/828/problem/D Description Arkady needs your help ag ...
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) C. String Reconstruction 并查集
C. String Reconstruction 题目连接: http://codeforces.com/contest/828/problem/C Description Ivan had stri ...
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) A,B,C
A.题目链接:http://codeforces.com/contest/828/problem/A 解题思路: 直接暴力模拟 #include<bits/stdc++.h> using ...
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) Problem E (Codeforces 828E) - 分块
Everyone knows that DNA strands consist of nucleotides. There are four types of nucleotides: "A ...
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) Problem D (Codeforces 828D) - 贪心
Arkady needs your help again! This time he decided to build his own high-speed Internet exchange poi ...
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) Problem C (Codeforces 828C) - 链表 - 并查集
Ivan had string s consisting of small English letters. However, his friend Julia decided to make fun ...
- Codeforces Round #423 (Div. 2, rated, based on VK Cup Finals) Problem A - B
Pronlem A In a small restaurant there are a tables for one person and b tables for two persons. It i ...
随机推荐
- find ip from hostname or find hostname from ip
1. find ip from hostname ping <hostname> 2.fin hostname from ip nslookup <ip>
- linux信息查看手记
系统 # uname -a # 查看内核/操作系统/CPU信息 # head -n 1 /etc/issue # 查看操作系统版本 # cat /proc/cpuinfo # 查看CPU信息 # ho ...
- golang基础---Slice切片
切片Slice在go语言中是单独的类型(指向底层的数组),不同于python(对可迭代对象操作的工具),注意区分数组和slice的区别 定义一个空slice,格式var s []int,这种既没有长度 ...
- Ubuntu17.10下编译Openjdk8u
一开始笔者用的系统和软件版本都是最新的,导致编译了好几次都失败,最后找到解决的办法,现在记录一下编译及解决的方法 避免以后忘记 所用操作系统 Ubuntu17.10 所用软件及版本 make 3.8. ...
- SSM实现批量删除功能
批量删除功能的实现 其实实现这个功能还是挺简单的 因为我这是直接拼接的,所以用了DOM方法来获取id话不多说直接上代码首先是复选框全选和反选这里的话 获取最上面一个复选框的状态同步到拼接的复选框 $ ...
- Python基础学习总结(四)
6.高阶特性 6.1迭代 如果给定一个list或tuple,我们可以通过for循环来遍历这个list或tuple,这种遍历我们称为迭代(Iteration).在Python中,迭代是通过for ... ...
- Spring Cloud个组件原理
引言 面试中面试官喜欢问组件的实现原理,尤其是常用技术,我们平时使用了SpringCloud还需要了解它的实现原理,这样不仅起到举一反三的作用,还能帮助轻松应对各种问题及有针对的进行扩展.以下是 课程 ...
- css美化checkbox
- 一个对inner jion ...on 的sql多表联合查询的练习
create database practiceSql; use practiceSql; -- create table student( `id` bigint not null auto_inc ...
- Ant design 项目打包后报错:"Menu(or Flex) is not defined"
我的项目使用了ant-design 和 ant-design-mobile,在测试环境上没问题,但是打包发布之后控制台报错 Menu is not defined Flex is not define ...