답안 #475052

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
475052	2021-09-20T20:44:31 Z	hidden1	Hacker (BOI15_hac)	C++14	100 / 100	454 ms	27792 KB

hac

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define debug(...) cout << "Line: " << __LINE__ << endl; \
    prllDebug(", "#__VA_ARGS__, __VA_ARGS__)
template <typename T>
void prllDebug(const char* name, T&& arg1) { cout << (name + 2) << " = " << arg1 << endl; }
template <typename T, typename... T2>
void prllDebug(const char* names, T&& arg1, T2&&... args) {
    const char* end = strchr(names + 1, ',');
    cout.write(names + 2, end - names - 2) << " = " << arg1 << endl;
    prllDebug(end, args...);
}
 
const ll MAX_N = 5e5 + 10;
ll arr[2 * MAX_N];
ll pref[2 * MAX_N];
ll n;

ll sum(ll l, ll r) {	
	if(l == 0) {
		return -pref[r];
	}
	return -pref[r] + pref[l - 1];
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	cin >> n;
	for(ll i = 0; i < n; i ++) {
		cin >> arr[i];
		pref[i] = pref[n + i] = arr[n + i] = arr[i];
	}
	for(ll i = 1; i < 2 * n; i ++) {
		pref[i] += pref[i - 1];
	}
	ll sz = n / 2;
	multiset<ll> st;
	for(ll j = 0; j < n - sz; j ++) {
		st.insert(sum(j, j + sz - 1));
	}
	ll ret = 0;
	for(ll i = 0; i < n; i ++) {
		// cout << "Currently removing " << sum(i, i + sz - 1) << " and adding " << sum(n - sz + i, n + i) << endl; 
		st.erase(st.find(sum(i, i + sz - 1)));
		st.insert(sum(n - sz + i, n + i - 1));

/*		cout << "For " << i << endl;
		for(auto it : st) {
			cout << it << ", ";
		}
		cout << endl;
*/
		chkmax(ret, pref[n - 1] + *(st.begin()));
	}
	cout << ret << endl;
    return 0;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	2 ms	588 KB	Output is correct
4	Correct	38 ms	4712 KB	Output is correct
5	Correct	107 ms	11160 KB	Output is correct
6	Correct	162 ms	13900 KB	Output is correct
7	Correct	193 ms	16712 KB	Output is correct
8	Correct	454 ms	27700 KB	Output is correct

Subtask #4

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	2 ms	460 KB	Output is correct
23	Correct	3 ms	588 KB	Output is correct
24	Correct	2 ms	460 KB	Output is correct
25	Correct	2 ms	588 KB	Output is correct
26	Correct	2 ms	588 KB	Output is correct
27	Correct	0 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	0 ms	204 KB	Output is correct
30	Correct	3 ms	588 KB	Output is correct
31	Correct	2 ms	588 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	2 ms	588 KB	Output is correct
35	Correct	38 ms	4712 KB	Output is correct
36	Correct	107 ms	11160 KB	Output is correct
37	Correct	162 ms	13900 KB	Output is correct
38	Correct	193 ms	16712 KB	Output is correct
39	Correct	454 ms	27700 KB	Output is correct
40	Correct	5 ms	844 KB	Output is correct
41	Correct	9 ms	1424 KB	Output is correct
42	Correct	13 ms	1868 KB	Output is correct
43	Correct	117 ms	11196 KB	Output is correct
44	Correct	350 ms	27724 KB	Output is correct
45	Correct	50 ms	5708 KB	Output is correct
46	Correct	176 ms	16672 KB	Output is correct
47	Correct	389 ms	27700 KB	Output is correct
48	Correct	275 ms	27692 KB	Output is correct
49	Correct	251 ms	27792 KB	Output is correct
50	Correct	251 ms	27588 KB	Output is correct