oj.uz

Submission #871011

# Submission time Handle Problem Language Result Execution time Memory
871011 2023-11-09T17:17:31 Z marvinthang Bridges (APIO19_bridges) C++17
100 / 100
 1883 ms 9136 KB 
/*************************************
*    author: marvinthang             *
*    created: 09.11.2023 22:50:14    *
*************************************/

#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

const int BLOCK_SIZE = 320;

struct Edge {
	int u, v, w;
	Edge(int u, int v, int w): u(u), v(v), w(w) {}
	bool operator < (const Edge &other) const {	return w > other.w; }
};

struct Query {
	int t, u, w;
	Query(int t, int u, int w): t(t), u(u), w(w) {}
};

void process(void) {
	int n, m, q; cin >> n >> m;
	vector <Edge> edges;
	REP(i, m) {
		int u, v, w; cin >> u >> v >> w; --u; --v;
		edges.emplace_back(u, v, w);
	}
	vector <int> ord(m);
	iota(ALL(ord), 0);
	sort(ALL(ord), [&] (int a, int b) { return edges[a].w > edges[b].w; });
	vector <Query> queries;
	cin >> q;
	REP(i, q) {
		int t, u, w; cin >> t >> u >> w; --u;
		queries.emplace_back(t, u, w);
	}
	vector <int> par(n, -1);
	stack <pair <int, int>> his;
	function <int(int, bool)> find = [&] (int u, bool save) {
		if (par[u] < 0) return u;
		if (save) his.emplace(u, par[u]);
		return par[u] = find(par[u], save);
	};
	auto join = [&] (int u, int v, bool save) {
		if ((u = find(u, save)) == (v = find(v, save))) return false;
		if (par[u] > par[v]) swap(u, v);
		if (save) his.emplace(u, par[u]);
		if (save) his.emplace(v, par[v]);
		par[u] += par[v];
		par[v] = u;
		return true;
	};
	auto rollback = [&] {
		while (!his.empty()) {
			par[his.top().fi] = his.top().se;
			his.pop();
		}
	};
	vector <bool> used(m);
	vector <int> res(q, -1);
	for (int l = 0; l < q; ) {
		int r = min(q, l + BLOCK_SIZE);
		vector <int> qr;
		FOR(i, l, r) {
			if (queries[i].t == 1) used[queries[i].u] = true;
			else qr.push_back(i);
		}
		fill(ALL(par), -1);
		sort(ALL(qr), [&] (int a, int b) { return queries[a].w > queries[b].w; });
		int p = 0;
		for (int i: qr) {
			auto [t, u, w] = queries[i];
			while (p < m && edges[ord[p]].w >= w) {
				if (!used[ord[p]]) join(edges[ord[p]].u, edges[ord[p]].v, false);
				++p;
			}
			FORD(j, i, l) if (queries[j].t == 1) {
				int x = queries[j].u;
				if (!used[x]) continue;
				used[x] = false;
				if (queries[j].w >= w) join(edges[x].u, edges[x].v, true);
			}
			FOR(j, i + 1, r) if (queries[j].t == 1) {
				int x = queries[j].u;
				if (!used[x] || edges[x].w < w) continue;
				used[x] = false;
				join(edges[x].u, edges[x].v, true);
			}
			res[i] = -par[find(u, true)];
			FOR(j, l, r) if (queries[j].t == 1) used[queries[j].u] = true;
			rollback();
		}
		vector <int> nxt;
		FORD(i, r, l) if (queries[i].t == 1) {
			int x = queries[i].u;
			if (!used[x]) continue;
			used[x] = false;
			edges[x].w = queries[i].w;
			nxt.push_back(x);
		}
		for (int i: nxt) used[i] = true;
		sort(ALL(nxt), [&] (int a, int b) { return edges[a].w > edges[b].w; });
		int i = 0, j = 0;
		vector <int> new_ord;
		while (i < m || j < nxt.size()) {
			if (i < m && used[ord[i]]) ++i;
			else if (i == m || (j < nxt.size() && edges[ord[i]].w <= edges[nxt[j]].w)) new_ord.push_back(nxt[j++]);
			else new_ord.push_back(ord[i++]);
		}
		for (int i: nxt) used[i] = false;
		ord = move(new_ord);
		l = r;
	}
	REP(i, q) if (res[i] != -1) cout << res[i] << '\n';
}

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

Compilation message

bridges.cpp: In function 'void process()':
bridges.cpp:142:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |   while (i < m || j < nxt.size()) {
      |                   ~~^~~~~~~~~~~~
bridges.cpp:144:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |    else if (i == m || (j < nxt.size() && edges[ord[i]].w <= edges[nxt[j]].w)) new_ord.push_back(nxt[j++]);
      |                        ~~^~~~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:156:2: note: in expansion of macro 'file'
  156 |  file("bridges");
      |  ^~~~
bridges.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:156:2: note: in expansion of macro 'file'
  156 |  file("bridges");
      |  ^~~~

Subtask #1
13.0 / 13.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 21 ms 904 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 17 ms 860 KB Output is correct
6 Correct 16 ms 860 KB Output is correct
7 Correct 19 ms 796 KB Output is correct
8 Correct 17 ms 876 KB Output is correct
9 Correct 21 ms 792 KB Output is correct
10 Correct 18 ms 856 KB Output is correct
11 Correct 17 ms 872 KB Output is correct
12 Correct 18 ms 856 KB Output is correct
13 Correct 23 ms 856 KB Output is correct
14 Correct 21 ms 856 KB Output is correct
15 Correct 22 ms 872 KB Output is correct
16 Correct 19 ms 668 KB Output is correct
17 Correct 18 ms 720 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 867 ms 5532 KB Output is correct
2 Correct 907 ms 5452 KB Output is correct
3 Correct 906 ms 5428 KB Output is correct
4 Correct 1010 ms 5704 KB Output is correct
5 Correct 1004 ms 5700 KB Output is correct
6 Correct 1528 ms 5648 KB Output is correct
7 Correct 1587 ms 5640 KB Output is correct
8 Correct 1520 ms 5692 KB Output is correct
9 Correct 75 ms 3272 KB Output is correct
10 Correct 1002 ms 5204 KB Output is correct
11 Correct 999 ms 4972 KB Output is correct
12 Correct 977 ms 5412 KB Output is correct
13 Correct 927 ms 5400 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 4568 KB Output is correct
2 Correct 412 ms 3828 KB Output is correct
3 Correct 666 ms 5152 KB Output is correct
4 Correct 588 ms 5444 KB Output is correct
5 Correct 68 ms 3524 KB Output is correct
6 Correct 651 ms 5328 KB Output is correct
7 Correct 564 ms 5576 KB Output is correct
8 Correct 514 ms 5432 KB Output is correct
9 Correct 474 ms 5748 KB Output is correct
10 Correct 496 ms 5336 KB Output is correct
11 Correct 440 ms 5400 KB Output is correct
12 Correct 414 ms 5400 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1318 ms 7776 KB Output is correct
2 Correct 78 ms 3272 KB Output is correct
3 Correct 119 ms 4548 KB Output is correct
4 Correct 98 ms 4692 KB Output is correct
5 Correct 1145 ms 6996 KB Output is correct
6 Correct 1317 ms 7772 KB Output is correct
7 Correct 1153 ms 7000 KB Output is correct
8 Correct 671 ms 5364 KB Output is correct
9 Correct 662 ms 5484 KB Output is correct
10 Correct 663 ms 5476 KB Output is correct
11 Correct 1208 ms 6728 KB Output is correct
12 Correct 1157 ms 7012 KB Output is correct
13 Correct 1240 ms 7236 KB Output is correct
14 Correct 1126 ms 7236 KB Output is correct
15 Correct 1121 ms 7232 KB Output is correct
16 Correct 1638 ms 7760 KB Output is correct
17 Correct 1621 ms 7748 KB Output is correct
18 Correct 1528 ms 7764 KB Output is correct
19 Correct 1571 ms 7756 KB Output is correct
20 Correct 1400 ms 7276 KB Output is correct
21 Correct 1402 ms 7244 KB Output is correct
22 Correct 1464 ms 7948 KB Output is correct
23 Correct 1247 ms 6728 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 867 ms 5532 KB Output is correct
2 Correct 907 ms 5452 KB Output is correct
3 Correct 906 ms 5428 KB Output is correct
4 Correct 1010 ms 5704 KB Output is correct
5 Correct 1004 ms 5700 KB Output is correct
6 Correct 1528 ms 5648 KB Output is correct
7 Correct 1587 ms 5640 KB Output is correct
8 Correct 1520 ms 5692 KB Output is correct
9 Correct 75 ms 3272 KB Output is correct
10 Correct 1002 ms 5204 KB Output is correct
11 Correct 999 ms 4972 KB Output is correct
12 Correct 977 ms 5412 KB Output is correct
13 Correct 927 ms 5400 KB Output is correct
14 Correct 582 ms 4568 KB Output is correct
15 Correct 412 ms 3828 KB Output is correct
16 Correct 666 ms 5152 KB Output is correct
17 Correct 588 ms 5444 KB Output is correct
18 Correct 68 ms 3524 KB Output is correct
19 Correct 651 ms 5328 KB Output is correct
20 Correct 564 ms 5576 KB Output is correct
21 Correct 514 ms 5432 KB Output is correct
22 Correct 474 ms 5748 KB Output is correct
23 Correct 496 ms 5336 KB Output is correct
24 Correct 440 ms 5400 KB Output is correct
25 Correct 414 ms 5400 KB Output is correct
26 Correct 769 ms 6468 KB Output is correct
27 Correct 1046 ms 6464 KB Output is correct
28 Correct 920 ms 6752 KB Output is correct
29 Correct 774 ms 6468 KB Output is correct
30 Correct 1065 ms 6336 KB Output is correct
31 Correct 1113 ms 6300 KB Output is correct
32 Correct 1086 ms 6584 KB Output is correct
33 Correct 916 ms 6504 KB Output is correct
34 Correct 924 ms 6568 KB Output is correct
35 Correct 929 ms 6636 KB Output is correct
36 Correct 797 ms 6728 KB Output is correct
37 Correct 783 ms 6572 KB Output is correct
38 Correct 777 ms 6568 KB Output is correct
39 Correct 752 ms 6732 KB Output is correct
40 Correct 736 ms 6580 KB Output is correct
41 Correct 716 ms 6464 KB Output is correct
42 Correct 614 ms 6592 KB Output is correct
43 Correct 610 ms 6564 KB Output is correct
44 Correct 608 ms 6544 KB Output is correct

Subtask #6
27.0 / 27.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 21 ms 904 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 17 ms 860 KB Output is correct
6 Correct 16 ms 860 KB Output is correct
7 Correct 19 ms 796 KB Output is correct
8 Correct 17 ms 876 KB Output is correct
9 Correct 21 ms 792 KB Output is correct
10 Correct 18 ms 856 KB Output is correct
11 Correct 17 ms 872 KB Output is correct
12 Correct 18 ms 856 KB Output is correct
13 Correct 23 ms 856 KB Output is correct
14 Correct 21 ms 856 KB Output is correct
15 Correct 22 ms 872 KB Output is correct
16 Correct 19 ms 668 KB Output is correct
17 Correct 18 ms 720 KB Output is correct
18 Correct 867 ms 5532 KB Output is correct
19 Correct 907 ms 5452 KB Output is correct
20 Correct 906 ms 5428 KB Output is correct
21 Correct 1010 ms 5704 KB Output is correct
22 Correct 1004 ms 5700 KB Output is correct
23 Correct 1528 ms 5648 KB Output is correct
24 Correct 1587 ms 5640 KB Output is correct
25 Correct 1520 ms 5692 KB Output is correct
26 Correct 75 ms 3272 KB Output is correct
27 Correct 1002 ms 5204 KB Output is correct
28 Correct 999 ms 4972 KB Output is correct
29 Correct 977 ms 5412 KB Output is correct
30 Correct 927 ms 5400 KB Output is correct
31 Correct 582 ms 4568 KB Output is correct
32 Correct 412 ms 3828 KB Output is correct
33 Correct 666 ms 5152 KB Output is correct
34 Correct 588 ms 5444 KB Output is correct
35 Correct 68 ms 3524 KB Output is correct
36 Correct 651 ms 5328 KB Output is correct
37 Correct 564 ms 5576 KB Output is correct
38 Correct 514 ms 5432 KB Output is correct
39 Correct 474 ms 5748 KB Output is correct
40 Correct 496 ms 5336 KB Output is correct
41 Correct 440 ms 5400 KB Output is correct
42 Correct 414 ms 5400 KB Output is correct
43 Correct 1318 ms 7776 KB Output is correct
44 Correct 78 ms 3272 KB Output is correct
45 Correct 119 ms 4548 KB Output is correct
46 Correct 98 ms 4692 KB Output is correct
47 Correct 1145 ms 6996 KB Output is correct
48 Correct 1317 ms 7772 KB Output is correct
49 Correct 1153 ms 7000 KB Output is correct
50 Correct 671 ms 5364 KB Output is correct
51 Correct 662 ms 5484 KB Output is correct
52 Correct 663 ms 5476 KB Output is correct
53 Correct 1208 ms 6728 KB Output is correct
54 Correct 1157 ms 7012 KB Output is correct
55 Correct 1240 ms 7236 KB Output is correct
56 Correct 1126 ms 7236 KB Output is correct
57 Correct 1121 ms 7232 KB Output is correct
58 Correct 1638 ms 7760 KB Output is correct
59 Correct 1621 ms 7748 KB Output is correct
60 Correct 1528 ms 7764 KB Output is correct
61 Correct 1571 ms 7756 KB Output is correct
62 Correct 1400 ms 7276 KB Output is correct
63 Correct 1402 ms 7244 KB Output is correct
64 Correct 1464 ms 7948 KB Output is correct
65 Correct 1247 ms 6728 KB Output is correct
66 Correct 769 ms 6468 KB Output is correct
67 Correct 1046 ms 6464 KB Output is correct
68 Correct 920 ms 6752 KB Output is correct
69 Correct 774 ms 6468 KB Output is correct
70 Correct 1065 ms 6336 KB Output is correct
71 Correct 1113 ms 6300 KB Output is correct
72 Correct 1086 ms 6584 KB Output is correct
73 Correct 916 ms 6504 KB Output is correct
74 Correct 924 ms 6568 KB Output is correct
75 Correct 929 ms 6636 KB Output is correct
76 Correct 797 ms 6728 KB Output is correct
77 Correct 783 ms 6572 KB Output is correct
78 Correct 777 ms 6568 KB Output is correct
79 Correct 752 ms 6732 KB Output is correct
80 Correct 736 ms 6580 KB Output is correct
81 Correct 716 ms 6464 KB Output is correct
82 Correct 614 ms 6592 KB Output is correct
83 Correct 610 ms 6564 KB Output is correct
84 Correct 608 ms 6544 KB Output is correct
85 Correct 1561 ms 8812 KB Output is correct
86 Correct 136 ms 5324 KB Output is correct
87 Correct 120 ms 5592 KB Output is correct
88 Correct 1420 ms 7760 KB Output is correct
89 Correct 1567 ms 9136 KB Output is correct
90 Correct 1407 ms 7744 KB Output is correct
91 Correct 975 ms 6476 KB Output is correct
92 Correct 953 ms 6728 KB Output is correct
93 Correct 1356 ms 6576 KB Output is correct
94 Correct 1557 ms 8384 KB Output is correct
95 Correct 1436 ms 8304 KB Output is correct
96 Correct 1741 ms 8268 KB Output is correct
97 Correct 1256 ms 7748 KB Output is correct
98 Correct 1271 ms 8004 KB Output is correct
99 Correct 1859 ms 8856 KB Output is correct
100 Correct 1827 ms 9028 KB Output is correct
101 Correct 1789 ms 8800 KB Output is correct
102 Correct 1789 ms 8788 KB Output is correct
103 Correct 1883 ms 8680 KB Output is correct
104 Correct 1859 ms 8636 KB Output is correct
105 Correct 1618 ms 8220 KB Output is correct
106 Correct 1312 ms 8192 KB Output is correct
107 Correct 1572 ms 8364 KB Output is correct
108 Correct 1809 ms 8952 KB Output is correct
109 Correct 1637 ms 7168 KB Output is correct