oj.uz

Submission #512300

# Submission time Handle Problem Language Result Execution time Memory
512300 2022-01-16T09:03:15 Z rk42745417 Fireworks (APIO16_fireworks) C++17
7 / 100
 1 ms 332 KB 
/*
--------------              |   /
      |                     |  /
      |                     | /
      |             *       |/          |    |         ------            *
      |                     |           |    |        /      \
      |             |       |\          |    |       |       |\          |
   \  |             |       | \         |    |       |       | \         |
    \ |             |       |  \        |    |        \     /   \        |
     V              |       |   \        \__/|         -----     \       |
*/
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << "\e[1;31m" << #x << " = " << (x) << "\e[0m\n"
#define print(x) emilia_mata_tenshi(#x, begin(x), end(x))
template<typename T> void emilia_mata_tenshi(const char *s, T l, T r) {
	cerr << "\e[1;33m" << s << " = [";
	while(l != r) {
		cerr << *l;
		cerr << (++l == r ? ']' : ',');
	}
	cerr << "\e[0m\n";
}

#define EmiliaMyWife ios::sync_with_stdio(0); cin.tie(NULL);
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using uint = uint32_t;
const double EPS  = 1e-7;
const int INF     = 0x3F3F3F3F;
const ll LINF     = 4611686018427387903;
const int MOD     = 1e9+7;
static int Lamy_is_cute = []() {
	EmiliaMyWife
	return 48763;
}();
/*--------------------------------------------------------------------------------------*/

struct dat {
	priority_queue<ll> slope;
	ll l = 0, r = 0;
	ll zero_ans = 0;
	int zero_slope = 0;
	inline int size() { return slope.size(); }
	void shift(int c) {
		while(slope.size() > zero_slope)
			slope.pop();
		if(zero_slope == 0) {
			zero_slope++;
		}
		else
			slope.pop();
		l += c, r += c;
		slope.push(l);
		slope.push(r);
		zero_ans += c;
	}
	void update() {
		ll a = slope.top(); slope.pop();
		ll b = slope.top(); slope.pop();
		l = slope.top();
		r = b;
		slope.push(a);
		slope.push(b);
	}
	void merge(dat b) {
		while(!b.slope.empty()) {
			slope.push(b.slope.top());
			b.slope.pop();
		}
		zero_ans += b.zero_ans;
		zero_slope += b.zero_slope;
		update();
	}
};

signed main() {
	int n, m;
	cin >> n >> m;
	n += m;
	vector<vector<pair<int, int>>> edge(n + 1);
	for(int i = 2; i <= n; i++) {
		int p, c;
		cin >> p >> c;
		edge[p].push_back({i, c});
	}
	vector<dat> arr(n + 1);
	function<void(int)> dfs = [&](int u) {
		for(const auto &[v, c] : edge[u]) {
			dfs(v);
			arr[v].shift(c);
			if(arr[v].size() > arr[u].size())
				swap(arr[u], arr[v]);
			arr[u].merge(arr[v]);
		}

		/* debug
		debug(u);
		ll cur = arr[u].zero_ans, sl = -arr[u].zero_slope;
		vector<ll> ch;
		while(!arr[u].slope.empty()) {
			ch.push_back(arr[u].slope.top());
			arr[u].slope.pop();
		}
		for(ll a : ch)
			arr[u].slope.push(a);
		reverse(ch.begin(), ch.end());
		ll prv = 0;
		print(ch);
		debug(cur);
		debug(sl);
		for(ll a : ch) {
			cur += (a - prv) * sl;
			sl++;
			cerr << a << ' ' << cur << '\n';
			if(sl == 0)
				break;
			prv = a;
		}
		cerr << "-------------------\n";
		*/
	};
	dfs(1);
	ll cur = arr[1].zero_ans, sl = -arr[1].zero_slope;
	vector<ll> ch;
	while(!arr[1].slope.empty()) {
		ch.push_back(arr[1].slope.top());
		arr[1].slope.pop();
	}
	reverse(ch.begin(), ch.end());
	ll prv = 0;
	/* debug
	print(ch);
	debug(cur);
	debug(sl);
	*/
	for(ll a : ch) {
		cur += (a - prv) * sl;
		sl++;
		//cerr << a << ' ' << cur << '\n';
		if(sl == 0)
			break;
		prv = a;
	}
	cout << cur << '\n';
}

Compilation message

fireworks.cpp: In member function 'void dat::shift(int)':
fireworks.cpp:47:22: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |   while(slope.size() > zero_slope)
      |         ~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.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 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.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 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Incorrect 0 ms 204 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 45.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 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 300 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Incorrect 0 ms 204 KB Output isn't correct
14 Halted 0 ms 0 KB -