oj.uz

Submission #497702

# Submission time Handle Problem Language Result Execution time Memory
497702 2021-12-23T16:39:06 Z Codurr Hacker (BOI15_hac) C++14
20 / 100
 331 ms 25944 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(n + 1);
	for (int i = 1; i <= n; i++)
		cin >> v[i];
	for (int i = 1; i <= n; i++)
		v.push_back(v[i]);
	for (int i = 1; i <= 2 * n; i++)
		v[i] += v[i - 1];
	multiset<int> s;
	vector<int> ans(n + 1);
	for (int i = 1; i < n + x; i++) {
		if (i + x - 1 <= 2 * n)
			s.insert(v[i + x - 1] - v[i - 1]);
		if (i >= x) {
			ans[i % n] = *s.begin();
			s.erase(s.find(v[i] - v[i - x]));
		}
	}
	int Ans = -INF;
	for (int i = 1; i <= n; i++)
		Ans = max(Ans, ans[i]);
	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
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Incorrect 0 ms 208 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Incorrect 0 ms 208 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 30 ms 4304 KB Output is correct
5 Correct 92 ms 10416 KB Output is correct
6 Correct 147 ms 13092 KB Output is correct
7 Correct 149 ms 15764 KB Output is correct
8 Correct 331 ms 25944 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Incorrect 0 ms 208 KB Output isn't correct
15 Halted 0 ms 0 KB -