# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
761569 |
2023-06-20T04:15:02 Z |
gggkik |
None (JOI14_ho_t3) |
C++14 |
|
2 ms |
340 KB |
#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;
int 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;
}
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);
}
for(int i = n;i>0;i--){
sumb += A[i]; sb.push_back(sumb);
}
for(int i = 0;i<=n;i++) sb.push_back(-P[i]);
sort(sb.begin(),sb.end());
ll l = 0, r = all;
for(;l+1<r;){
ll mid = l+r>>1;
if(f(mid)) l = mid;
else r = mid;
}
cout << l;
}
Compilation message
2014_ho_t3.cpp: In function 'int main()':
2014_ho_t3.cpp:35:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
35 | ll mid = l+r>>1;
| ~^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
340 KB |
Output is correct |
6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |