CF414D Mashmokh and Water Tanks
CF414D Mashmokh and Water Tanks
题目描述
Mashmokh is playing a new game. In the beginning he has kk liters of water and pp coins. Additionally he has a rooted tree (an undirected connected acyclic graph) that consists of mm vertices. Each vertex of the tree contains a water tank that is empty in the beginning.
The game begins with the fact that Mashmokh chooses some (no more than kk ) of these tanks (except the root) and pours into each of them exactly 11 liter of water. Then the following process is performed until there is no water remained in tanks.
- The process consists of several steps.
- At the beginning of each step Mashmokh opens doors of all tanks. Then Mashmokh closes doors of some tanks (he is not allowed to close door of tank in the root) for the duration of this move. Let's denote the number of liters in some tank with closed door as ww , Mashmokh pays ww coins for the closing of that tank during this move.
- Let's denote by x_{1},x_{2},...,x_{m}x1,x2,...,x**m as the list of vertices of the tree sorted (nondecreasing) by their depth. The vertices from this list should be considered one by one in the order. Firstly vertex x_{1}x1 (which is the root itself) is emptied. Then for each vertex x_{i}x**i (i>1) , if its door is closed then skip the vertex else move all the water from the tank of vertex x_{i}x**i to the tank of its father (even if the tank of the father is closed).
Suppose ll moves were made until the tree became empty. Let's denote the amount of water inside the tank of the root after the ii -th move by w_{i}w**i then Mashmokh will win max(w_{1},w_{2},...,w_{l})max(w1,w2,...,w**l) dollars. Mashmokh wanted to know what is the maximum amount of dollars he can win by playing the above game. He asked you to find this value for him.
输入格式
The first line of the input contains three space-separated integers m,k,p (2<=m<=10^{5}; 0<=k,p<=10^{9})m,k,p (2<=m<=105; 0<=k,p<=109) .
Each of the following m-1m−1 lines contains two space-separated integers a_{i},b_{i} (1<=a_{i},b_{i}<=m; a_{i}≠b_{i})a**i,b**i (1<=a**i,b**i<=m; a**i=b**i) — the edges of the tree.
Consider that the vertices of the tree are numbered from 1 to mm . The root of the tree has number 1.
输出格式
Output a single integer, the number Mashmokh asked you to find.
题意翻译
给你一棵树,k升水,p块钱,进行一次游戏。 在游戏进行前,可以在任意个节点上放置1升水(总数不超过k)
游戏进行若干轮,每轮游戏开放所有节点,可以选择若干个节点关闭,代价为该节点的水数量。然后所有未关闭的节点的水流向它的父亲(不会连续移动)。
最后,根节点中的水会被取走,水的数量为该轮游戏的盈利。
求盈利最大的某轮游戏的盈利。
输入输出样例
输入 #1复制
输出 #1复制
输入 #2复制
输出 #2复制
说明/提示
The tree in the first sample is shown on the picture below. The black, red, blue colors correspond to vertices with 0, 1, 2 liters of water.
One way to achieve the maximum amount of money is to put 1 liter of water in each of vertices 3 and 4. The beginning state is shown on the picture below.
Then in the first move Mashmokh will pay one token to close the door of the third vertex tank. The tree after the first move is shown on the picture below.
After the second move there are 2 liters of water in the root as shown on the picture below.
题解:
2019.11.13模拟赛T3 40分场
在此吹爆同届大佬@iamrjj,考场爆切黑题,简直是中国OI的先驱,IOI的未来!
(由于和我们考试的题面不一样,我简单概括一下题意:)
题目大意
给一棵树,一开始\(k\)个人可以被放在树上除根节点之外的节点,但是每个节点只能放\(1\)个人。每一秒钟你可以往一些地方放路障拦住这里的所有人,花费的价值为当前点的人数。如果这个时刻这个点没有路障,这个点的所有人会向上爬一个点,这样的话,一些时刻会有人抵达根节点,现在需要你分配放路障的地方和时间,求所有时刻最多的抵达根节点的人数是多少。
题解:
在考场上连暴力都不会写。所以我仔细观察了一下样例,我发现,如果通过技术手段把人都拦在根节点的儿子节点上,直到所有人都到达根节点的儿子节点们,这个时候同时放开拦截,这些人就会同时抵达终点。这种方法就是最优秀的(刨除其他的一切条件)
所以我就乱搞(骗分),如果\(k<n\),输出\(k\),否则输出\(n-1\)。成功40分。
正经题解:
这回考虑其他的因素,我们发现最优的决策一定是越来越多的人都在到达根节点之前到达同一深度,同理,那么两个人一开始被放置的位置深度差越大,把一个人拦下使得另一个人追上他的难度(花费)就越大。所以我们要尽可能地让人们的初始深度差值最小。也就是说,我们要将其放在:按深度排序后深度相邻的点上。
那么我们把这些点按深度排序为\(l-r\)。假设深度为\(depth\)的点上有\(cnt[depth]\)个放上人。所有放人的节点中深度最大的为\(D\)。那么为了让他们达到统一深度,需要付出的钱是:
\]
那么当\(r\)变大的时候代价也变大。\(l\)变大的时候代价会变小。为了控制这个\(l-r\)的范围,我们当然选用双指针法(尺取法)
关于尺取法和双指针,如有不太会的同学可以翻看蒟蒻的这篇博客:
AC代码:
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
int n,k,p;
int tot,head[maxn],nxt[maxn<<1],to[maxn<<1];
int deep[maxn],cnt[maxn];
void add(int x,int y)
{
to[++tot]=y;
nxt[tot]=head[x];
head[x]=tot;
}
void dfs(int x,int f)
{
deep[x]=deep[f]+1;
cnt[deep[x]]++;
for(int i=head[x];i;i=nxt[i])
{
int y=to[i];
if(y==f)
continue;
dfs(y,x);
}
}
int main()
{
scanf("%d%d%d",&n,&k,&p);
for(int i=1;i<n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
add(x,y);
add(y,x);
}
dfs(1,0);
sort(deep+1,deep+n+1);
int l=2,r=2,ans=1,tmp=0;
while(1)
{
if(l>=n || r>=n)
break;
r++;
if(deep[r]!=deep[r-1])
tmp+=(r-l);
while(tmp>p || r-l+1>k)
{
tmp-=(deep[r]-deep[l]);
l++;
}
ans=max(ans,(r-l+1));
}
printf("%d",ans);
return 0;
}
CF414D Mashmokh and Water Tanks的更多相关文章
- codeforces 414D Mashmokh and Water Tanks
codeforces 414D Mashmokh and Water Tanks 题意 题解 \(a_i\):第 \(i\) 层的结点个数. \(b_i\):第 \(i\) 层初始有水的结点个数. 如 ...
- CodeForces 414D (贪心)
problem Mashmokh and Water Tanks 题目大意 给你一棵树,k升水,p块钱,进行一次游戏. 在游戏进行前,可以在任意个节点上放置1升水(总数不超过k) 游戏进行若干轮,每轮 ...
- CodeForces 362E Petya and Pipes
Petya and Pipes Time Limit: 1000ms Memory Limit: 262144KB This problem will be judged on CodeForces. ...
- [CF百场计划]#2 Codeforces Round #618 (Div. 2)
A. Non-zero Description: Guy-Manuel and Thomas have an array \(a\) of \(n\) integers [\(a_1, a_2, \d ...
- [LeetCode] Pacific Atlantic Water Flow 太平洋大西洋水流
Given an m x n matrix of non-negative integers representing the height of each unit cell in a contin ...
- [LeetCode] Trapping Rain Water II 收集雨水之二
Given an m x n matrix of positive integers representing the height of each unit cell in a 2D elevati ...
- [LeetCode] Water and Jug Problem 水罐问题
You are given two jugs with capacities x and y litres. There is an infinite amount of water supply a ...
- [LeetCode] Trapping Rain Water 收集雨水
Given n non-negative integers representing an elevation map where the width of each bar is 1, comput ...
- [LeetCode] Container With Most Water 装最多水的容器
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). ...
随机推荐
- Linux环境下搭建JDK环境
yum安装 傻瓜式安装,记录几条命令 1.查看可安装的jdk版本(需要安装yum): yum -y list java* 2.安装jdk yum install -y java-1.8.0-openj ...
- python之os模块(os.path)
我们在做自动化测试的时候,可能会遇到一些需要处理文件一些需求,那么我们可以通过直接写文件的目录进行操作,当然作为一名自动化测试工程师,怎么可能用这种方法?python中自带的有OS,我们可以通过os模 ...
- 《数据挖掘导论》实验课——实验四、数据挖掘之KNN,Naive Bayes
实验四.数据挖掘之KNN,Naive Bayes 一.实验目的 1. 掌握KNN的原理 2. 掌握Naive Bayes的原理 3. 学会利用KNN与Navie Bayes解决分类问题 二.实验工具 ...
- VMware Workstation下载-安装-破解-秘钥
永不过期序列号:UZ792-DHF8J-M81XP-MGM5T-MCAF2 Vmware15注册机下载:链接: https://pan.baidu.com/s/1KbLq71tw_5pUKv2lRjF ...
- Educational Codeforces Round 77 (Rated for Div. 2)
A: 尽可能平均然后剩下的平摊 #include <bits/stdc++.h> using namespace std; typedef long long ll; const int ...
- post请求四种传送正文的方式
一.简介 HTTP协议规定post提交的数据必须放在消息主体(entity-body)中,但协议没有规定数据必须使用什么编码方式.HTTP协议是以ASCII码传输,建立再TCP/IP协议之上的应用层规 ...
- 剑指Offer-37.二叉树的深度(C++/Java)
题目: 输入一棵二叉树,求该树的深度.从根结点到叶结点依次经过的结点(含根.叶结点)形成树的一条路径,最长路径的长度为树的深度. 分析: 递归求解左右子树的最大值即可,每遍历到一个结点,深度加1,最后 ...
- Concepts & Implementation of PLs
http://perugini.cps.udayton.edu/teaching/courses/Spring2015/cps352/index.html#lecturenotes Programmi ...
- Kubernetes的ConfigMap对象使用
ConfigMap和Secret几乎一样,只是Secret会用base64加密,创建方式也可以彩yaml或者文件方式 下面演示一下通过文件创建configmap 创建配置文件my.yaml name: ...
- Linux配置部署_新手向(三)——MySql安装与配置
目录 前言 安装 防火墙 小结 前言 马上就要放假了,按捺不住激动的心情(其实是实在敲不下去代码),就继续鼓捣虚拟机来做些常规的安装与使用吧,毕竟闲着也是闲着,唉,opengl还是难啊. 安装 其实网 ...