답안 #1025432

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1025432	2024-07-17T03:15:48 Z	joelgun14	Hacker (BOI15_hac)	C++17	100 / 100	259 ms	26256 KB

hac

// header file
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// macros
#define endl "\n"
#define ll long long
#define mp make_pair
#define ins insert
#define lb lower_bound
#define pb push_back
#define ub upper_bound
#define lll __int128
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
int main() {
  ios_base::sync_with_stdio(0); cin.tie(NULL);
  int n;
  cin >> n;
  ll a[n + 1], pref[2 * n + 1];
  for(int i = 1; i <= n; ++i)
    cin >> a[i];
  pref[0] = 0;
  for(int i = 1; i <= 2 * n; ++i)
    pref[i] = pref[i - 1] + (i > n ? a[i - n] : a[i]);
  multiset<ll> s;
  for(int i = 1; i + n / 2 < n + 1; ++i) {
    // cerr << "INS " << i << " " << pref[i + n / 2] - pref[i] << endl;
    s.insert(pref[i + n / 2] - pref[i]);
  }
  ll res = 0;
  for(int i = 1; i <= n; ++i) {
    // cerr << "DEB " << i << " " << *--s.end() << endl;
    res = max(res, pref[n] - *--s.end());
    s.erase(s.find(pref[i + n / 2] - pref[i]));
    s.insert(pref[n + i] - pref[i + n - n / 2]);
  }
  cout << res << endl;
  return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	0 ms	400 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	456 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 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	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	0 ms	400 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	456 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 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	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	2 ms	604 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	2 ms	604 KB	Output is correct
26	Correct	2 ms	604 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	348 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	2 ms	604 KB	Output is correct
4	Correct	28 ms	4444 KB	Output is correct
5	Correct	85 ms	10384 KB	Output is correct
6	Correct	117 ms	13136 KB	Output is correct
7	Correct	118 ms	15696 KB	Output is correct
8	Correct	259 ms	25996 KB	Output is correct

Subtask #4

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	1 ms	344 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	0 ms	400 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	456 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 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	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	2 ms	604 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	2 ms	604 KB	Output is correct
26	Correct	2 ms	604 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	348 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	2 ms	604 KB	Output is correct
35	Correct	28 ms	4444 KB	Output is correct
36	Correct	85 ms	10384 KB	Output is correct
37	Correct	117 ms	13136 KB	Output is correct
38	Correct	118 ms	15696 KB	Output is correct
39	Correct	259 ms	25996 KB	Output is correct
40	Correct	3 ms	856 KB	Output is correct
41	Correct	7 ms	1372 KB	Output is correct
42	Correct	9 ms	1884 KB	Output is correct
43	Correct	89 ms	10836 KB	Output is correct
44	Correct	217 ms	25876 KB	Output is correct
45	Correct	33 ms	5464 KB	Output is correct
46	Correct	119 ms	15700 KB	Output is correct
47	Correct	247 ms	26236 KB	Output is correct
48	Correct	161 ms	26256 KB	Output is correct
49	Correct	149 ms	25424 KB	Output is correct
50	Correct	154 ms	25428 KB	Output is correct