http://codeforces.com/contest/845
1 second
256 megabytes
standard input
standard output
Berland annual chess tournament is coming!
Organizers have gathered 2·n chess players who should be divided into two teams with n people each. The first team is sponsored by BerOil and the second team is sponsored by BerMobile. Obviously, organizers should guarantee the win for the team of BerOil.
Thus, organizers should divide all 2·n players into two teams with n people each in such a way that the first team always wins.
Every chess player has its rating ri. It is known that chess player with the greater rating always wins the player with the lower rating. If their ratings are equal then any of the players can win.
After teams assignment there will come a drawing to form n pairs of opponents: in each pair there is a player from the first team and a player from the second team. Every chess player should be in exactly one pair. Every pair plays once. The drawing is totally random.
Is it possible to divide all 2·n players into two teams with n people each so that the player from the first team in every pair wins regardlessof the results of the drawing?
The first line contains one integer n (1 ≤ n ≤ 100).
The second line contains 2·n integers a1, a2, ... a2n (1 ≤ ai ≤ 1000).
If it's possible to divide all 2·n players into two teams with n people each so that the player from the first team in every pair wins regardless of the results of the drawing, then print "YES". Otherwise print "NO".
题意:给2*n个选手拥有不用的实力,实力高的肯定能赢实力低的,相同实力随机赢,问能否把他们分成两组使一组无论怎么匹配打都能赢?
题解:sort()一下,然判断那组是否最小值比另外一组最小值大
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=2e2+;
const ll inf=0x4f4f4f4f4f;
int n,k;
int a[maxn];
int main()
{
scanf("%d",&n);
for(int i=;i<*n;i++)
{
scanf("%d",&a[i]);
}
sort(a,a+*n);
if(a[n]>a[n-])printf("YES\n");
else printf("NO\n");
}
2 seconds
256 megabytes
standard input
standard output
Luba has a ticket consisting of 6 digits. In one move she can choose digit in any position and replace it with arbitrary digit. She wants to know the minimum number of digits she needs to replace in order to make the ticket lucky.
The ticket is considered lucky if the sum of first three digits equals to the sum of last three digits.
You are given a string consisting of 6 characters (all characters are digits from 0 to 9) — this string denotes Luba's ticket. The ticket can start with the digit 0.
Print one number — the minimum possible number of digits Luba needs to replace to make the ticket lucky.
000000
0
123456
2
111000
1
In the first example the ticket is already lucky, so the answer is 0.
In the second example Luba can replace 4 and 5 with zeroes, and the ticket will become lucky. It's easy to see that at least two replacements are required.
In the third example Luba can replace any zero with 3. It's easy to see that at least one replacement is required.
题意:当前面三个数字之和等于后面三个数字则称这六个数字组成的是幸运数,给六个数字问最改动几个数字使得这六个数成幸运数
题解:把前三个数字和后三个之和求出,相同则为0,不同就判断两个之差能否通过改变一个数字变的(让最小的变大或者最大变小),如果一个不行然后同理判改变两个。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=2e2+;
const ll inf=0x4f4f4f4f4f;
int n,k;
char b[];
int a[];
int main()
{
scanf("%s",b);
int tmp1=,tmp2=;
for(int i=;i<;i++)
{
a[i]=b[i]-'';
if(i<)tmp1+=a[i];
else tmp2+=a[i];
}
sort(a+,a+);
sort(a+,a+);
//for(int i=0;i<6;i++)cout<<a[i]<<endl;
if(tmp1==tmp2)
{
printf("0\n");
}
else if(tmp1<tmp2)
{
if(-a[]>=tmp2-tmp1||a[]>=tmp2-tmp1)
{
printf("1\n");
}
else if(-a[]+-a[]>=tmp2-tmp1||a[]+a[]>=tmp2-tmp1||-a[]+a[]>=tmp2-tmp1)
{
printf("2\n");
}
else
{
printf("3\n");
} }
else
{
if(-a[]>=tmp1-tmp2||a[]>=tmp1-tmp2)
{
printf("1\n");
}
else if(-a[]+-a[]>=tmp1-tmp2||a[]+a[]>=tmp1-tmp2||-a[]+a[]>=tmp1-tmp2)
{
printf("2\n");
}
else
{
printf("3\n");
}
}
return ;
}
2 seconds
256 megabytes
standard input
standard output
Polycarp is a great fan of television.
He wrote down all the TV programs he is interested in for today. His list contains n shows, i-th of them starts at moment li and ends at moment ri.
Polycarp owns two TVs. He can watch two different shows simultaneously with two TVs but he can only watch one show at any given moment on a single TV. If one show ends at the same moment some other show starts then you can't watch them on a single TV.
Polycarp wants to check out all n shows. Are two TVs enough to do so?
The first line contains one integer n (1 ≤ n ≤ 2·105) — the number of shows.
Each of the next n lines contains two integers li and ri (0 ≤ li < ri ≤ 109) — starting and ending time of i-th show.
If Polycarp is able to check out all the shows using only two TVs then print "YES" (without quotes). Otherwise, print "NO" (without quotes).
3
1 2
2 3
4 5
YES
4
1 2
2 3
2 3
1 2
NO
题意;给出喜欢看的节目的开始和结束时间,有两台电视,问能否所有节目是否都能接收到。
题解;把开始时间和结束时间分别sort()一下,只要第i个节目的结束时间比第i+2节目开始时间早,就行。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=2e5+;
const ll inf=0x4f4f4f4f4f;
int n,k;
/*struct node
{
int l,r;
bool operator<(const node b)const
{
return l==b.l?r<b.r:l<b.l;
}
}a[maxn];*/
int l[maxn],r[maxn];
int main()
{
scanf("%d",&n);
for(int i=;i<n;i++)
{
scanf("%d %d",&l[i],&r[i]);
}
sort(l,l+n);
sort(r,r+n);
for(int i=;i<n-;i++)
{
if(l[i+]<=r[i])
{
printf("NO\n");return ;
}
}
printf("YES\n");
return ;
}
2 seconds
256 megabytes
standard input
standard output
Polycarp has just attempted to pass the driving test. He ran over the straight road with the signs of four types.
- speed limit: this sign comes with a positive integer number — maximal speed of the car after the sign (cancel the action of the previous sign of this type);
- overtake is allowed: this sign means that after some car meets it, it can overtake any other car;
- no speed limit: this sign cancels speed limit if any (car can move with arbitrary speed after this sign);
- no overtake allowed: some car can't overtake any other car after this sign.
Polycarp goes past the signs consequentially, each new sign cancels the action of all the previous signs of it's kind (speed limit/overtake). It is possible that two or more "no overtake allowed" signs go one after another with zero "overtake is allowed" signs between them. It works with "no speed limit" and "overtake is allowed" signs as well.
In the beginning of the ride overtake is allowed and there is no speed limit.
You are given the sequence of events in chronological order — events which happened to Polycarp during the ride. There are events of following types:
- Polycarp changes the speed of his car to specified (this event comes with a positive integer number);
- Polycarp's car overtakes the other car;
- Polycarp's car goes past the "speed limit" sign (this sign comes with a positive integer);
- Polycarp's car goes past the "overtake is allowed" sign;
- Polycarp's car goes past the "no speed limit";
- Polycarp's car goes past the "no overtake allowed";
It is guaranteed that the first event in chronological order is the event of type 1 (Polycarp changed the speed of his car to specified).
After the exam Polycarp can justify his rule violations by telling the driving instructor that he just didn't notice some of the signs. What is the minimal number of signs Polycarp should say he didn't notice, so that he would make no rule violations from his point of view?
The first line contains one integer number n (1 ≤ n ≤ 2·105) — number of events.
Each of the next n lines starts with integer t (1 ≤ t ≤ 6) — the type of the event.
An integer s (1 ≤ s ≤ 300) follows in the query of the first and the third type (if it is the query of first type, then it's new speed of Polycarp's car, if it is the query of third type, then it's new speed limit).
It is guaranteed that the first event in chronological order is the event of type 1 (Polycarp changed the speed of his car to specified).
Print the minimal number of road signs Polycarp should say he didn't notice, so that he would make no rule violations from his point of view.
11
1 100
3 70
4
2
3 120
5
3 120
6
1 150
4
3 300
2
5
1 100
3 200
2
4
5
0
7
1 20
2
6
4
6
6
2
2
In the first example Polycarp should say he didn't notice the "speed limit" sign with the limit of 70 and the second "speed limit" sign with the limit of 120.
In the second example Polycarp didn't make any rule violation.
In the third example Polycarp should say he didn't notice both "no overtake allowed" that came after "overtake is allowed" sign.
题意:就是驾驶考试,他会看到四个不同的标志,有不同要求,然后给出他在考试过程中的行为,问他至少要告诉教练有多少个标志没看到,才是算没有犯错(这题重要的是看懂题意)
题解:模拟吧,把限速要求记下就行
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;
const int maxn=2e5+;
const ll inf=0x4f4f4f4f4f;
int n,k;
vector<int>lim;
int l[maxn],r[maxn];
int main()
{
scanf("%d",&n);
int ans=;
int s=,num=;
bool cc=false;
while(n--)
{
int op,t;
scanf("%d",&op);
if(op==)
{
scanf("%d",&s);
while(lim.size()&&s>lim.back())
{
lim.pop_back();ans++;
}
}
else if(op==)
{
int l;
scanf("%d",&l);
lim.push_back(l);
while(lim.size()&&s>lim.back())
{
lim.pop_back();ans++;
}
}
else if(op==)
{
if(!cc)
{
ans+=num;num=;
}
}
else if(op==)
{
cc=true;num=;
}
else if(op==)
{
lim.clear();
}
else
{
cc=false;num++;
}
}
printf("%d\n",ans);
return ;
}
http://codeforces.com/contest/845的更多相关文章
- codeforces 725D . Contest Balloons(贪心+优先队列)
题目链接:codeforces 725D . Contest Balloons 先按气球数从大到小排序求出初始名次,并把名次排在第一队前面的队放入优先队列,按w-t-1值从小到大优先,然后依次给气球给 ...
- codeforces.com/contest/325/problem/B
http://codeforces.com/contest/325/problem/B B. Stadium and Games time limit per test 1 second memory ...
- http://codeforces.com/contest/349
A. Cinema Line time limit per test 2 seconds memory limit per test 256 megabytes input standard inpu ...
- CodeForces - 725D Contest Balloons 贪心
D. Contest Balloons time limit per test 3 seconds memory limit per test 2 ...
- http://codeforces.com/contest/555/problem/B
比赛时虽然贪了心,不过后面没想到怎么处理和set的排序方法忘了- -,其实是和优先队列的仿函数一样的... 比赛后用set pair过了... #include <bits/stdc++.h&g ...
- http://codeforces.com/contest/610/problem/D
D. Vika and Segments time limit per test 2 seconds memory limit per test 256 megabytes input standar ...
- http://codeforces.com/contest/612/problem/D
D. The Union of k-Segments time limit per test 4 seconds memory limit per test 256 megabytes input s ...
- http://codeforces.com/contest/536/problem/B
B. Tavas and Malekas time limit per test 2 seconds memory limit per test 256 megabytes input standar ...
- http://codeforces.com/contest/535/problem/C
C. Tavas and Karafs time limit per test 2 seconds memory limit per test 256 megabytes input standard ...
随机推荐
- adb 安装apk 报错:Failure [INSTALL_FAILED_ALREADY_EXISTS]
遇到INSTALL_FAILED_ALREADY_EXISTS问题,直接通过adb install -r xxx.apk命令安装apk即可
- C# 爬虫 Jumony html解析
前言 前几天写了个爬虫,然后认识到了自己的不足.感谢 "倚天照海- -" ,我通过你推荐的文章,意外的发现了html解析的类库——Jumony. 研究了2天,我发现这个东西简单粗暴 ...
- 慕课网视频破解付费分享-前端开发-Python等
微信小程序 慕课网 BAT大牛经验总结全面深入解读Android面试 前端JS基础面试技巧 vue2.0+node.js+mongodb全栈打造商城 Vue.js高级实战-开发移动端音 ...
- 猜数字游戏--基于python
"""题目:练习使用python写一个猜数字的游戏,数字范围0-100,每次猜错,需要给出缩小后的范围,每个人只有10次的猜测机会,猜测机会用完游戏结束!"&q ...
- nginx正向代理
通过把Nginx设置为正向代理,我们就可以在局域网中用运行着Nginx的主机作为正向代理服务器了.那什么是正向代理和反向代理呢?正向代理和反向代理-百度百科 正向代理:如果把局域网外的Internet ...
- 解决MVC模式文件下载附件中文名称乱码
解决如下: 进行url编码:Server.UrlPathEncode(file.AttachmentName) return File(file.TempWorkPath, CommonTools.G ...
- makefile中":=","=","?=","+=" 之间的区别
区别: := 有关位置的等于,值取决于当时位置的值 = 无关位置的等于,值永远等于最后的值 ?= 是如果没有被赋值过就赋予等号后面的值+= 是添加等号后面的值 '=':无关位置的等于 比如: x = ...
- poj3463 最短路和比最短路长1的路径数
这题需要很好的理解Dij. 在Dij的基础上,每个点多一个次短路的长度和数量进行控制. 那么在队列中,最短路控制时出现n次,次短路控制出现n次.注意松弛条件中val值和最短路.次短路的关系. 这题需要 ...
- 我来给.Net设计一款HttpClient
1前言 时间飞快,转眼半年,碌碌无为,眼下就要三十而立,回想三年前的今天,我将NetworkSocket库开放到github,一直在更新与学习,不求有这个库能有多好,只求自己在过程能成长,将领悟到一些 ...
- Beta阶段事后诸葛亮分析
1.总结的提纲内容 a. 项目管理之事后诸葛亮会 设想和目标 1.我们的软件要解决什么问题?是否定义得很清楚?是否对典型用户和典型场景有清晰的描述? 我们的软件主要解决用户无意识花钱,无法清楚看见钱去 ...