제출 #47801

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
47801		square1001	Fireworks (APIO16_fireworks)	C++14	26 / 100	20 ms	21876 KiB

fireworks

#include <set>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int N, M, p[300009], c[300009], id[300009]; vector<int> g[300009]; multiset<long long> v[300009];
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cin >> N >> M;
	long long sum = 0;
	for (int i = 1; i < N + M; i++) {
		cin >> p[i] >> c[i];
		g[--p[i]].push_back(i);
		sum += c[i];
		if (i >= N) {
			v[i - N].insert(c[i]);
			v[i - N].insert(c[i]);
			id[i] = i - N;
		}
	}
	for (int i = N - 1; i >= 0; i--) {
		int mx = 0;
		for (int j : g[i]) {
			if (mx < v[id[j]].size()) {
				mx = v[id[j]].size();
				id[i] = id[j];
			}
		}
		for (int j : g[i]) {
			if (id[j] != id[i]) {
				int sz = v[id[i]].size();
				v[id[i]].insert(v[id[j]].begin(), v[id[j]].end());
			}
		}
		multiset<long long>::iterator it = --v[id[i]].end();
		for (int j = 1; j < g[i].size(); j++) {
			it = --v[id[i]].erase(it);
		}
		int va = *it; it = --v[id[i]].erase(it);
		int vb = *it; it = --v[id[i]].erase(it);
		v[id[i]].insert(va + c[i]);
		v[id[i]].insert(vb + c[i]);
	}
	vector<long long> res(v[id[0]].begin(), v[id[0]].end());
	for (int i = 0; i < res.size(); i++) {
		sum -= (res[i] - (i == 0 ? 0 : res[i - 1])) * (res.size() - i - 1);
	}
	cout << sum << '\n';
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

fireworks.cpp: In function 'int main()':
fireworks.cpp:25:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (mx < v[id[j]].size()) {
        ~~~^~~~~~~~~~~~~~~~~
fireworks.cpp:32:9: warning: unused variable 'sz' [-Wunused-variable]
     int sz = v[id[i]].size();
         ^~
fireworks.cpp:37:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 1; j < g[i].size(); j++) {
                   ~~^~~~~~~~~~~~~
fireworks.cpp:46:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < res.size(); i++) {
                  ~~^~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 19 / 19
• Subtask 3: 0 / 29
• Subtask 4: 0 / 45