只做了两个就去上课去啦...
A. Company Merging
time limit per test

1 second

memory limit per test

512 megabytes

input

standard input

output

standard output

A conglomerate consists of nn companies. To make managing easier, their owners have decided to merge all companies into one. By law, it is only possible to merge two companies, so the owners plan to select two companies, merge them into one, and continue doing so until there is only one company left.

But anti-monopoly service forbids to merge companies if they suspect unfriendly absorption. The criterion they use is the difference in maximum salaries between two companies. Merging is allowed only if the maximum salaries are equal.

To fulfill the anti-monopoly requirements, the owners can change salaries in their companies before merging. But the labor union insists on two conditions: it is only allowed to increase salaries, moreover all the employees in one company must get the same increase.

Sure enough, the owners want to minimize the total increase of all salaries in all companies. Help them find the minimal possible increase that will allow them to merge companies into one.

Input

The first line contains a single integer nn — the number of companies in the conglomerate (1≤n≤2⋅1051≤n≤2⋅105). Each of the next nn lines describes a company.

A company description start with an integer mimi — the number of its employees (1≤mi≤2⋅1051≤mi≤2⋅105). Then mimi integers follow: the salaries of the employees. All salaries are positive and do not exceed 109109.

The total number of employees in all companies does not exceed 2⋅1052⋅105.

Output

Output a single integer — the minimal total increase of all employees that allows to merge all companies.

Example
input

Copy
3
2 4 3
2 2 1
3 1 1 1
output

Copy
13
Note

One of the optimal merging strategies is the following. First increase all salaries in the second company by 22, and merge the first and the second companies. Now the conglomerate consists of two companies with salaries [4,3,4,3][4,3,4,3] and [1,1,1][1,1,1]. To merge them, increase the salaries in the second of those by 33. The total increase is 2+2+3+3+3=132+2+3+3+3=13.

思路:一个大集团下面有n个公司,每个公司m个员工,每个员工的工资mi,现在要合并公司.两两合并,最后只剩一个才行,合并要求是,两个公司之间的员工最大工资相等才行.

只要记录每个公司的最大工资,然后排序,再开始从小到大挨着两两合并.

#include <iostream>
#include <algorithm>
#include <cstdlib> using namespace std; struct everycom{
int maxx;
int num;
}; struct everycom ec[]; int cmp(struct everycom a,struct everycom b){
return a.maxx<b.maxx;
} int main(){
int n,m;
int now=;
int maxx=;
//while(scanf("%d",&n)){
scanf("%d",&n);
long long sum=;
long long nownum=;
for(int i=;i<n;i++){
cin>>m;
ec[i].num=m;
maxx=;
for(int j=;j<m;j++){
cin>>now;
maxx=now>maxx?now:maxx;
}
ec[i].maxx=maxx;
}
sort(ec,ec+n,cmp);
for(int i=;i<n-;i++){
long long tmp=ec[i+].maxx-ec[i].maxx;
nownum+=ec[i].num;
sum+=tmp*nownum;
}
cout<<sum<<endl;
}

M. The Pleasant Walk

time limit per test

1 second

memory limit per test

512 megabytes

input

standard input

output

standard output

There are nn houses along the road where Anya lives, each one is painted in one of kk possible colors.

Anya likes walking along this road, but she doesn't like when two adjacent houses at the road have the same color. She wants to select a long segment of the road such that no two adjacent houses have the same color.

Help Anya find the longest segment with this property.

Input

The first line contains two integers nn and kk — the number of houses and the number of colors (1≤n≤1000001≤n≤100000, 1≤k≤1000001≤k≤100000).

The next line contains nn integers a1,a2,…,ana1,a2,…,an — the colors of the houses along the road (1≤ai≤k1≤ai≤k).

Output

Output a single integer — the maximum number of houses on the road segment having no two adjacent houses of the same color.

Example
input

Copy
8 3
1 2 3 3 2 1 2 2
output

Copy
4
Note

In the example, the longest segment without neighboring houses of the same color is from the house 4 to the house 7. The colors of the houses are [3,2,1,2][3,2,1,2] and its length is 4 houses.

思路:让找最长的序列,序列中任何两个相邻的元素不能相等.

#include <iostream>

using namespace std;

int main(){
int n,k;
//int a[100005];
int ai;
while(cin>>n>>k){
int la=;
int now=;
int maxx=;
cin>>ai;
la=ai;
for(int i=;i<n;i++){
//cin>>a[i];
cin>>ai;
if(ai!=la){
now++;
}else{
now=;
}
la=ai;
maxx= now>maxx?now:maxx;
}
cout<<maxx<<endl;
}
}

CF_2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)的更多相关文章

  1. 2018-2019 Russia Open High School Programming Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)

    前言 有一场下午的cf,很滋磁啊,然后又和dalao(见右面链接)组队打了,dalao直接带飞我啊. 这是一篇题解,也是一篇总结,当然,让我把所有的题目都写个题解是不可能的了. 按照开题顺序讲吧. 在 ...

  2. 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)

    2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) easy: ACE ...

  3. 2019-2020 ICPC, NERC, Southern and Volga Russian Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)【A题 类型好题】

    A. Berstagram Polycarp recently signed up to a new social network Berstagram. He immediately publish ...

  4. D. Dog Show 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest, qualification stage (Online Mirror, ACM-ICPC Rules, Teams Preferred)

    http://codeforces.com/contest/847/problem/D 巧妙的贪心 仔细琢磨... 像凸包里的处理 #include <cstdio> #include & ...

  5. 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)

    A 思路: 贪心,每次要么选两个最大的,要么选三个,因为一个数(除了1)都可以拆成2和3相加,直到所有的数都相同就停止,这时就可以得到答案了; C: 二分+bfs,二分答案,然后bfs找出距离小于等于 ...

  6. 2014-2015 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)

    I. Sale in GameStore(贪心) time limit per test 2 seconds memory limit per test 512 megabytes input sta ...

  7. 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) 几道简单题的题解

    A. Toda 2 题意:给你n个人,每个人的分数是a[i],每次可以从两个人到五个人的使得分数减一,使得最终的分数相等: 思路:假设答案为m:每个人的分数与答案m的差值为d[i],sum为d[i]的 ...

  8. 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) J dp 背包

    J. Bottles time limit per test 2 seconds memory limit per test 512 megabytes input standard input ou ...

  9. 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred) G 优先队列

    G. Car Repair Shop time limit per test 2 seconds memory limit per test 512 megabytes input standard ...

随机推荐

  1. oh-my-zsh安装和简单定制

    我使用的是deepin系统,deepin的终端做的已经很好了,最近想换一个新的命令的提示符风格.据说oh-my-zsh很好用,花一点时间安装,记录这个过程. oh-my-zsh的安装是非常方便的,安装 ...

  2. 入门嵌入式选择2440?树莓派?STM32?4412开发板?

    如果了解一下当前IT和物联网发展的形势,就会发现Android工程师越来越受欢迎,相比之下单纯的Linux工程师却逊色不少,当然,Android系统的内核也是Linux的,Linux和Android作 ...

  3. Spring系列(三) Bean装配的高级技术

    profile 不同于maven的profile, spring的profile不需要重新打包, 同一个版本的包文件可以部署在不同环境的服务器上, 只需要激活对应的profile就可以切换到对应的环境 ...

  4. js设置document.domain实现跨域

    document.domain 只能实现跨子域的问题 如:xxx.com/a.html 和aaa.xxx.com/b.html 或:bbb,xxx.com/c.html 和ccc.xxx.com/d. ...

  5. Win10上默认VS 2017以管理员身份运行

    Win10上的UAC虽然是个好东西,但是对于使用开发工作的技术人员来说有时候也挺麻烦.这里有一个让VS2017无论如何都以管理员身份运行的方法. 1.进入VS2017的安装目录:..\Microsof ...

  6. 新手如何理解JS面向对象开发?

    今天有时间讲讲我对面向对象的理解跟看法,尽量用通俗的语言来表达,多多指教! 如今前端开发已经越来越火了,对于前端开发的要求也是越来越高了,在面试中,经常有面试官会问:你对JS面向对象熟悉吗? 其实,也 ...

  7. 【原创】大叔问题定位分享(24)hbase standalone方式启动报错

    hbase 2.0.2 hbase standalone方式启动报错: 2019-01-17 15:49:08,730 ERROR [Thread-24] master.HMaster: Failed ...

  8. [转]Ubuntu中apt与apt-get命令的区别

    转载于https://www.sysgeek.cn/apt-vs-apt-get/ Ubuntu 16.04 发布时,一个引人注目的新特性便是 apt 命令的引入.其实早在 2014 年,apt 命令 ...

  9. SQLAlchemy 使用(一)创建单一model

    前言 最近项目等待前端接接口,比较空闲.就想学习一些新东西.学啥呢?考虑到ORM的易用性,还是学习一下ORM.那么与Flask搭配的ORM有 flask-sqlalchemy 但是该组件专为Flask ...

  10. AI数据分析(一)

    安装Spyder+PyQt5 在python36目录下,使用cmd打开,切换到Scripts文件下 pip install spyder pip install PyQt5 python中的库 Num ...