[二分]codeforces Pipeline
2014-01-23 13:33
141 查看
Pipeline
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes,
each such pipe should be connected to the water supply. A pipe can be connected to the water supply if there's water flowing out of it. Initially Vova has only one pipe with flowing water. Besides, Vova has several splitters.
A splitter is a construction that consists of one input (it can be connected to a water pipe) and x output pipes. When a splitter is connected to a water
pipe, water flows from each output pipe. You can assume that the output pipes are ordinary pipes. For example, you can connect water supply to such pipe if there's water flowing out from it. At most one splitter can be connected to any water pipe.
The figure shows a 4-output
splitter
Vova has one splitter of each kind: with 2, 3, 4,
..., k outputs. Help Vova use the minimum number of splitters to build the required pipeline or otherwise state that it's impossible.
Vova needs the pipeline to have exactly n pipes with flowing out water. Note that some of those pipes can be the output pipes of the splitters.
Input
The first line contains two space-separated integers n and k (1 ≤ n ≤ 1018, 2 ≤ k ≤ 109).
Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams
or the %I64dspecifier.
Output
Print a single integer — the minimum number of splitters needed to build the pipeline. If it is impossible to build a pipeline with the given splitters, print -1.
Sample test(s)
input
output
input
output
input
output
解题报告:
此题为二分。
#include <iostream>
using namespace std;
int main(){
long long n,k;
cin>>n>>k;
long long l=0,r=k,m,s;
while(l<r){
m=(l+r)/2;
s=m*k-(m-1)*(m+2)/2;
if(s<n)
l=m+1;
else
r=m;
}
m=(l+r)/2;
s=m*k-(m-1)*(m+2)/2;
if(s<n)
cout<<"-1"<<endl;
else
cout<<m<<endl;
return 0;
}
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes,
each such pipe should be connected to the water supply. A pipe can be connected to the water supply if there's water flowing out of it. Initially Vova has only one pipe with flowing water. Besides, Vova has several splitters.
A splitter is a construction that consists of one input (it can be connected to a water pipe) and x output pipes. When a splitter is connected to a water
pipe, water flows from each output pipe. You can assume that the output pipes are ordinary pipes. For example, you can connect water supply to such pipe if there's water flowing out from it. At most one splitter can be connected to any water pipe.
The figure shows a 4-output
splitter
Vova has one splitter of each kind: with 2, 3, 4,
..., k outputs. Help Vova use the minimum number of splitters to build the required pipeline or otherwise state that it's impossible.
Vova needs the pipeline to have exactly n pipes with flowing out water. Note that some of those pipes can be the output pipes of the splitters.
Input
The first line contains two space-separated integers n and k (1 ≤ n ≤ 1018, 2 ≤ k ≤ 109).
Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams
or the %I64dspecifier.
Output
Print a single integer — the minimum number of splitters needed to build the pipeline. If it is impossible to build a pipeline with the given splitters, print -1.
Sample test(s)
input
4 3
output
2
input
5 5
output
1
input
8 4
output
-1
解题报告:
此题为二分。
#include <iostream>
using namespace std;
int main(){
long long n,k;
cin>>n>>k;
long long l=0,r=k,m,s;
while(l<r){
m=(l+r)/2;
s=m*k-(m-1)*(m+2)/2;
if(s<n)
l=m+1;
else
r=m;
}
m=(l+r)/2;
s=m*k-(m-1)*(m+2)/2;
if(s<n)
cout<<"-1"<<endl;
else
cout<<m<<endl;
return 0;
}
相关文章推荐
- codeforces Round 256(Div.2)D.Multiplication Table(二分)
- Codeforces Round #447 (Div. 2) D. Ralph And His Tour in Binary Country 二叉树、预处理、二分、数据结构
- Codeforces Round #377 D. Exams (二分)
- Codeforces Round #275 (Div. 2) B. Friends and Presents 二分+数学
- Codeforces Round #330 (Div. 2)D. Max and Bike 二分 物理
- Mahmoud and Ehab and the binary string CodeForces - 862D 二分+交互题
- Codeforces Round #352 (Div. 2) D. Robin Hood (二分答案)
- Educational Codeforces Round 6 D. Professor GukiZ and Two Arrays(二分 | two pointers)
- Educational Codeforces Round 11 C. Hard Process(尺取 二分 区间天数最多
- (二分)Codeforces Round #415 (Div. 2) D-Glad to see you!
- CodeForces Round 224 B (二分或图论) C (等差数列 水题)
- Codeforces Round #360 (Div. 2) 前三题题解【简单模拟+思维+二分图判定二分染色】
- Codeforces Round #211 (Div. 2)-D. Renting Bikes,二分!感谢队友出思路!
- Codeforces Round #211 (Div. 2)D. Renting Bikes(二分,想法题,好题)
- Codeforces Round # 409 C. Voltage Keepsake (二分)
- Codeforces Round #425 (Div. 2) Problem C Strange Radiation (Codeforces 832C) - 二分答案 - 数论
- Codeforces Round #350 (Div. 2) D2 Magic Powder - 2【二分】
- Codeforces Round #283 (Div. 2) D. Tennis Game 二分
- Educational Codeforces Round 11 C. Hard Process(尺取 二分 区间天数最多
- codeforces B. The Meeting Place Cannot Be Changed【二分】