Submission #3595887
Source Code Expand
#include <bits/stdc++.h> using namespace std; long long int rightt=1000000009; long long int lefft=0; long long int n, a, b; long long int vec[111111]; void bin(){ long long int mid=(rightt+lefft)/2; long long int ans=b*mid, sum=0; for(int i=0;n>i;i++){ sum+=max(0LL, (vec[i]-ans+(a-b-1))/(a-b)); } if(sum>mid){ lefft=mid; } else{ rightt=mid; } } int main(){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> a >> b; for(int i=0;n>i;i++){ cin >> vec[i]; } while(rightt-lefft>1){ bin(); } cout << rightt; }
Submission Info
Submission Time | |
---|---|
Task | D - Widespread |
User | otaliptus |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 663 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13 |
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 | 44 ms | 1024 KB |
b06 | AC | 44 ms | 1024 KB |
b07 | AC | 43 ms | 1024 KB |
b08 | AC | 42 ms | 1024 KB |
b09 | AC | 43 ms | 1024 KB |
b10 | AC | 43 ms | 1024 KB |
b11 | AC | 43 ms | 1024 KB |
b12 | AC | 43 ms | 1024 KB |
b13 | AC | 42 ms | 1024 KB |