CodeForce 517 Div 2. C Cram Time
http://codeforces.com/contest/1072/problem/C
1 second
256 megabytes
standard input
standard output
In a galaxy far, far away Lesha the student has just got to know that he has an exam in two days. As always, he hasn't attended any single class during the previous year, so he decided to spend the remaining time wisely.
Lesha knows that today he can study for at most aa hours, and he will have bb hours to study tomorrow. Note that it is possible that on his planet there are more hours in a day than on Earth. Lesha knows that the quality of his knowledge will only depend on the number of lecture notes he will read. He has access to an infinite number of notes that are enumerated with positive integers, but he knows that he can read the first note in one hour, the second note in two hours and so on. In other words, Lesha can read the note with number kk in kkhours. Lesha can read the notes in arbitrary order, however, he can't start reading a note in the first day and finish its reading in the second day.
Thus, the student has to fully read several lecture notes today, spending at most aa hours in total, and fully read several lecture notes tomorrow, spending at most bb hours in total. What is the maximum number of notes Lesha can read in the remaining time? Which notes should he read in the first day, and which — in the second?
The only line of input contains two integers aa and bb (0≤a,b≤1090≤a,b≤109) — the number of hours Lesha has today and the number of hours Lesha has tomorrow.
In the first line print a single integer nn (0≤n≤a0≤n≤a) — the number of lecture notes Lesha has to read in the first day. In the second line print nn distinct integers p1,p2,…,pnp1,p2,…,pn (1≤pi≤a1≤pi≤a), the sum of all pipi should not exceed aa.
In the third line print a single integer mm (0≤m≤b0≤m≤b) — the number of lecture notes Lesha has to read in the second day. In the fourth line print mm distinct integers q1,q2,…,qmq1,q2,…,qm (1≤qi≤b1≤qi≤b), the sum of all qiqi should not exceed bb.
All integers pipi and qiqi should be distinct. The sum n+mn+m should be largest possible.
3 3
1
3
2
2 1
9 12
2
3 6
4
1 2 4 5
In the first example Lesha can read the third note in 33 hours in the first day, and the first and the second notes in one and two hours correspondingly in the second day, spending 33 hours as well. Note that Lesha can make it the other way round, reading the first and the second notes in the first day and the third note in the second day.
In the second example Lesha should read the third and the sixth notes in the first day, spending 99 hours in total. In the second day Lesha should read the first, second fourth and fifth notes, spending 1212 hours in total.
题意:
有无数多个lecture note,标号为1,2,3,4,5... 他们复习所要花费的时间和标号大小相同。分两天复习这些lecture。每天的复习小时不一样,求分配使得复习的lecture最多。
思路:
首先a,b分开装东西,不会比他们合在一起装东西装的多。(反证法)
其次,如果从大到小枚举可行的lecture note,如果每次先考虑a,那么a最后肯定可以被装满。
所以,剩下的lecture note,给b,b一定装的下所有。
代码:
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <stack>
#define ll long long
#define local using namespace std; const int MOD = 1e9+;
const int inf = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int maxn = (1e5+);
const int maxedge = *;
ll a, b; int main() {
#ifdef local
if(freopen("/Users/Andrew/Desktop/data.txt", "r", stdin) == NULL) printf("can't open this file!\n");
#endif scanf("%lld%lld", &a, &b);
vector <ll> ansa, ansb;
ll x = ;
for (; 1LL*x*(x+)/ <= a+b; ++x) ;
x--;
for (; x > ; x--) {
if (a >= x) {
ansa.push_back(x);
a -= x;
} else if (b >= x) {
ansb.push_back(x);
b -= x;
}
}
printf("%d\n", int(ansa.size()));
for (int i = ; i < ansa.size(); ++i) {
printf("%lld", ansa[i]);
if (i != ansa.size()-) printf(" ");
}
cout << endl;
printf("%d\n", int(ansb.size()));
for (int i = ; i < ansb.size(); ++i) {
printf("%lld", ansb[i]);
if (i != ansb.size()-) printf(" ");
}
cout << endl; #ifdef local
fclose(stdin);
#endif
return ;
}
CodeForce 517 Div 2. C Cram Time的更多相关文章
- CodeForce 517 Div 2. B Curiosity Has No Limits
http://codeforces.com/contest/1072/problem/B B. Curiosity Has No Limits time limit per test 1 second ...
- Codeforces Round #517 (Div. 2) C. Cram Time(思维+贪心)
https://codeforces.com/contest/1065 题意 给你a,b,让你找尽量多的自然数,使得他们的和<=a,<=b,用在a和b的自然数不能重复 思路 假如只有一个数 ...
- Codeforces Round #517 (Div. 2, based on Technocup 2019 Elimination Round 2)
Codeforces Round #517 (Div. 2, based on Technocup 2019 Elimination Round 2) #include <bits/stdc++ ...
- Codeforce#331 (Div. 2) A. Wilbur and Swimming Pool(谨以此题来纪念我的愚蠢)
C time limit per test 1 second memory limit per test 256 megabytes input standard input output stand ...
- 【LCA】CodeForce #326 Div.2 E:Duff in the Army
C. Duff in the Army Recently Duff has been a soldier in the army. Malek is her commander. Their coun ...
- CODEFORCE 246 Div.2 B题
题目例如以下: B. Football Kit time limit per test 1 second memory limit per test 256 megabytes input stand ...
- Codeforces Round #517 Div. 2/Div. 1
\(n\)天没更博了,因为被膜你赛的毒瘤题虐哭了... 既然打了这次CF还是纪念一下. 看看NOIP之前,接下来几场的时间都不好.这应该是最后一场CF了,差\(4\)分上紫也是一个遗憾吧. A 给一个 ...
- Codeforces Round #517 (Div. 2)
A #include<queue> #include<cstdio> #include<cstring> #include<algorithm> #de ...
- Codeforces Round #517 (Div. 2, based on Technocup 2019 Elimination Round 2) D. Minimum path
http://codeforces.com/contest/1072/problem/D bfs 走1步的最佳状态 -> 走2步的最佳状态 -> …… #include <bits/ ...
随机推荐
- codeforces 3b之贪心算法
有货车运量V:有若干物品A 占2单位体积,有若干物品B占1单位体积:相同种类的物品价值不一定一样: 序号按照输入顺序而定:问货车可以拉走最多多少价值的物品,并输出所选物品的序号: 1)常规的解法思路: ...
- vue搭建
~感觉再不学点新技能,马上就要被淘汰了== 1.先安装node,直接点击下一步就OK node官网 https://nodejs.org/en/ 2.安装完成之后,打开命令行工具,快捷键是cmd ...
- 用tensorflow实现最简单的神经网络
import tensorflow as tfimport numpy as np def add_layer(inputs,in_size,out_size,activation_function= ...
- Oracle入门之对表内容的dml操作
oracle表的管理--添加数据 使用insert语句向表中插入数据 插入数据基本语法: insert into table[(column [,column...])] values(value [ ...
- linux-docker下安装禅道全部
友情提示:按照步骤走,99%的人会安装成功,1%的人可以咨询度娘 64位电脑安装禅道,满足发送邮件功能 第一步: docker ps 查看docker中的容器是否有禅道(docker ps -a ...
- MySQL关于root密码修改
(转载) 方法一:在mysql系统外,使用mysqladmin修改mysqladmin -u root -p password "test123"Enter password: [ ...
- 安装Python mysqlclient出现“OSError: mysql_config not found”错误
问题: 使用Python3开发一个管理平台,用MySQL数据库存放元数据.使用pip安装mysqlclient模块时出现“OSError: mysql_config not ...
- golang中的mutex锁
mutex锁中一种互斥锁,如果有多个goroutine需要对同一变量进行修改则需要对该变量施加mutex锁以实现安全读写.
- CSS常用属性-xy
一.文本Text CSS text-align 属性 文本对齐方式 CSS text-decoration 属性 text-decoration 属性规定添加到文本的修饰 CSS line-heigh ...
- shell截取指定字符串之间的内容
#!/bin/bash#截取字符串 #path=ss/usr/share/src/root/home/admin path=ss/usr/share/src/root/home/admin/src/a ...