Codeforces Round #350 (Div. 2)
2016-05-07 18:33
477 查看
A. Holidays
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5
work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible number of days off per year on Mars.
Input
The first line of the input contains a positive integer n (1 ≤ n ≤ 1 000 000) —
the number of days in a year on Mars.
Output
Print two integers — the minimum possible and the maximum possible number of days off per year on Mars.
Examples
input
output
input
output
Note
In the first sample there are 14 days in a year on Mars, and therefore independently of the day a year starts with there will be exactly 4days
off .
In the second sample there are only 2 days in a year on Mars, and they can both be either work days or days off.
B. Game of Robots
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
In late autumn evening n robots gathered in the cheerful company of friends. Each robot has a unique identifier — an integer from 1 to109.
At some moment, robots decided to play the game "Snowball". Below there are the rules of this game. First, all robots stand in a row. Then the first robot says his identifier. After that the second robot says the identifier of the first robot and then says
his own identifier. Then the third robot says the identifier of the first robot, then says the identifier of the second robot and after that says his own. This process continues from left to right until the n-th
robot says his identifier.
Your task is to determine the k-th identifier to be pronounced.
Input
The first line contains two positive integers n and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ min(2·109, n·(n + 1) / 2).
The second line contains the sequence id1, id2, ..., idn (1 ≤ idi ≤ 109) —
identifiers of roborts. It is guaranteed that all identifiers are different.
Output
Print the k-th pronounced identifier (assume that the numeration starts from 1).
Examples
input
output
input
output
Note
In the first sample identifiers of robots will be pronounced in the following order: 1, 1, 2.
As k = 2, the answer equals to 1.
In the second test case identifiers of robots will be pronounced in the following order: 10, 10, 4, 10, 4, 18, 10, 4, 18, 3.
As k = 5, the answer equals to 4.
C. Cinema
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Moscow is hosting a major international conference, which is attended by n scientists from different countries. Each of the scientists
knows exactly one language. For convenience, we enumerate all languages of the world with integers from 1 to 109.
In the evening after the conference, all n scientists decided to go to the cinema. There are m movies
in the cinema they came to. Each of the movies is characterized by two distinct numbers — the index of audio language and the index of subtitles language. The scientist, who came to the movie,
will be very pleased if he knows the audio language of the movie, will be almost satisfied if he knows the language of subtitles
and will be not satisfied if he does not know neither one nor the other (note that the audio language and the subtitles language for each movie are always different).
Scientists decided to go together to the same movie. You have to help them choose the movie, such that the number of very pleased scientists is maximum possible. If there are several such movies, select among them one that will maximize the number of almost
satisfied scientists.
Input
The first line of the input contains a positive integer n (1 ≤ n ≤ 200 000) —
the number of scientists.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109),
where ai is
the index of a language, which the i-th scientist knows.
The third line contains a positive integer m (1 ≤ m ≤ 200 000) —
the number of movies in the cinema.
The fourth line contains m positive integers b1, b2, ..., bm (1 ≤ bj ≤ 109),
where bj is
the index of the audio language of the j-th movie.
The fifth line contains m positive integers c1, c2, ..., cm (1 ≤ cj ≤ 109),
where cj is
the index of subtitles language of the j-th movie.
It is guaranteed that audio languages and subtitles language are different for each movie, that is bj ≠ cj.
Output
Print the single integer — the index of a movie to which scientists should go. After viewing this movie the number of very pleased scientists should be maximum possible. If in the cinema there are several such movies, you need to choose among them one, after
viewing which there will be the maximum possible number of almost satisfied scientists.
If there are several possible answers print any of them.
Examples
input
output
input
output
Note
In the first sample, scientists must go to the movie with the index 2, as in such case the 1-th
and the 3-rd scientists will be very pleased and the 2-nd
scientist will be almost satisfied.
In the second test case scientists can go either to the movie with the index 1 or the index 3.
After viewing any of these movies exactlytwo scientists will be very pleased and all the others will be not satisfied.
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
On the planet Mars a year lasts exactly n days (there are no leap years on Mars). But Martians have the same weeks as earthlings — 5
work days and then 2 days off. Your task is to determine the minimum possible and the maximum possible number of days off per year on Mars.
Input
The first line of the input contains a positive integer n (1 ≤ n ≤ 1 000 000) —
the number of days in a year on Mars.
Output
Print two integers — the minimum possible and the maximum possible number of days off per year on Mars.
Examples
input
14
output
4 4
input
2
output
0 2
Note
In the first sample there are 14 days in a year on Mars, and therefore independently of the day a year starts with there will be exactly 4days
off .
In the second sample there are only 2 days in a year on Mars, and they can both be either work days or days off.
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; #define LL __int64 const int maxm=1e5+10; int a[maxm]; int main() { int n; while(scanf("%d",&n)!=EOF) { int sum1=0,sum2=0; sum1=(n/7)*2; if(n%7>=6) sum1++; sum2=(n/7)*2; if(n%7==0) sum2==sum2; else if(n%7==1) sum2++; else if(n%7>=2) sum2+=2; printf("%d %d\n",sum1,sum2); } return 0; }
B. Game of Robots
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
In late autumn evening n robots gathered in the cheerful company of friends. Each robot has a unique identifier — an integer from 1 to109.
At some moment, robots decided to play the game "Snowball". Below there are the rules of this game. First, all robots stand in a row. Then the first robot says his identifier. After that the second robot says the identifier of the first robot and then says
his own identifier. Then the third robot says the identifier of the first robot, then says the identifier of the second robot and after that says his own. This process continues from left to right until the n-th
robot says his identifier.
Your task is to determine the k-th identifier to be pronounced.
Input
The first line contains two positive integers n and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ min(2·109, n·(n + 1) / 2).
The second line contains the sequence id1, id2, ..., idn (1 ≤ idi ≤ 109) —
identifiers of roborts. It is guaranteed that all identifiers are different.
Output
Print the k-th pronounced identifier (assume that the numeration starts from 1).
Examples
input
2 21 2
output
1
input
4 5 10 4 18 3
output
4
Note
In the first sample identifiers of robots will be pronounced in the following order: 1, 1, 2.
As k = 2, the answer equals to 1.
In the second test case identifiers of robots will be pronounced in the following order: 10, 10, 4, 10, 4, 18, 10, 4, 18, 3.
As k = 5, the answer equals to 4.
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define LL __int64const LL maxm=1e7+10;
LL d[maxm];
LL a[maxm];
int main()
{
LL n,k;
while(scanf("%I64d%I64d",&n,&k)!=EOF)
{
for(LL i=1;i<=n;i++)
scanf("%I64d",&d[i]);
LL ans=0;
LL cnt=0;
for(LL i=1;i<=2e9+10;i+=ans)
{
a[cnt++]=i;
ans++;
}
LL x=upper_bound(a,a+cnt,k)-a;
// printf("%d\n",a[x-1]);
printf("%I64d\n",d[k-a[x-1]+1]);
}
return 0;
}
C. Cinema
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Moscow is hosting a major international conference, which is attended by n scientists from different countries. Each of the scientists
knows exactly one language. For convenience, we enumerate all languages of the world with integers from 1 to 109.
In the evening after the conference, all n scientists decided to go to the cinema. There are m movies
in the cinema they came to. Each of the movies is characterized by two distinct numbers — the index of audio language and the index of subtitles language. The scientist, who came to the movie,
will be very pleased if he knows the audio language of the movie, will be almost satisfied if he knows the language of subtitles
and will be not satisfied if he does not know neither one nor the other (note that the audio language and the subtitles language for each movie are always different).
Scientists decided to go together to the same movie. You have to help them choose the movie, such that the number of very pleased scientists is maximum possible. If there are several such movies, select among them one that will maximize the number of almost
satisfied scientists.
Input
The first line of the input contains a positive integer n (1 ≤ n ≤ 200 000) —
the number of scientists.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109),
where ai is
the index of a language, which the i-th scientist knows.
The third line contains a positive integer m (1 ≤ m ≤ 200 000) —
the number of movies in the cinema.
The fourth line contains m positive integers b1, b2, ..., bm (1 ≤ bj ≤ 109),
where bj is
the index of the audio language of the j-th movie.
The fifth line contains m positive integers c1, c2, ..., cm (1 ≤ cj ≤ 109),
where cj is
the index of subtitles language of the j-th movie.
It is guaranteed that audio languages and subtitles language are different for each movie, that is bj ≠ cj.
Output
Print the single integer — the index of a movie to which scientists should go. After viewing this movie the number of very pleased scientists should be maximum possible. If in the cinema there are several such movies, you need to choose among them one, after
viewing which there will be the maximum possible number of almost satisfied scientists.
If there are several possible answers print any of them.
Examples
input
3
2 3 223 22 3
output
2
input
6
6 3 1 1 3 7
5
1 2 3 4 5
2 3 4 5 1
output
1
Note
In the first sample, scientists must go to the movie with the index 2, as in such case the 1-th
and the 3-rd scientists will be very pleased and the 2-nd
scientist will be almost satisfied.
In the second test case scientists can go either to the movie with the index 1 or the index 3.
After viewing any of these movies exactlytwo scientists will be very pleased and all the others will be not satisfied.
#include<stdio.h>
#include<string.h>
#include<string>
#include<iostream>
#include<map>
#include<algorithm>
using namespace std;
#define LL __int64const LL maxm=1e6+10;
const LL inf=1e10+10;
LL b[maxm];
LL c[maxm];
map<LL,LL>q;
int main()
{
LL n;
while(scanf("%I64d",&n)!=EOF)
{
q.clear();
LL a;
for(LL i=0;i<n;i++)
{
scanf("%I64d",&a);
q[a]++;
}
LL m;
scanf("%I64d",&m);
for(LL i=0;i<m;i++)
{
scanf("%I64d",&b[i]);
}
for(LL i=0;i<m;i++)
{
scanf("%I64d",&c[i]);
}
LL M=0;
LL index=0;
for(LL i=0;i<m;i++)
{
if(M<=q[b[i]]*inf+q[c[i]])
{
M=q[b[i]]*inf+q[c[i]];
index=i+1;
}
}
printf("%I64d\n",index);
}
return 0;
}
相关文章推荐
- 《STL源码剖析》学习笔记-第5章 关联式容器
- Linux basic knowledge
- Activity和Service之间只相差了一个Window
- python logging 日志轮转文件不删除问题
- TCPdump抓包命令详解
- 硅谷杰出工程师的五个能力
- hql & mysql 札记
- HBASE的javaAPI使用,建表,增,删,查,过滤器简单实用
- WebBasic07-JS
- 搭建Hibernate过程中常见的错误
- 金旭亮老师:“智商平平”学软件
- [Hash] [最短路] [Vijos P1184] CoVH之华丽的IP伪装 (ConanIP)
- 6、udev机制
- 5、映射的思考
- 最详细的Log4j使用教程
- 二叉树的序列化和反序列化
- Mac OSX配置Android Studio开发软件
- 7、字符设备系统
- Yii-Unable to verify your data submission 错误(CSRF)
- poj 2425 A Chess Game(sg函数)