답안 #1029019

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1029019	2024-07-20T11:21:23 Z	amine_aroua	Hacker (BOI15_hac)	C++17	40 / 100	1000 ms	2652 KB

hac

#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
    int n ;
    cin>>n;
    vector<int> v(n);
    vector<int> pref(2 * n);
    for(int i = 0 ;i < n ; i++)
    {
        cin>>v[i];
        pref[i] = v[i];
        if(i)
            pref[i]+=pref[i - 1];
    }
    for(int i = n ; i < 2 * n; i++)
    {
        pref[i] = pref[i - 1] + v[i - n];
    }
    int best = 0;
    for(int shift = 0 ; shift  < n ; shift++)
    {
        int ans = LLONG_MAX;
        for(int i = 1 + n/2 ; i <= n ; i++)
        {
            int j = ((i + shift) % n);
            int k = (j + (n+1)/2 - 1);
            ans = min(ans , pref[k] - (j ? pref[j - 1] : 0));
        }
        best = max(best , ans);
    }
    cout<<best<<'\n';
}

Subtask #1

20.0 / 20.0

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

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	11 ms	520 KB	Output is correct
23	Correct	29 ms	572 KB	Output is correct
24	Correct	11 ms	344 KB	Output is correct
25	Correct	29 ms	348 KB	Output is correct
26	Correct	29 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	436 KB	Output is correct
30	Correct	29 ms	564 KB	Output is correct
31	Correct	29 ms	560 KB	Output is correct

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	29 ms	348 KB	Output is correct
4	Execution timed out	1067 ms	2652 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	11 ms	520 KB	Output is correct
23	Correct	29 ms	572 KB	Output is correct
24	Correct	11 ms	344 KB	Output is correct
25	Correct	29 ms	348 KB	Output is correct
26	Correct	29 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	436 KB	Output is correct
30	Correct	29 ms	564 KB	Output is correct
31	Correct	29 ms	560 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	29 ms	348 KB	Output is correct
35	Execution timed out	1067 ms	2652 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-