oj.uz

답안 #1107810

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1107810 2024-11-02T07:00:45 Z koukirocks Hacker (BOI15_hac) C++17
100 / 100
 332 ms 26324 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0)
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("popcnt")
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
const ll MAX=2e5+10,P=1e9+7;
const ll INF=0x3f3f3f3f,oo=0x3f3f3f3f3f3f3f3f;
const ldb eps=1e-6;
const ldb PI=acos(-1.0);
const int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
template<typename T>
using vvector = vector<vector<T>>;

int main() {
    speed;
    int n;
    cin>>n;
    vector<int> a(2*n+1);
    vector<int> pre(2*n+1);
    pre[0]=0;
    for (int i=1;i<=n;i++) {
        cin>>a[i];
        a[i+n]=a[i];
    }
    for (int i=1;i<=2*n;i++) {
        pre[i]=pre[i-1]+a[i];
    }
    set<pll> st;
    int l = (n+1)/2;
    for (int i=1;i<=l;i++) {
        st.insert({pre[i+l-1]-pre[i-1],i});
    }
    ll ans=0;
    for (int i=l;i<l+n;i++) {
        ans=max(ans,st.begin()->F);
        st.erase({pre[i]-pre[i-l],i-l+1});
        st.insert({pre[i+l]-pre[i],i+1});
    }
    cout<<ans<<"\n";
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 504 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 504 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 2 ms 656 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 592 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 2 ms 592 KB Output is correct
31 Correct 2 ms 592 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 592 KB Output is correct
4 Correct 30 ms 4392 KB Output is correct
5 Correct 90 ms 10600 KB Output is correct
6 Correct 115 ms 13176 KB Output is correct
7 Correct 135 ms 15688 KB Output is correct
8 Correct 299 ms 25928 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 504 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 456 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 2 ms 656 KB Output is correct
24 Correct 2 ms 592 KB Output is correct
25 Correct 3 ms 592 KB Output is correct
26 Correct 3 ms 592 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 2 ms 592 KB Output is correct
31 Correct 2 ms 592 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 2 ms 592 KB Output is correct
35 Correct 30 ms 4392 KB Output is correct
36 Correct 90 ms 10600 KB Output is correct
37 Correct 115 ms 13176 KB Output is correct
38 Correct 135 ms 15688 KB Output is correct
39 Correct 299 ms 25928 KB Output is correct
40 Correct 5 ms 848 KB Output is correct
41 Correct 8 ms 1388 KB Output is correct
42 Correct 11 ms 1872 KB Output is correct
43 Correct 91 ms 10688 KB Output is correct
44 Correct 261 ms 25928 KB Output is correct
45 Correct 43 ms 5624 KB Output is correct
46 Correct 153 ms 15840 KB Output is correct
47 Correct 332 ms 25932 KB Output is correct
48 Correct 223 ms 26324 KB Output is correct
49 Correct 189 ms 25416 KB Output is correct
50 Correct 184 ms 25296 KB Output is correct