| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 761608 |
2023-06-20T05:29:46 Z |
gggkik |
None (JOI14_ho_t3) |
C++14 |
|
2000 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, T;
vector<ll> sa, sb;
ll sum(int i,int j){return (i<=j?P[j]-P[i-1]:0);}
int cut(ll x,int i){
return T;
}
int f(ll x){ // 답이 x 이상인가?
if(cut(x,-1)>=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];
}
for(int i = 1;i<=n;i++){
for(int j = i;j<=n;j++){
for(int k = j+1;k<=n;k++){
T = max(T,min({sum(i,j),sum(j+1,k),sum(k+1,n)+sum(1,i-1)}));
}
}
}
cout << T;
// ll l = 0, r = P[n];
// for(;l+1<r;){
// ll mid = (l+r)/2;
// if(f(mid)) l = mid;
// else r = mid;
// }
// cout << l;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
19 ms |
336 KB |
Output is correct |
| 12 |
Correct |
19 ms |
332 KB |
Output is correct |
| 13 |
Correct |
24 ms |
320 KB |
Output is correct |
| 14 |
Correct |
19 ms |
212 KB |
Output is correct |
| 15 |
Correct |
19 ms |
340 KB |
Output is correct |
| 16 |
Correct |
19 ms |
212 KB |
Output is correct |
| 17 |
Correct |
19 ms |
264 KB |
Output is correct |
| 18 |
Correct |
19 ms |
340 KB |
Output is correct |
| 19 |
Correct |
19 ms |
340 KB |
Output is correct |
| 20 |
Correct |
23 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
19 ms |
336 KB |
Output is correct |
| 12 |
Correct |
19 ms |
332 KB |
Output is correct |
| 13 |
Correct |
24 ms |
320 KB |
Output is correct |
| 14 |
Correct |
19 ms |
212 KB |
Output is correct |
| 15 |
Correct |
19 ms |
340 KB |
Output is correct |
| 16 |
Correct |
19 ms |
212 KB |
Output is correct |
| 17 |
Correct |
19 ms |
264 KB |
Output is correct |
| 18 |
Correct |
19 ms |
340 KB |
Output is correct |
| 19 |
Correct |
19 ms |
340 KB |
Output is correct |
| 20 |
Correct |
23 ms |
340 KB |
Output is correct |
| 21 |
Execution timed out |
2067 ms |
340 KB |
Time limit exceeded |
| 22 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
19 ms |
336 KB |
Output is correct |
| 12 |
Correct |
19 ms |
332 KB |
Output is correct |
| 13 |
Correct |
24 ms |
320 KB |
Output is correct |
| 14 |
Correct |
19 ms |
212 KB |
Output is correct |
| 15 |
Correct |
19 ms |
340 KB |
Output is correct |
| 16 |
Correct |
19 ms |
212 KB |
Output is correct |
| 17 |
Correct |
19 ms |
264 KB |
Output is correct |
| 18 |
Correct |
19 ms |
340 KB |
Output is correct |
| 19 |
Correct |
19 ms |
340 KB |
Output is correct |
| 20 |
Correct |
23 ms |
340 KB |
Output is correct |
| 21 |
Execution timed out |
2067 ms |
340 KB |
Time limit exceeded |
| 22 |
Halted |
0 ms |
0 KB |
- |
