oj.uz

Submission #777320

# Submission time Handle Problem Language Result Execution time Memory
777320 2023-07-09T04:24:20 Z marvinthang Worst Reporter 4 (JOI21_worst_reporter4) C++17
100 / 100
 287 ms 105948 KB 
/*************************************
*    author: marvinthang             *
*    created: 09.07.2023 11:03:31`    *
*************************************/

#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--; )
#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

const int MAX = 2e5 + 5;

int N, A[MAX], H[MAX], C[MAX];

void init(void) {
	cin >> N;
	REP(i, N) {
		cin >> A[i] >> H[i] >> C[i];
		--A[i];
	}
}

int visited[MAX];
vector <int> adj[MAX];
map <int, long long> dp[MAX];

void dfs(int u) {
	for (int v: adj[u]) {
		dfs(v);
		if (dp[u].size() < dp[v].size()) dp[u].swap(dp[v]);
		for (auto [x, y]: dp[v]) dp[u][x] += y;
	}
	dp[u][H[u]] += C[u];
	int val = C[u];
	auto it = dp[u].find(H[u]);
	while (it != dp[u].begin()) {
		it = prev(it);
		if (it->se <= val) {
			val -= it->se;
			it = dp[u].erase(it);
		} else {
			it->se -= val;
			break;
		}
	}
}

int lab[MAX];

void process(void) {
	iota(lab, lab + N, 0);
	REP(i, N) if (!visited[i]) {
		vector <int> v;
		int u = i;
		while (!visited[u]) {
			visited[u] = 1;
			v.push_back(u);
			u = A[u];
		}
		v.erase(v.begin(), find(ALL(v), u));
		if (v.empty()) continue;
		sort(ALL(v), [&] (int u, int v) { return H[u] > H[v]; });
		for (int u: v) {
			visited[u] = 2;
			lab[u] = v.back();
		}
		REP(i, (int) v.size() - 1) adj[v[i]].push_back(v[i + 1]);
		visited[v[0]] = 3;
	}
	REP(i, N) if (visited[i] == 1) adj[lab[A[i]]].push_back(i);
	long long res = accumulate(C, C + N, 0LL);
	REP(i, N) if (visited[i] == 3) {
		dfs(i);
		for (auto [u, v]: dp[i]) res -= v;
	}
	cout << res << '\n';
}

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

Compilation message

worst_reporter2.cpp: In function 'int main()':
worst_reporter2.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
worst_reporter2.cpp:115:2: note: in expansion of macro 'file'
  115 |  file("worst_reporter4");
      |  ^~~~
worst_reporter2.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
worst_reporter2.cpp:115:2: note: in expansion of macro 'file'
  115 |  file("worst_reporter4");
      |  ^~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14396 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 11 ms 15600 KB Output is correct
6 Correct 11 ms 15280 KB Output is correct
7 Correct 10 ms 14980 KB Output is correct
8 Correct 12 ms 15700 KB Output is correct
9 Correct 10 ms 15184 KB Output is correct
10 Correct 11 ms 14956 KB Output is correct
11 Correct 8 ms 14828 KB Output is correct
12 Correct 9 ms 15476 KB Output is correct
13 Correct 9 ms 15444 KB Output is correct
14 Correct 9 ms 15140 KB Output is correct
15 Correct 11 ms 15228 KB Output is correct
16 Correct 15 ms 16004 KB Output is correct
17 Correct 11 ms 15428 KB Output is correct
18 Correct 10 ms 14804 KB Output is correct
19 Correct 10 ms 15316 KB Output is correct
20 Correct 9 ms 15132 KB Output is correct
21 Correct 9 ms 15188 KB Output is correct
22 Correct 10 ms 15204 KB Output is correct
23 Correct 9 ms 14960 KB Output is correct
24 Correct 10 ms 15444 KB Output is correct
25 Correct 9 ms 15188 KB Output is correct
26 Correct 9 ms 15444 KB Output is correct
27 Correct 12 ms 15572 KB Output is correct
28 Correct 10 ms 15464 KB Output is correct
29 Correct 10 ms 15572 KB Output is correct
30 Correct 10 ms 15612 KB Output is correct
31 Correct 11 ms 15596 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14396 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 11 ms 15600 KB Output is correct
6 Correct 11 ms 15280 KB Output is correct
7 Correct 10 ms 14980 KB Output is correct
8 Correct 12 ms 15700 KB Output is correct
9 Correct 10 ms 15184 KB Output is correct
10 Correct 11 ms 14956 KB Output is correct
11 Correct 8 ms 14828 KB Output is correct
12 Correct 9 ms 15476 KB Output is correct
13 Correct 9 ms 15444 KB Output is correct
14 Correct 9 ms 15140 KB Output is correct
15 Correct 11 ms 15228 KB Output is correct
16 Correct 15 ms 16004 KB Output is correct
17 Correct 11 ms 15428 KB Output is correct
18 Correct 10 ms 14804 KB Output is correct
19 Correct 10 ms 15316 KB Output is correct
20 Correct 9 ms 15132 KB Output is correct
21 Correct 9 ms 15188 KB Output is correct
22 Correct 10 ms 15204 KB Output is correct
23 Correct 9 ms 14960 KB Output is correct
24 Correct 10 ms 15444 KB Output is correct
25 Correct 9 ms 15188 KB Output is correct
26 Correct 9 ms 15444 KB Output is correct
27 Correct 12 ms 15572 KB Output is correct
28 Correct 10 ms 15464 KB Output is correct
29 Correct 10 ms 15572 KB Output is correct
30 Correct 10 ms 15612 KB Output is correct
31 Correct 11 ms 15596 KB Output is correct
32 Correct 11 ms 15712 KB Output is correct
33 Correct 279 ms 80936 KB Output is correct
34 Correct 243 ms 56220 KB Output is correct
35 Correct 267 ms 77968 KB Output is correct
36 Correct 202 ms 56056 KB Output is correct
37 Correct 148 ms 37236 KB Output is correct
38 Correct 111 ms 32664 KB Output is correct
39 Correct 116 ms 57872 KB Output is correct
40 Correct 106 ms 57912 KB Output is correct
41 Correct 85 ms 57904 KB Output is correct
42 Correct 118 ms 43940 KB Output is correct
43 Correct 101 ms 43848 KB Output is correct
44 Correct 281 ms 105948 KB Output is correct
45 Correct 179 ms 70348 KB Output is correct
46 Correct 68 ms 32728 KB Output is correct
47 Correct 162 ms 53736 KB Output is correct
48 Correct 92 ms 46796 KB Output is correct
49 Correct 75 ms 46836 KB Output is correct
50 Correct 211 ms 48372 KB Output is correct
51 Correct 75 ms 35964 KB Output is correct
52 Correct 163 ms 54428 KB Output is correct
53 Correct 88 ms 47284 KB Output is correct
54 Correct 94 ms 58112 KB Output is correct
55 Correct 140 ms 55348 KB Output is correct
56 Correct 123 ms 61232 KB Output is correct
57 Correct 114 ms 64288 KB Output is correct
58 Correct 133 ms 61768 KB Output is correct
59 Correct 135 ms 61800 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14396 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 11 ms 15600 KB Output is correct
6 Correct 11 ms 15280 KB Output is correct
7 Correct 10 ms 14980 KB Output is correct
8 Correct 12 ms 15700 KB Output is correct
9 Correct 10 ms 15184 KB Output is correct
10 Correct 11 ms 14956 KB Output is correct
11 Correct 8 ms 14828 KB Output is correct
12 Correct 9 ms 15476 KB Output is correct
13 Correct 9 ms 15444 KB Output is correct
14 Correct 9 ms 15140 KB Output is correct
15 Correct 11 ms 15228 KB Output is correct
16 Correct 15 ms 16004 KB Output is correct
17 Correct 11 ms 15428 KB Output is correct
18 Correct 10 ms 14804 KB Output is correct
19 Correct 10 ms 15316 KB Output is correct
20 Correct 9 ms 15132 KB Output is correct
21 Correct 9 ms 15188 KB Output is correct
22 Correct 10 ms 15204 KB Output is correct
23 Correct 9 ms 14960 KB Output is correct
24 Correct 10 ms 15444 KB Output is correct
25 Correct 9 ms 15188 KB Output is correct
26 Correct 9 ms 15444 KB Output is correct
27 Correct 12 ms 15572 KB Output is correct
28 Correct 10 ms 15464 KB Output is correct
29 Correct 10 ms 15572 KB Output is correct
30 Correct 10 ms 15612 KB Output is correct
31 Correct 11 ms 15596 KB Output is correct
32 Correct 11 ms 15712 KB Output is correct
33 Correct 279 ms 80936 KB Output is correct
34 Correct 243 ms 56220 KB Output is correct
35 Correct 267 ms 77968 KB Output is correct
36 Correct 202 ms 56056 KB Output is correct
37 Correct 148 ms 37236 KB Output is correct
38 Correct 111 ms 32664 KB Output is correct
39 Correct 116 ms 57872 KB Output is correct
40 Correct 106 ms 57912 KB Output is correct
41 Correct 85 ms 57904 KB Output is correct
42 Correct 118 ms 43940 KB Output is correct
43 Correct 101 ms 43848 KB Output is correct
44 Correct 281 ms 105948 KB Output is correct
45 Correct 179 ms 70348 KB Output is correct
46 Correct 68 ms 32728 KB Output is correct
47 Correct 162 ms 53736 KB Output is correct
48 Correct 92 ms 46796 KB Output is correct
49 Correct 75 ms 46836 KB Output is correct
50 Correct 211 ms 48372 KB Output is correct
51 Correct 75 ms 35964 KB Output is correct
52 Correct 163 ms 54428 KB Output is correct
53 Correct 88 ms 47284 KB Output is correct
54 Correct 94 ms 58112 KB Output is correct
55 Correct 140 ms 55348 KB Output is correct
56 Correct 123 ms 61232 KB Output is correct
57 Correct 114 ms 64288 KB Output is correct
58 Correct 133 ms 61768 KB Output is correct
59 Correct 135 ms 61800 KB Output is correct
60 Correct 11 ms 14420 KB Output is correct
61 Correct 9 ms 14420 KB Output is correct
62 Correct 10 ms 14420 KB Output is correct
63 Correct 7 ms 14420 KB Output is correct
64 Correct 287 ms 65964 KB Output is correct
65 Correct 195 ms 49256 KB Output is correct
66 Correct 253 ms 66708 KB Output is correct
67 Correct 239 ms 49248 KB Output is correct
68 Correct 133 ms 35484 KB Output is correct
69 Correct 118 ms 32152 KB Output is correct
70 Correct 145 ms 49016 KB Output is correct
71 Correct 131 ms 44120 KB Output is correct
72 Correct 142 ms 57956 KB Output is correct
73 Correct 120 ms 57888 KB Output is correct
74 Correct 184 ms 54984 KB Output is correct
75 Correct 117 ms 47328 KB Output is correct
76 Correct 97 ms 47244 KB Output is correct
77 Correct 183 ms 55048 KB Output is correct
78 Correct 116 ms 47284 KB Output is correct
79 Correct 236 ms 70260 KB Output is correct
80 Correct 173 ms 58356 KB Output is correct
81 Correct 127 ms 47740 KB Output is correct
82 Correct 171 ms 58100 KB Output is correct
83 Correct 68 ms 35876 KB Output is correct
84 Correct 204 ms 58152 KB Output is correct
85 Correct 181 ms 58044 KB Output is correct
86 Correct 193 ms 58108 KB Output is correct
87 Correct 174 ms 58132 KB Output is correct
88 Correct 222 ms 58128 KB Output is correct