Submission #2552776
Source Code Expand
#include<iostream> using namespace std; int n; long k,w[1<<17],d[1<<17]; main() { cin>>n>>k; for(int i=0;i<n;i++) { cin>>w[i]>>d[i]; } long l=0,f=2e18; while(f-l>1) { long m=(l+f)/2; long cnt=0; for(int i=0;i<n;i++) { if(m>=w[i])cnt+=(m-w[i])/d[i]+1; } if(cnt<k)l=m; else f=m; } cout<<f<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Garden |
User | kotatsugame |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 349 Byte |
Status | AC |
Exec Time | 214 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 214 ms | 1792 KB |
b06 | AC | 198 ms | 1792 KB |
b07 | AC | 210 ms | 1792 KB |
b08 | AC | 214 ms | 1792 KB |
b09 | AC | 209 ms | 1792 KB |
b10 | AC | 213 ms | 1792 KB |
b11 | AC | 148 ms | 1792 KB |
b12 | AC | 150 ms | 1792 KB |
b13 | AC | 147 ms | 1792 KB |
b14 | AC | 152 ms | 1792 KB |
b15 | AC | 148 ms | 1792 KB |
b16 | AC | 152 ms | 1792 KB |
b17 | AC | 148 ms | 1792 KB |
b18 | AC | 156 ms | 1792 KB |
b19 | AC | 132 ms | 1792 KB |
b20 | AC | 138 ms | 1792 KB |
b21 | AC | 139 ms | 1792 KB |
b22 | AC | 146 ms | 1792 KB |
b23 | AC | 159 ms | 1792 KB |