oj.uz

Submission #497710

# Submission time Handle Problem Language Result Execution time Memory
497710 2021-12-23T16:48:56 Z Codurr Hacker (BOI15_hac) C++14
100 / 100
 303 ms 22204 KB 
#include "bits/stdc++.h"
using namespace std;

#define int long long //Avoid if time complexity very close to limit
#define ll long long
#define sz(x) (int)((x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define f first
#define s second

void setIO(string s = "") {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s)) {
		freopen((s + ".in").c_str(), "r", stdin);
		freopen((s + ".out").c_str(), "w", stdout);
	}
}

//Imp consts
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 1;
const int INF = 1e18 + 5;
const double pi = 3.14159265358979323846;
const double ep = 1e-20;

signed main() {
	setIO();
	int n, sum = 0;
	cin >> n;
	int x = (n + 1) / 2;
	vector<int> v(2 * n + 1);
	for (int i = 1; i <= n; i++)
		cin >> v[i];
	for (int i = 1; i <= n; i++)
		v[n + i] = v[i];
	for (int i = 1; i <= 2 * n; i++)
		v[i] += v[i - 1];
	multiset<int> s;
	int ans = -INF;
	for (int i = 1; i < n + x; i++) {
		s.insert(v[i + x - 1] - v[i - 1]);
		if (i >= x) {
			ans = max(ans, *s.begin());
			s.erase(s.find(v[i] - v[i - x]));
		}
	}
	cout << ans;
	return 0;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:29:9: warning: unused variable 'sum' [-Wunused-variable]
   29 |  int n, sum = 0;
      |         ^~~
hac.cpp: In function 'void setIO(std::string)':
hac.cpp:15:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hac.cpp:16:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 316 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 316 KB Output is correct
19 Correct 1 ms 252 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 3 ms 456 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 2 ms 464 KB Output is correct
31 Correct 2 ms 448 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 29 ms 3404 KB Output is correct
5 Correct 105 ms 8052 KB Output is correct
6 Correct 159 ms 10028 KB Output is correct
7 Correct 127 ms 11928 KB Output is correct
8 Correct 303 ms 19800 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 316 KB Output is correct
19 Correct 1 ms 252 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 464 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 3 ms 456 KB Output is correct
26 Correct 2 ms 464 KB Output is correct
27 Correct 1 ms 208 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 2 ms 464 KB Output is correct
31 Correct 2 ms 448 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 2 ms 460 KB Output is correct
35 Correct 29 ms 3404 KB Output is correct
36 Correct 105 ms 8052 KB Output is correct
37 Correct 159 ms 10028 KB Output is correct
38 Correct 127 ms 11928 KB Output is correct
39 Correct 303 ms 19800 KB Output is correct
40 Correct 5 ms 656 KB Output is correct
41 Correct 8 ms 1104 KB Output is correct
42 Correct 10 ms 1588 KB Output is correct
43 Correct 91 ms 8932 KB Output is correct
44 Correct 289 ms 21960 KB Output is correct
45 Correct 51 ms 4540 KB Output is correct
46 Correct 135 ms 13348 KB Output is correct
47 Correct 287 ms 21952 KB Output is correct
48 Correct 234 ms 22204 KB Output is correct
49 Correct 214 ms 21448 KB Output is correct
50 Correct 245 ms 21432 KB Output is correct