# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
761613 | gggkik | 도넛 (JOI14_ho_t3) | C++14 | 247 ms | 7508 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MXN = 1e5+5;
#define ll long long
ll A[MXN], P[MXN], n, all;
vector<ll> sa, sb;
ll cut(ll x,int i){
return all-
*lower_bound(sa.begin(),sa.end(),x+P[i])-
*lower_bound(sb.begin(),sb.end(),x-P[i]);
}
int f(ll x){ // 답이 x 이상인가?
for(int i = 0;i<n;i++) // i에서 cut
if(cut(x,i)>=x) return 1;
return 0;
}
ll sum(int i,int j){return (i<=j?P[j]-P[i-1]:0);}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for(int i = 1;i<=n;i++){
cin >> A[i]; P[i] = P[i-1]+A[i];
}
all = P[n];
ll suma = 0, sumb = 0;
sa.push_back(0);
for(int t = 0;t<2;t++)
for(int i = 1;i<=n;i++){
suma += A[i]; sa.push_back(suma);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |