oj.uz

Submission #947122

# Submission time Handle Problem Language Result Execution time Memory
947122 2024-03-15T14:18:04 Z marvinthang Fireworks (APIO16_fireworks) C++17
100 / 100
 138 ms 43920 KB 
/*************************************
*    author: marvinthang             *
*    created: 15.03.2024 20:26:27    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

void process(void) {
	int n, m; cin >> n >> m;
	vector <int> par(n + m), lengths(n + m);
	FOR(i, 1, n + m) {
		cin >> par[i] >> lengths[i];
		--par[i];
	}
	vector <int> slope(n + m);
	vector <long long> dp(n + m);
	vector <priority_queue <long long>> pq(n + m);
	REPD(i, n + m) {
		if (i >= n) {
			slope[i] = 1;
			pq[i].push(lengths[i]);
			pq[i].push(lengths[i]);
		} else {
			while (slope[i] > 1) {
				long long cur = pq[i].top(); pq[i].pop();
				dp[i] -= --slope[i] * (cur - pq[i].top());
			}
			long long x = pq[i].top() + lengths[i]; pq[i].pop();
			long long y = pq[i].top() + lengths[i]; pq[i].pop();
			pq[i].push(x);
			pq[i].push(y);
		}
		if (!i) return void(cout << dp[i] << '\n');
		if (pq[par[i]].size() < pq[i].size()) {
			pq[par[i]].swap(pq[i]);
			swap(slope[par[i]], slope[i]);
			swap(dp[par[i]], dp[i]);
		}
		if (pq[i].empty()) continue;
		dp[par[i]] += dp[i] + (pq[par[i]].top() > pq[i].top() ? slope[i] * (pq[par[i]].top() - pq[i].top()) : slope[par[i]] * (pq[i].top() - pq[par[i]].top()));
		slope[par[i]] += slope[i];
		while (!pq[i].empty()) {
			pq[par[i]].push(pq[i].top());
			pq[i].pop();
		}
	}
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("fireworks");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

fireworks.cpp: In function 'int main()':
fireworks.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fireworks.cpp:88:2: note: in expansion of macro 'file'
   88 |  file("fireworks");
      |  ^~~~
fireworks.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
fireworks.cpp:88:2: note: in expansion of macro 'file'
   88 |  file("fireworks");
      |  ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
19.0 / 19.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 860 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 2 ms 856 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 2 ms 860 KB Output is correct
46 Correct 2 ms 1116 KB Output is correct
47 Correct 3 ms 1116 KB Output is correct
48 Correct 2 ms 856 KB Output is correct
49 Correct 2 ms 1116 KB Output is correct
50 Correct 2 ms 860 KB Output is correct
51 Correct 2 ms 728 KB Output is correct
52 Correct 2 ms 860 KB Output is correct
53 Correct 2 ms 856 KB Output is correct
54 Correct 2 ms 860 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 860 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 600 KB Output is correct
43 Correct 2 ms 856 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 2 ms 860 KB Output is correct
46 Correct 2 ms 1116 KB Output is correct
47 Correct 3 ms 1116 KB Output is correct
48 Correct 2 ms 856 KB Output is correct
49 Correct 2 ms 1116 KB Output is correct
50 Correct 2 ms 860 KB Output is correct
51 Correct 2 ms 728 KB Output is correct
52 Correct 2 ms 860 KB Output is correct
53 Correct 2 ms 856 KB Output is correct
54 Correct 2 ms 860 KB Output is correct
55 Correct 4 ms 1628 KB Output is correct
56 Correct 15 ms 5468 KB Output is correct
57 Correct 27 ms 9116 KB Output is correct
58 Correct 37 ms 11532 KB Output is correct
59 Correct 46 ms 14996 KB Output is correct
60 Correct 58 ms 18636 KB Output is correct
61 Correct 66 ms 21704 KB Output is correct
62 Correct 75 ms 23600 KB Output is correct
63 Correct 91 ms 28136 KB Output is correct
64 Correct 103 ms 29324 KB Output is correct
65 Correct 47 ms 20564 KB Output is correct
66 Correct 51 ms 20560 KB Output is correct
67 Correct 47 ms 20440 KB Output is correct
68 Correct 98 ms 27336 KB Output is correct
69 Correct 106 ms 27852 KB Output is correct
70 Correct 99 ms 27860 KB Output is correct
71 Correct 138 ms 42992 KB Output is correct
72 Correct 136 ms 43920 KB Output is correct
73 Correct 114 ms 39396 KB Output is correct
74 Correct 120 ms 39804 KB Output is correct
75 Correct 117 ms 40020 KB Output is correct
76 Correct 123 ms 39496 KB Output is correct
77 Correct 122 ms 39324 KB Output is correct
78 Correct 124 ms 37568 KB Output is correct
79 Correct 129 ms 35772 KB Output is correct