답안 #674448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
674448	2022-12-24T09:07:23 Z	ddy888	Hacker (BOI15_hac)	C++17	100 / 100	306 ms	26268 KB

hac

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define fi first
#define si second
#define ar array
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
template<typename T> bool chmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
const int MAXN = 500010;
int n;
int arr[MAXN*3],ps[MAXN*3],ans;
multiset<int> ms;

int sum(int l, int r) {return ps[r]-ps[l-1];}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin.exceptions(ios::badbit | ios::failbit);
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> arr[i];
        arr[i+n]=arr[i];
        arr[i+2*n]=arr[i];
    } 
    for (int i = 1; i <= 3*n; ++i) {
        ps[i] = ps[i-1]+arr[i];
    }
    int k = (n+1)/2;
    for (int i = n+1,j=n+1-k; i <= 2*n; ++i) {
        while (ms.size()<k) {
            ++j;
            ms.insert(sum(j,j+k-1));
        }
        chmax(ans, *ms.begin());
        ms.erase(ms.find(sum(i-k+1,i)));
    }
    cout << ans;
    return 0;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:39:25: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |         while (ms.size()<k) {
      |                ~~~~~~~~~^~

Subtask #1

20.0 / 20.0

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

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	468 KB	Output is correct
23	Correct	2 ms	596 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	2 ms	468 KB	Output is correct
26	Correct	2 ms	596 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	328 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	2 ms	472 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	2 ms	596 KB	Output is correct
4	Correct	40 ms	4428 KB	Output is correct
5	Correct	87 ms	10472 KB	Output is correct
6	Correct	117 ms	13132 KB	Output is correct
7	Correct	141 ms	15780 KB	Output is correct
8	Correct	306 ms	25968 KB	Output is correct

Subtask #4

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	468 KB	Output is correct
23	Correct	2 ms	596 KB	Output is correct
24	Correct	1 ms	468 KB	Output is correct
25	Correct	2 ms	468 KB	Output is correct
26	Correct	2 ms	596 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	328 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	2 ms	472 KB	Output is correct
31	Correct	2 ms	468 KB	Output is correct
32	Correct	0 ms	332 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	2 ms	596 KB	Output is correct
35	Correct	40 ms	4428 KB	Output is correct
36	Correct	87 ms	10472 KB	Output is correct
37	Correct	117 ms	13132 KB	Output is correct
38	Correct	141 ms	15780 KB	Output is correct
39	Correct	306 ms	25968 KB	Output is correct
40	Correct	4 ms	724 KB	Output is correct
41	Correct	8 ms	1348 KB	Output is correct
42	Correct	11 ms	1780 KB	Output is correct
43	Correct	91 ms	10584 KB	Output is correct
44	Correct	256 ms	25956 KB	Output is correct
45	Correct	41 ms	5372 KB	Output is correct
46	Correct	131 ms	15720 KB	Output is correct
47	Correct	279 ms	25964 KB	Output is correct
48	Correct	225 ms	26268 KB	Output is correct
49	Correct	201 ms	25300 KB	Output is correct
50	Correct	201 ms	25292 KB	Output is correct