Codeforces E. High Load(构造)
题目描述:
High Load
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output
Arkady needs your help again! This time he decided to build his own high-speed Internet exchange point. It should consist of n nodes connected with minimum possible number of wires into one network (a wire directly connects two nodes). Exactly k of the nodes should be exit-nodes, that means that each of them should be connected to exactly one other node of the network, while all other nodes should be connected to at least two nodes in order to increase the system stability.
Arkady wants to make the system as fast as possible, so he wants to minimize the maximum distance between two exit-nodes. The distance between two nodes is the number of wires a package needs to go through between those two nodes.
Help Arkady to find such a way to build the network that the distance between the two most distant exit-nodes is as small as possible.
Input
The first line contains two integers n and k (3 ≤ n ≤ 2·105, 2 ≤ k ≤ n - 1) — the total number of nodes and the number of exit-nodes.
Note that it is always possible to build at least one network with n nodes and k exit-nodes within the given constraints.
Output
In the first line print the minimum possible distance between the two most distant exit-nodes. In each of the next n - 1 lines print two integers: the ids of the nodes connected by a wire. The description of each wire should be printed exactly once. You can print wires and wires' ends in arbitrary order. The nodes should be numbered from 1 to n. Exit-nodes can have any ids.
If there are multiple answers, print any of them.
Examples
Input
Copy
3 2
Output
Copy
21 22 3
Input
Copy
5 3
Output
Copy
31 22 33 43 5
Note
In the first example the only network is shown on the left picture.
In the second example one of optimal networks is shown on the right picture.
Exit-nodes are highlighted.
思路:
题目是说给一个总的顶点数和特殊的顶点数,其中特殊的顶点只能连接另一个顶点,而其他顶点必须连至少两个顶点,现在要构造一种连接方式,使得特殊顶点距离的最大值最小。
刚开始看漏要求,以为可以成环,WA了后看清题目要是棵树,瞬间难度不在一个档次(虽然也不是太难),但我胡乱想也不知道要怎么构造。原来题目的思路是要把这棵树的没一个分支高度尽可能相等,也就是节点要尽可能平均,这样可以使距离最大值最小,如下:
然后就可以做了。先算出分摊下来每个分枝上至少有多少个节点,在算出余数就是要往分枝末端加上的节点。注意是当有一个节点多出来以后,两个特殊节点的最长距离加一;多两个节点后,由于这两个节点会加到不同分枝的末端,所以距离加二;而当多出节点数大于2,最长距离也是加二,因为多出的节点只加了不到一层节点,深度只增加一。
代码:
#include <iostream>
using namespace std;
int n,k;
int length;
int stem;
int main()
{
cin >> n >> k;
length = (n-1)/k*2;
stem = (n-1)/k;
int re = (n-1)%k;
if(re==0)
{
cout << length << endl;
//cout << "k " << k << endl;
for(int j = 2; j<n+1; j+=stem)
{
cout << 1 << " " << j << endl;
for(int z = j+1; z<j+stem; z++)
{
cout << z-1 << " " << z << endl;
}
}
}
if(re==1)
{
cout << length+1 << endl;
for(int j = 2; j<n; j+=stem)
{
cout << 1 << " " << j << endl;
for(int z = j+1; z<j+stem; z++)
{
cout << z-1 << " " << z << endl;
}
}
cout << n-1 << " " << n;
}
if(re==2)
{
//cout << "re " << re << " k " << k << endl;
cout << length+2 << endl;
for(int j = 2; j<n-1; j+=stem)
{
cout << 1 << " " << j << endl;
for(int z = j+1; z<j+stem; z++)
{
cout << z-1 << " " << z << endl;
}
}
cout << n-2 << " " << n-1 << endl;
cout << n-2-stem << " " << n << endl;
}
if(re>2)
{
//cout << "length " << length << endl;
cout << length+2 << endl;
for(int j = 2; j<n-re+1; j+=stem)
{
cout << 1 << " " << j << endl;
for(int z = j+1; z<j+stem; z++)
{
cout << z-1 << " " << z << endl;
}
}
for(int i = 0;i<re;i++)
{
cout << n-re-i*stem << " " << n-re+1+i << endl;
}
}
return 0;
}
Codeforces E. High Load(构造)的更多相关文章
- 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 1383D - Rearrange(构造)
Codeforces 题面传送门 & 洛谷题面传送门 一道不算困难的构造,花了一节英语课把它搞出来了,题解简单写写吧( 考虑从大往小加数,显然第三个条件可以被翻译为,每次加入一个元素,如果它所 ...
- Codeforces 549B. Looksery Party[构造]
B. Looksery Party time limit per test 1 second memory limit per test 256 megabytes input standard in ...
- codeforces 323A. Black-and-White Cube 构造
输入n 1 <= n <= 100 有一个n * n * n 的立方体,由n ^ 3 个1 * 1 * 1 的单位立方体构成 要用white 和 black 2种颜色来染这n ^ 3个立方 ...
- Codeforces Gym 100531I Instruction 构造
Problem I. Instruction 题目连接: http://codeforces.com/gym/100531/attachments Description Ingrid is a he ...
- codeforces 22C System Administrator(构造水题)
转载请注明出处: http://www.cnblogs.com/fraud/ ——by fraud System Administrator Bob got a job as a s ...
- Codeforces 353D Queue(构造法)
[题目链接] http://codeforces.com/contest/353/problem/D [题目大意] 10^6个男女排队,每一秒,如果男生在女生前面,即pos[i]是男生,pos[i+1 ...
- Codeforces 482 - Diverse Permutation 构造题
这是一道蛮基础的构造题. - k +(k - 1) -(k - 2) 1 + k , 1 , k , 2, ....... ...
- [ An Ac a Day ^_^ ] CodeForces 468A 24 Game 构造
题意是让你用1到n的数构造24 看完题解感觉被样例骗了…… 很明显 n<4肯定不行 然后构造出来4 5的组成24的式子 把大于4(偶数)或者5(奇数)的数构造成i-(i-1)=1 之后就是无尽的 ...
随机推荐
- 微信小程序特性总结
一. 小程序不是运行在浏览器中, 所以没有BOM和DOM对象 即console.log(window)和console.log(document)是获取不到任何内容的 二. 小程序特有的额外js成员( ...
- 如何确保redis中都是热数据
相关知识:redis 内存数据集大小上升到一定大小的时候,就会施行数据淘汰策略. redis 提供 6种数据淘汰策略: voltile-lru:从已设置过期时间的数据集(server.db[i].ex ...
- Linux性能优化实战学习笔记:第四十三讲
一.上节回顾 上一节,我们了解了 NAT(网络地址转换)的原理,学会了如何排查 NAT 带来的性能问题,最后还总结了 NAT 性能优化的基本思路.我先带你简单回顾一下. NAT 基于 Linux 内核 ...
- java byte[]和base64互相转换
1.方式一 import java.io.UnsupportedEncodingException; import java.util.Base64; // byte[]转base64 Strin ...
- STM32调试,发现HAL_Init();之后无法调试,甚至无法让程序停下来
症状 最近开始学习STM32Cube,发现新建工程后无法正常调试,过了HAL_Init();之后就无法继续调试了. 无法进行让程序暂停以及停止等操作.并在输出窗口不断刷出 ERROR: Can not ...
- windows上MongoDB远程访问配置
今天用另一台机器上的MongoDB,但是使用本地连接时,没问题 换成IP地址时,出现 解决的方法,修改配置文件 systemLog: destination: file path: d:/Mongod ...
- SQL ------------ avg() 与 sum 函数
AVG() 函数返回数字列的平均值 注意是数字的平均数, 语法: select avg(字段) from 表名 建个表,弄点数据 使用 select avg(字段) as 平均数 from 表名 与w ...
- 【CTS2019】随机立方体(容斥)
[CTS2019]随机立方体(容斥) 题面 LOJ 洛谷 题解 做这道题目的时候不难想到容斥的方面. 那么我们考虑怎么计算至少有\(k\)个极大值的方案数. 我们首先可以把\(k\)个极大值的位置给确 ...
- 异步编程的上下文与操作符--await/async generator/yield
上下文的保存机制: 1.保存到异步类型中:promise & future & closure & observable: 2.栈帧保存:其它保存机制: 3.保存到服务提供方的 ...
- 2019-11-29-VisualStudio-使用三个方法启动最新-C#-功能
原文:2019-11-29-VisualStudio-使用三个方法启动最新-C#-功能 title author date CreateTime categories VisualStudio 使用三 ...