Codeforces Round #416 (Div. 2) 本来以为这个时间是晚上的,下午就没做
2 seconds
256 megabytes
standard input
standard output
At regular competition Vladik and Valera won a and b candies respectively. Vladik offered 1 his candy to Valera. After that Valera gave Vladik 2 his candies, so that no one thought that he was less generous. Vladik for same reason gave 3 candies to Valera in next turn.
More formally, the guys take turns giving each other one candy more than they received in the previous turn.
This continued until the moment when one of them couldn’t give the right amount of candy. Candies, which guys got from each other, they don’t consider as their own. You need to know, who is the first who can’t give the right amount of candy.
Single line of input data contains two space-separated integers a, b (1 ≤ a, b ≤ 109) — number of Vladik and Valera candies respectively.
Pring a single line "Vladik’’ in case, if Vladik first who can’t give right amount of candy, or "Valera’’ otherwise.
1 1
Valera
7 6
Vladik
Illustration for first test case:
Illustration for second test case:
两个人的糖果数分别-1-3-5-7,-2-4-6-8,看谁更持久,等差数列求和啊,因为数据量不大,所以直接模拟也是可以过的
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll a, b, n, m;
cin >> a >> b;
n = sqrt(a);
m = (-1.0+sqrt(+*b))/2.0;
if (n > m){
cout << "Valera";
}
else cout << "Vladik";
return ;
}
2 seconds
256 megabytes
standard input
standard output
Vladik had started reading a complicated book about algorithms containing n pages. To improve understanding of what is written, his friends advised him to read pages in some order given by permutation P = [p1, p2, ..., pn], where pi denotes the number of page that should be read i-th in turn.
Sometimes Vladik’s mom sorted some subsegment of permutation P from position l to position r inclusive, because she loves the order. For every of such sorting Vladik knows number x — what index of page in permutation he should read. He is wondered if the page, which he will read after sorting, has changed. In other words, has px changed? After every sorting Vladik return permutation to initial state, so you can assume that each sorting is independent from each other.
First line contains two space-separated integers n, m (1 ≤ n, m ≤ 104) — length of permutation and number of times Vladik's mom sorted some subsegment of the book.
Second line contains n space-separated integers p1, p2, ..., pn (1 ≤ pi ≤ n) — permutation P. Note that elements in permutation are distinct.
Each of the next m lines contains three space-separated integers li, ri, xi (1 ≤ li ≤ xi ≤ ri ≤ n) — left and right borders of sorted subsegment in i-th sorting and position that is interesting to Vladik.
For each mom’s sorting on it’s own line print "Yes", if page which is interesting to Vladik hasn't changed, or "No" otherwise.
5 5
5 4 3 2 1
1 5 3
1 3 1
2 4 3
4 4 4
2 5 3
Yes
No
Yes
Yes
No
6 5
1 4 3 2 5 6
2 4 3
1 6 2
4 5 4
1 3 3
2 6 3
Yes
No
Yes
No
Yes
Explanation of first test case:
- [1, 2, 3, 4, 5] — permutation after sorting, 3-rd element hasn’t changed, so answer is "Yes".
- [3, 4, 5, 2, 1] — permutation after sorting, 1-st element has changed, so answer is "No".
- [5, 2, 3, 4, 1] — permutation after sorting, 3-rd element hasn’t changed, so answer is "Yes".
- [5, 4, 3, 2, 1] — permutation after sorting, 4-th element hasn’t changed, so answer is "Yes".
- [5, 1, 2, 3, 4] — permutation after sorting, 3-rd element has changed, so answer is "No".
群里有大佬用了线数段的做法,可是div2怎么会那么难啊,统计下<=a[x]的不久好了
#include <bits/stdc++.h>
using namespace std;
const int maxn=+;
int n,m;
int p[maxn];
int main()
{
scanf("%d %d",&n,&m);
for(int i=;i<=n;i++)
scanf("%d",&p[i]);
int l,r,x;
for(int i=;i<m;i++){
scanf("%d %d %d",&l,&r,&x);
int hh=p[x];
int cnt=;
for(int j=l;j<=r;j++){
if(j==x)
continue;
if(p[j]<hh)
cnt++;
}
if(cnt+l-==x)
printf("Yes\n");
else printf("No\n");
}
return ;
}
2 seconds
256 megabytes
standard input
standard output
Vladik often travels by trains. He remembered some of his trips especially well and I would like to tell you about one of these trips:
Vladik is at initial train station, and now n people (including Vladik) want to get on the train. They are already lined up in some order, and for each of them the city code ai is known (the code of the city in which they are going to).
Train chief selects some number of disjoint segments of the original sequence of people (covering entire sequence by segments is not necessary). People who are in the same segment will be in the same train carriage. The segments are selected in such way that if at least one person travels to the city x, then all people who are going to city x should be in the same railway carriage. This means that they can’t belong to different segments. Note, that all people who travel to the city x, either go to it and in the same railway carriage, or do not go anywhere at all.
Comfort of a train trip with people on segment from position l to position r is equal to XOR of all distinct codes of cities for people on the segment from position l to position r. XOR operation also known as exclusive OR.
Total comfort of a train trip is equal to sum of comfort for each segment.
Help Vladik to know maximal possible total comfort.
First line contains single integer n (1 ≤ n ≤ 5000) — number of people.
Second line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 5000), where ai denotes code of the city to which i-th person is going.
The output should contain a single integer — maximal possible total comfort.
6
4 4 2 5 2 3
14
9
5 1 3 1 5 2 4 2 5
9
In the first test case best partition into segments is: [4, 4] [2, 5, 2] [3], answer is calculated as follows: 4 + (2 xor5) + 3 = 4 + 7 + 3 = 14
In the second test case best partition into segments is: 5 1 [3] 1 5 [2, 4, 2] 5, answer calculated as follows: 3 + (2 xor 4) = 3 + 6 = 9.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(s,v) memset(s,v,sizeof(s))
#define inf 0x3f3f3f3f
int a[],fi[],se[],dp[],vis[5010];
int main(){
int n;
scanf("%d",&n);
mem(a,);
for(int i=;i<=n;i++){
scanf("%d",&a[i]);
if(!fi[a[i]]) fi[a[i]]=i;
se[a[i]]=i;
}
for(int i=;i<=n;i++){
dp[i]=dp[i-];
mem(vis,);
int st=i,res=;
for(int j=i;j;j--){
if(!vis[a[j]]){
if(se[a[j]]>i) break;
if(fi[a[j]]<st) st=fi[a[j]];
res^=a[j];vis[a[j]]=;
}
if(j<=st) dp[i]=max(dp[i],dp[j-]+res);
}
}
printf("%d\n",dp[n]);
return ;
}
最新文章
- Xamarin与Visual stuido2015离线安装包分享
- MongoDB之TextSearch简介
- 如何向git账号上提交代码
- image warping
- php-fpm参数调优
- 毕向东JAVA视频讲解(第六课)
- put a ContextMenu into the header of a TabPage z
- 352. Data Stream as Disjoint Intervals
- mysql事件调度器
- 重新想象 Windows 8 Store Apps (27) - 选取器: 联系人选取窗口, 自定义联系人选取窗口
- 裸辞两个月,海投一个月,从Android转战Web前端的求职之路
- SourceTree 01 - git 客户端介绍
- HashMap?面试?我是谁?我在哪
- OpenFlow学习笔记
- [CF976E]Well played!
- 关于ajax请求后js绑定事件失效问题解决方法
- html 中a标签的问题(无反应,跳转,调用方法)
- js算法初窥03(搜索及去重算法)
- windows下远程连接Mysql
- Codeforces Beta Round #16 (Div. 2 Only)