답안 #723768

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
723768	2023-04-14T09:37:13 Z	rshohruh	Hacker (BOI15_hac)	C++14	40 / 100	1000 ms	2456 KB

hac

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int inf = 1e9;
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    #ifdef __local__
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    int n;
    cin >> n;
    vector<int> lis(n);
    for (int i = 0; i < n; i++)
        cin >> lis[i];
    
    vector<int> sussies(n, inf);
    int k = (n + 1) / 2;
    lis.insert(lis.end(), lis.begin(), lis.end());
    
    vector<long long> sm(lis.size()+1);
    for(int i = 1; i <= lis.size(); ++i) sm[i] = sm[i-1] + lis[i-1];

    for (int i = 0; i < n; i++) {
        int cur = sm[i+k] - sm[i];
        // for (int j = 0; j < k; j++) 
        //     cur += lis[i+j];
        
        for (int j = 0; j < k; j++)
            sussies[(i+j)%n] = min(cur, sussies[(i+j)%n]);
    }

    cout << *max_element(sussies.begin(), sussies.end());
    return 0;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:23:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(int i = 1; i <= lis.size(); ++i) sm[i] = sm[i-1] + lis[i-1];
      |                    ~~^~~~~~~~~~~~~

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	2 ms	212 KB	Output is correct
20	Correct	4 ms	340 KB	Output is correct
21	Correct	2 ms	340 KB	Output is correct
22	Correct	30 ms	408 KB	Output is correct
23	Correct	82 ms	468 KB	Output is correct
24	Correct	30 ms	396 KB	Output is correct
25	Correct	83 ms	468 KB	Output is correct
26	Correct	84 ms	468 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	77 ms	468 KB	Output is correct
31	Correct	78 ms	468 KB	Output is correct

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	82 ms	468 KB	Output is correct
4	Execution timed out	1062 ms	2456 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	2 ms	212 KB	Output is correct
20	Correct	4 ms	340 KB	Output is correct
21	Correct	2 ms	340 KB	Output is correct
22	Correct	30 ms	408 KB	Output is correct
23	Correct	82 ms	468 KB	Output is correct
24	Correct	30 ms	396 KB	Output is correct
25	Correct	83 ms	468 KB	Output is correct
26	Correct	84 ms	468 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	77 ms	468 KB	Output is correct
31	Correct	78 ms	468 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	82 ms	468 KB	Output is correct
35	Execution timed out	1062 ms	2456 KB	Time limit exceeded
36	Halted	0 ms	0 KB	-