oj.uz

Submission #311277

# Submission time Handle Problem Language Result Execution time Memory
311277 2020-10-09T20:26:01 Z sofapuden Hacker (BOI15_hac) C++14
20 / 100
 503 ms 14072 KB 
#include <bits/stdc++.h>

using namespace std;

int main(){
    int n; cin >> n;
    vector<int> v(n), msa;
    for(auto &x : v)cin >> x;
    int cur = 0;
    for(int i = 0; i < n/2; ++i){
        cur+=v[i];
    }
    msa.push_back(cur);
    int tot = v[n-1];
    for(int i = 0; i < n-1; ++i){
        tot+=v[i];
        cur-=v[i];
        cur+=v[(i+(n/2))%n];
        msa.push_back(cur);
    }
    set<int> S;
    for(int i = 0; i < n/2; ++ i){
        S.insert(msa[i]);
    }
    int ans = *S.rbegin();
    for(int i = 0; i < n-1; ++i){
        S.erase(msa[i]);
        S.insert(msa[(i+(n/2))%n]);
        ans = min(ans,*S.rbegin());
    }
    cout << tot-ans << "\n";
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 69 ms 3028 KB Output is correct
5 Correct 155 ms 5100 KB Output is correct
6 Correct 237 ms 7608 KB Output is correct
7 Correct 283 ms 9448 KB Output is correct
8 Correct 503 ms 14072 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -