oj.uz

Submission #120572

# Submission time Handle Problem Language Result Execution time Memory
120572 2019-06-25T03:30:27 Z tinder Bridges (APIO19_bridges) C++14
100 / 100
 1730 ms 6804 KB 
#include <bits/stdc++.h>
using namespace std;

#define v first
#define cost second
#define push_back emplace_back

using ii = pair<int, int>;
const int magic = 400;
const int maxn = 50000 + 5;

int n, m, Q;
int l[maxn << 1], r[maxn << 1], w[maxn << 1];
int ww[maxn << 1];
int par[maxn], sz[maxn];
vector<int> op, id, cost;
int in_buffer[maxn << 1];
int ans[maxn];
vector<int> g[maxn];
vector<int> clr;
vector<int> p, q;
vector<int> ord;

struct List {
	int lst[maxn << 1];
	int ptr;
	List() { ptr = 0; }
	inline void insert(int x) { lst[ptr++] = x; }
	inline void clear() { ptr = 0; }
} xyz;
int vis[maxn];

int find(int u) {
	return par[u] == u ? u : par[u] = find(par[u]);
}
void unite(int u, int v) {
	u = find(u);
	v = find(v);
	if(u == v) return;
	if(sz[u] > sz[v]) swap(u, v);
	sz[v] += sz[u];
	par[u] = v;
}

void dfs(int u, int &res) {
	vis[u] = 1;
	xyz.insert(u);
	res += sz[u];
	for(int v : g[u]) {
		if(!vis[v]) {
			dfs(v, res);
		}
	}
}

void solve() {
	for(int i = 0; i < op.size(); i++) {
		if(op[i] == 1) in_buffer[id[i]] = 1;
	}
	for(int i = 1; i <= n; i++) {
		par[i] = i;
		sz[i] = 1;
	}
	for(int i = 0; i < m; i++) {
		if(!in_buffer[ord[i]]) {
			p.push_back(ord[i]);
		}
	}
	for(int i = 0; i < op.size(); i++) {
		if(op[i] == 1) in_buffer[id[i]] = 0;
		else q.push_back(i);
	}
	sort(q.begin(), q.end(), [&](int x, int y){ return cost[x] > cost[y]; });
	int i = p.size() - 1;
	for(int j : q) {
		while(i >= 0 and w[p[i]] >= cost[j]) {
			unite(l[p[i]], r[p[i]]);
			i--;
		}
		for(int k = 0; k < j; k++) if(op[k] == 1) {
			ww[id[k]] = cost[k];
		}
		int u, v;
		for(int k = 0; k < j; k++) if(op[k] == 1) {
			if(ww[id[k]] >= cost[j]) {
				u = l[id[k]];
				v = r[id[k]];
				u = find(u);
				v = find(v);
				g[u].push_back(v);
				g[v].push_back(u);

				clr.push_back(u);
				clr.push_back(v);
			}
		}
		for(int k = j + 1; k < op.size(); k++) if(op[k] == 1) {
			if(!ww[id[k]]) {
				if(w[id[k]] >= cost[j]) {
					u = l[id[k]];
					v = r[id[k]];
					u = find(u);
					v = find(v);
					g[u].push_back(v);
					g[v].push_back(u);

					clr.push_back(u);
					clr.push_back(v);
				}
			}
		}
		ans[j] = 0;
		dfs(find(id[j]), ans[j]);

		for(int k : clr) g[k].clear();
		for(int k = 0; k < xyz.ptr; k++)
			vis[xyz.lst[k]] = 0;
		clr.clear();
		xyz.clear();
		for(int k = 0; k < j; k++) if(op[k] == 1)
			ww[id[k]] = 0;
	}

	for(int i = 0; i < op.size(); i++) if(op[i] == 1)
		w[id[i]] = cost[i];

	q.clear();
	for(int i = 0; i < op.size(); i++) if(op[i] == 1)
		q.push_back(id[i]);
	sort(q.begin(), q.end());
	q.erase(unique(q.begin(), q.end()), q.end());
	sort(q.begin(), q.end(), [](int x, int y) { return w[x] < w[y]; });

	ord.clear();
	merge(p.begin(), p.end(), q.begin(), q.end(), back_inserter(ord), [](int x, int y){ return w[x] < w[y]; });

	for(int i = 0; i < op.size(); i++) {
		if(op[i] == 2) {
			printf("%d\n", ans[i]);
		}
	}

	p.clear();
	q.clear();
	op.clear();
	id.clear();
	cost.clear();
}

int main(int argc, char const *argv[])
{
	// freopen("in", "r", stdin);
	scanf("%d %d", &n, &m);
	{
		ord.reserve((maxn << 1) + 10);
		p.reserve((maxn << 1) + 10);
		q.reserve((maxn << 1) + 10);
		op.reserve((maxn << 1) + 10);
		id.reserve((maxn << 1) + 10);
		cost.reserve((maxn << 1) + 10);
		clr.reserve((maxn << 1) + 10);
	}
	for(int i = 0; i < m; i++) {
		scanf("%d %d %d", &l[i], &r[i], &w[i]);
		ord.push_back(i);
	}
	sort(ord.begin(), ord.end(), [](int x, int y) { return w[x] < w[y]; } );
	scanf("%d", &Q);
	int done = 0;
	while(Q--) {
		int op, id, cost;
		scanf("%d %d %d", &op, &id, &cost);
		if(op == 1) id--;
		::op.push_back(op);
		::id.push_back(id);
		::cost.push_back(cost);
		if(::op.size() == magic and !done) {
			solve();
		}
	}
	if(op.size()) {
		solve();
	}
	return 0;
}

Compilation message

bridges.cpp: In function 'void solve()':
bridges.cpp:57:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < op.size(); i++) {
                 ~~^~~~~~~~~~~
bridges.cpp:69:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < op.size(); i++) {
                 ~~^~~~~~~~~~~
bridges.cpp:97:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int k = j + 1; k < op.size(); k++) if(op[k] == 1) {
                      ~~^~~~~~~~~~~
bridges.cpp:124:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < op.size(); i++) if(op[i] == 1)
                 ~~^~~~~~~~~~~
bridges.cpp:128:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < op.size(); i++) if(op[i] == 1)
                 ~~^~~~~~~~~~~
bridges.cpp:137:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < op.size(); i++) {
                 ~~^~~~~~~~~~~
bridges.cpp: In function 'int main(int, const char**)':
bridges.cpp:153:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
bridges.cpp:164:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &l[i], &r[i], &w[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:168:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
  ~~~~~^~~~~~~~~~
bridges.cpp:172:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &op, &id, &cost);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1664 KB Output is correct
2 Correct 3 ms 1536 KB Output is correct
3 Correct 26 ms 1792 KB Output is correct
4 Correct 13 ms 1664 KB Output is correct
5 Correct 27 ms 1792 KB Output is correct
6 Correct 26 ms 1792 KB Output is correct
7 Correct 24 ms 1664 KB Output is correct
8 Correct 24 ms 1784 KB Output is correct
9 Correct 29 ms 1784 KB Output is correct
10 Correct 23 ms 1792 KB Output is correct
11 Correct 23 ms 1792 KB Output is correct
12 Correct 24 ms 1712 KB Output is correct
13 Correct 27 ms 1792 KB Output is correct
14 Correct 26 ms 1792 KB Output is correct
15 Correct 27 ms 1664 KB Output is correct
16 Correct 25 ms 1664 KB Output is correct
17 Correct 24 ms 1792 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 845 ms 5692 KB Output is correct
2 Correct 877 ms 5596 KB Output is correct
3 Correct 883 ms 5624 KB Output is correct
4 Correct 864 ms 5824 KB Output is correct
5 Correct 828 ms 5712 KB Output is correct
6 Correct 1028 ms 4856 KB Output is correct
7 Correct 974 ms 4856 KB Output is correct
8 Correct 955 ms 4912 KB Output is correct
9 Correct 108 ms 2040 KB Output is correct
10 Correct 814 ms 5496 KB Output is correct
11 Correct 805 ms 5720 KB Output is correct
12 Correct 821 ms 4860 KB Output is correct
13 Correct 700 ms 4832 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 960 ms 4904 KB Output is correct
2 Correct 468 ms 3076 KB Output is correct
3 Correct 809 ms 4836 KB Output is correct
4 Correct 739 ms 4788 KB Output is correct
5 Correct 112 ms 2384 KB Output is correct
6 Correct 771 ms 4588 KB Output is correct
7 Correct 704 ms 4516 KB Output is correct
8 Correct 663 ms 4728 KB Output is correct
9 Correct 661 ms 4432 KB Output is correct
10 Correct 509 ms 4392 KB Output is correct
11 Correct 598 ms 4600 KB Output is correct
12 Correct 461 ms 4784 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1108 ms 5300 KB Output is correct
2 Correct 107 ms 2212 KB Output is correct
3 Correct 97 ms 4216 KB Output is correct
4 Correct 74 ms 4216 KB Output is correct
5 Correct 924 ms 5284 KB Output is correct
6 Correct 1073 ms 5240 KB Output is correct
7 Correct 906 ms 5384 KB Output is correct
8 Correct 644 ms 4032 KB Output is correct
9 Correct 641 ms 3960 KB Output is correct
10 Correct 667 ms 4340 KB Output is correct
11 Correct 1156 ms 4700 KB Output is correct
12 Correct 988 ms 4744 KB Output is correct
13 Correct 1035 ms 4416 KB Output is correct
14 Correct 871 ms 4696 KB Output is correct
15 Correct 939 ms 4732 KB Output is correct
16 Correct 1440 ms 4600 KB Output is correct
17 Correct 1312 ms 4792 KB Output is correct
18 Correct 1249 ms 4728 KB Output is correct
19 Correct 1325 ms 4600 KB Output is correct
20 Correct 1197 ms 4600 KB Output is correct
21 Correct 1233 ms 4368 KB Output is correct
22 Correct 1206 ms 4676 KB Output is correct
23 Correct 1027 ms 4344 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 845 ms 5692 KB Output is correct
2 Correct 877 ms 5596 KB Output is correct
3 Correct 883 ms 5624 KB Output is correct
4 Correct 864 ms 5824 KB Output is correct
5 Correct 828 ms 5712 KB Output is correct
6 Correct 1028 ms 4856 KB Output is correct
7 Correct 974 ms 4856 KB Output is correct
8 Correct 955 ms 4912 KB Output is correct
9 Correct 108 ms 2040 KB Output is correct
10 Correct 814 ms 5496 KB Output is correct
11 Correct 805 ms 5720 KB Output is correct
12 Correct 821 ms 4860 KB Output is correct
13 Correct 700 ms 4832 KB Output is correct
14 Correct 960 ms 4904 KB Output is correct
15 Correct 468 ms 3076 KB Output is correct
16 Correct 809 ms 4836 KB Output is correct
17 Correct 739 ms 4788 KB Output is correct
18 Correct 112 ms 2384 KB Output is correct
19 Correct 771 ms 4588 KB Output is correct
20 Correct 704 ms 4516 KB Output is correct
21 Correct 663 ms 4728 KB Output is correct
22 Correct 661 ms 4432 KB Output is correct
23 Correct 509 ms 4392 KB Output is correct
24 Correct 598 ms 4600 KB Output is correct
25 Correct 461 ms 4784 KB Output is correct
26 Correct 958 ms 5052 KB Output is correct
27 Correct 1056 ms 5132 KB Output is correct
28 Correct 964 ms 5048 KB Output is correct
29 Correct 798 ms 5020 KB Output is correct
30 Correct 1037 ms 5136 KB Output is correct
31 Correct 1090 ms 5056 KB Output is correct
32 Correct 1092 ms 5792 KB Output is correct
33 Correct 960 ms 5572 KB Output is correct
34 Correct 961 ms 5624 KB Output is correct
35 Correct 969 ms 5556 KB Output is correct
36 Correct 845 ms 5496 KB Output is correct
37 Correct 849 ms 5496 KB Output is correct
38 Correct 840 ms 5436 KB Output is correct
39 Correct 740 ms 5000 KB Output is correct
40 Correct 728 ms 4972 KB Output is correct
41 Correct 751 ms 4924 KB Output is correct
42 Correct 632 ms 5624 KB Output is correct
43 Correct 628 ms 5540 KB Output is correct
44 Correct 623 ms 5712 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1664 KB Output is correct
2 Correct 3 ms 1536 KB Output is correct
3 Correct 26 ms 1792 KB Output is correct
4 Correct 13 ms 1664 KB Output is correct
5 Correct 27 ms 1792 KB Output is correct
6 Correct 26 ms 1792 KB Output is correct
7 Correct 24 ms 1664 KB Output is correct
8 Correct 24 ms 1784 KB Output is correct
9 Correct 29 ms 1784 KB Output is correct
10 Correct 23 ms 1792 KB Output is correct
11 Correct 23 ms 1792 KB Output is correct
12 Correct 24 ms 1712 KB Output is correct
13 Correct 27 ms 1792 KB Output is correct
14 Correct 26 ms 1792 KB Output is correct
15 Correct 27 ms 1664 KB Output is correct
16 Correct 25 ms 1664 KB Output is correct
17 Correct 24 ms 1792 KB Output is correct
18 Correct 845 ms 5692 KB Output is correct
19 Correct 877 ms 5596 KB Output is correct
20 Correct 883 ms 5624 KB Output is correct
21 Correct 864 ms 5824 KB Output is correct
22 Correct 828 ms 5712 KB Output is correct
23 Correct 1028 ms 4856 KB Output is correct
24 Correct 974 ms 4856 KB Output is correct
25 Correct 955 ms 4912 KB Output is correct
26 Correct 108 ms 2040 KB Output is correct
27 Correct 814 ms 5496 KB Output is correct
28 Correct 805 ms 5720 KB Output is correct
29 Correct 821 ms 4860 KB Output is correct
30 Correct 700 ms 4832 KB Output is correct
31 Correct 960 ms 4904 KB Output is correct
32 Correct 468 ms 3076 KB Output is correct
33 Correct 809 ms 4836 KB Output is correct
34 Correct 739 ms 4788 KB Output is correct
35 Correct 112 ms 2384 KB Output is correct
36 Correct 771 ms 4588 KB Output is correct
37 Correct 704 ms 4516 KB Output is correct
38 Correct 663 ms 4728 KB Output is correct
39 Correct 661 ms 4432 KB Output is correct
40 Correct 509 ms 4392 KB Output is correct
41 Correct 598 ms 4600 KB Output is correct
42 Correct 461 ms 4784 KB Output is correct
43 Correct 1108 ms 5300 KB Output is correct
44 Correct 107 ms 2212 KB Output is correct
45 Correct 97 ms 4216 KB Output is correct
46 Correct 74 ms 4216 KB Output is correct
47 Correct 924 ms 5284 KB Output is correct
48 Correct 1073 ms 5240 KB Output is correct
49 Correct 906 ms 5384 KB Output is correct
50 Correct 644 ms 4032 KB Output is correct
51 Correct 641 ms 3960 KB Output is correct
52 Correct 667 ms 4340 KB Output is correct
53 Correct 1156 ms 4700 KB Output is correct
54 Correct 988 ms 4744 KB Output is correct
55 Correct 1035 ms 4416 KB Output is correct
56 Correct 871 ms 4696 KB Output is correct
57 Correct 939 ms 4732 KB Output is correct
58 Correct 1440 ms 4600 KB Output is correct
59 Correct 1312 ms 4792 KB Output is correct
60 Correct 1249 ms 4728 KB Output is correct
61 Correct 1325 ms 4600 KB Output is correct
62 Correct 1197 ms 4600 KB Output is correct
63 Correct 1233 ms 4368 KB Output is correct
64 Correct 1206 ms 4676 KB Output is correct
65 Correct 1027 ms 4344 KB Output is correct
66 Correct 958 ms 5052 KB Output is correct
67 Correct 1056 ms 5132 KB Output is correct
68 Correct 964 ms 5048 KB Output is correct
69 Correct 798 ms 5020 KB Output is correct
70 Correct 1037 ms 5136 KB Output is correct
71 Correct 1090 ms 5056 KB Output is correct
72 Correct 1092 ms 5792 KB Output is correct
73 Correct 960 ms 5572 KB Output is correct
74 Correct 961 ms 5624 KB Output is correct
75 Correct 969 ms 5556 KB Output is correct
76 Correct 845 ms 5496 KB Output is correct
77 Correct 849 ms 5496 KB Output is correct
78 Correct 840 ms 5436 KB Output is correct
79 Correct 740 ms 5000 KB Output is correct
80 Correct 728 ms 4972 KB Output is correct
81 Correct 751 ms 4924 KB Output is correct
82 Correct 632 ms 5624 KB Output is correct
83 Correct 628 ms 5540 KB Output is correct
84 Correct 623 ms 5712 KB Output is correct
85 Correct 1671 ms 6708 KB Output is correct
86 Correct 127 ms 4984 KB Output is correct
87 Correct 97 ms 4984 KB Output is correct
88 Correct 1389 ms 6668 KB Output is correct
89 Correct 1693 ms 6804 KB Output is correct
90 Correct 1209 ms 6152 KB Output is correct
91 Correct 1073 ms 5624 KB Output is correct
92 Correct 1025 ms 5592 KB Output is correct
93 Correct 1089 ms 4668 KB Output is correct
94 Correct 1555 ms 6020 KB Output is correct
95 Correct 1477 ms 6164 KB Output is correct
96 Correct 1522 ms 5112 KB Output is correct
97 Correct 1090 ms 5552 KB Output is correct
98 Correct 1069 ms 5812 KB Output is correct
99 Correct 1701 ms 6484 KB Output is correct
100 Correct 1654 ms 6520 KB Output is correct
101 Correct 1660 ms 6560 KB Output is correct
102 Correct 1730 ms 6712 KB Output is correct
103 Correct 1653 ms 5092 KB Output is correct
104 Correct 1566 ms 4956 KB Output is correct
105 Correct 1358 ms 5076 KB Output is correct
106 Correct 1108 ms 5112 KB Output is correct
107 Correct 1410 ms 5196 KB Output is correct
108 Correct 1699 ms 5348 KB Output is correct
109 Correct 1409 ms 4884 KB Output is correct