oj.uz

답안 #761592

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761592 2023-06-20T05:14:18 Z gggkik 도넛 (JOI14_ho_t3) C++14
0 / 100
 1040 ms 320 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;
ll sum(int i,int j){return (i<=j?P[j]-P[i-1]:0);}
int cut(ll x,int i){
    ll ans = 0;
    for(int i = 1;i<=n;i++){
        for(int j = i;j<=n;j++){ // [i,j] [j+1,k] [k+1,n]+[1,i-1]
            for(int k = j+1;k<=n;k++){
                ans = max(ans,min({sum(i,j),sum(j+1,k),sum(k+1,n)+sum(1,i-1)}));
            }
        }
    }
    return ans;
}
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;
    ll nans = 0;
    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:45:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   45 |         ll mid = l+r>>1;
      |                  ~^~
2014_ho_t3.cpp:27:8: warning: unused variable 'nans' [-Wunused-variable]
   27 |     ll nans = 0;
      |        ^~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 270 ms 212 KB Output is correct
2 Correct 267 ms 312 KB Output is correct
3 Correct 213 ms 320 KB Output is correct
4 Correct 179 ms 316 KB Output is correct
5 Correct 333 ms 212 KB Output is correct
6 Incorrect 1040 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 270 ms 212 KB Output is correct
2 Correct 267 ms 312 KB Output is correct
3 Correct 213 ms 320 KB Output is correct
4 Correct 179 ms 316 KB Output is correct
5 Correct 333 ms 212 KB Output is correct
6 Incorrect 1040 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 270 ms 212 KB Output is correct
2 Correct 267 ms 312 KB Output is correct
3 Correct 213 ms 320 KB Output is correct
4 Correct 179 ms 316 KB Output is correct
5 Correct 333 ms 212 KB Output is correct
6 Incorrect 1040 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 270 ms 212 KB Output is correct
2 Correct 267 ms 312 KB Output is correct
3 Correct 213 ms 320 KB Output is correct
4 Correct 179 ms 316 KB Output is correct
5 Correct 333 ms 212 KB Output is correct
6 Incorrect 1040 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -