oj.uz

Submission #333047

# Submission time Handle Problem Language Result Execution time Memory
333047 2020-12-04T11:23:30 Z guka415 Feast (NOI19_feast) C++14
12 / 100
 489 ms 33480 KB 
#define fast ios::sync_with_stdio(false); cin.tie(0)
#define foru(i, k, n) for (int i = k; i < n; i++)
#define ford(i, k, n) for (int i = k; i >= n; i--)
#define pb push_back
#define mp make_pair

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int sz = 3e5;
int k, n;
ll a[sz];
map<ld, pair<ll, bool>> arr; //pos, val, isNeg
set<pair<ll, pair<ld, bool>>> q;//val, pos, isNeg

inline pair<ld, pair<ll, bool>> qToArr(pair<ll, pair<ld, bool>> x) {
	return { x.second.first, {x.first,x.second.second} };
}

inline pair<ll, pair<ld, bool>> arrToQ(pair<ld, pair<ll, bool>> x) {
	return { x.second.first,{x.first,x.second.second} };
}


bool fix(vector<ll>& v) {
	if (v.back() < 0)v.pop_back();
	if (v.empty())return 0;
	reverse(v.begin(), v.end());
	if (v.back() < 0)v.pop_back();
	if (v.empty())return 0;
	return 1;
}

void removeFromDS(pair<ll, pair<ld, bool>> x) {
	auto y = arr.find(x.second.first), yp = y, ym = y;
	yp++;
	ym--;
	if (x.second.second) {
		ll nval = yp->second.first + ym->second.first + x.first;
		q.erase(arrToQ(*yp));
		q.erase(arrToQ(*ym));
		q.erase(x);
		q.insert({ nval,{x.second.first,0} });
		arr[x.second.first] = { nval, 0 };
		arr.erase(yp);
		arr.erase(ym);
	}
	else {
		if (ym == arr.end()) {
			q.erase(arrToQ(*yp));
			q.erase(x);
			arr.erase(yp);
			arr.erase(qToArr(x).first);
		}
		else if (yp == arr.end()) {
			q.erase(arrToQ(*ym));
			q.erase(x);
			arr.erase(ym);
			arr.erase(qToArr(x).first);
		}
		else {
			ll nval = yp->second.first + ym->second.first + x.first;
			q.erase(arrToQ(*yp));
			q.erase(arrToQ(*ym));
			q.erase(x);
			q.insert({ nval,{x.second.first,1} });
			arr[x.second.first] = { nval, 1 };
			arr.erase(yp);
			arr.erase(ym);
		}
	}

}

ll solve(vector<ll> v) {
	if (!fix(v))return 0;
	ll tot = 0;
	int vsz = v.size();
	for (int i = 0; i < vsz; i += 2) {
		tot += v[i];
	}
	foru(i, 0, vsz) {
		arr[i] = { abs(v[i]),i & 1 }; q.insert({ abs(v[i]),{i,i & 1} });
	}
	int cur = vsz / 2 + 1;
	while (cur > k) {
		auto x = *q.begin();
		tot -= x.first;
		removeFromDS(x);
		cur--;
	}
	return tot;
}

int main() {
	fast;
	cin >> n >> k;
	foru(i, 0, n)cin >> a[i];
	ll ts = 0;
	bool f = 1, pos = 0;
	vector<ll> v;
	foru(i, 0, n) {
		if (f) {
			pos = (a[i] >= 0);
			ts += a[i];
			f = 0;
		}
		else {
			if ((a[i] >= 0 != a[i - 1] >= 0)) {
				pos = !pos;
				v.pb(ts);
				ts = a[i];
			}
			else ts += a[i];
		}
	}
	v.pb(ts);
	cout << solve(v) << '\n';
	return 0;
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:119:14: warning: suggest parentheses around comparison in operand of '!=' [-Wparentheses]
  119 |    if ((a[i] >= 0 != a[i - 1] >= 0)) {
      |         ~~~~~^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 5484 KB Output is correct
2 Correct 36 ms 5612 KB Output is correct
3 Correct 36 ms 5612 KB Output is correct
4 Correct 36 ms 5484 KB Output is correct
5 Correct 35 ms 5484 KB Output is correct
6 Correct 35 ms 5484 KB Output is correct
7 Correct 35 ms 5484 KB Output is correct
8 Correct 36 ms 5632 KB Output is correct
9 Correct 35 ms 5484 KB Output is correct
10 Correct 36 ms 5484 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 3820 KB Output is correct
2 Correct 24 ms 3820 KB Output is correct
3 Correct 24 ms 3692 KB Output is correct
4 Correct 24 ms 3820 KB Output is correct
5 Correct 36 ms 5612 KB Output is correct
6 Correct 23 ms 3692 KB Output is correct
7 Correct 24 ms 3820 KB Output is correct
8 Correct 36 ms 5612 KB Output is correct
9 Correct 35 ms 5484 KB Output is correct
10 Correct 24 ms 3820 KB Output is correct

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 489 ms 33480 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 5484 KB Output is correct
2 Correct 36 ms 5612 KB Output is correct
3 Correct 36 ms 5612 KB Output is correct
4 Correct 36 ms 5484 KB Output is correct
5 Correct 35 ms 5484 KB Output is correct
6 Correct 35 ms 5484 KB Output is correct
7 Correct 35 ms 5484 KB Output is correct
8 Correct 36 ms 5632 KB Output is correct
9 Correct 35 ms 5484 KB Output is correct
10 Correct 36 ms 5484 KB Output is correct
11 Correct 23 ms 3820 KB Output is correct
12 Correct 24 ms 3820 KB Output is correct
13 Correct 24 ms 3692 KB Output is correct
14 Correct 24 ms 3820 KB Output is correct
15 Correct 36 ms 5612 KB Output is correct
16 Correct 23 ms 3692 KB Output is correct
17 Correct 24 ms 3820 KB Output is correct
18 Correct 36 ms 5612 KB Output is correct
19 Correct 35 ms 5484 KB Output is correct
20 Correct 24 ms 3820 KB Output is correct
21 Incorrect 489 ms 33480 KB Output isn't correct
22 Halted 0 ms 0 KB -