oj.uz

Submission #166598

# Submission time Handle Problem Language Result Execution time Memory
166598 2019-12-03T01:48:19 Z Feeder Bridges (APIO19_bridges) C++11
100 / 100
 2978 ms 9948 KB 
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;

int par[50001], sz[50001], rnk[50001];

int findp(int x){
	return x == par[x] ? x : findp(par[x]);
}

void merge(int x, int y){
	x = findp(x), y = findp(y);
	if(x == y) return;
	if(rnk[x] < rnk[y]) swap(x, y);
	par[y] = x;
	if(rnk[x] == rnk[y]) rnk[x]++;
	sz[x] += sz[y];
}

int edgea[100001], edgeb[100001], ans[100001];
vector<tuple<int, int> > edgelist;
vector<tuple<int, int, int> > uvec; // query, bridge, weight
vector<tuple<int, int, int> > qvec; // weight, query, island
int cbridges[100001];

void findans(int qnum){
	vector<tuple<int, int, int> > st;
	vector<int> vec;
	int qw, qi, qq;
	tie(qw, qq, qi) = qvec[qnum];
	int aa, bb, ww;
	for(int i=int(uvec.size())-1; i>=0; i--){
		if(get<0>(uvec[i]) > qq) continue;
		int bnum = get<1>(uvec[i]);
		ww = get<2>(uvec[i]);
		if(cbridges[bnum] == 2) continue;
		cbridges[bnum] = 2;
		vec.push_back(bnum);
		if(ww < qw) continue;
		aa = edgea[bnum], bb = edgeb[bnum];
		aa = findp(aa), bb = findp(bb);
		if(aa == bb) continue;
		if(rnk[aa] < rnk[bb]) swap(aa, bb);
		if(rnk[aa] == rnk[bb]){
			st.emplace_back(aa, bb, sz[aa]);
			rnk[aa]++;
		}
		else st.emplace_back(aa, bb, -sz[aa]);
		par[bb] = aa;
		sz[aa] += sz[bb];
	}
	for(auto i:vec) cbridges[i] = 1;
	ans[qq] = sz[findp(qi)];
	for(int i=int(st.size())-1; i>=0; i--){
		tie(aa, bb, ww) = st[i];
		if(ww > 0) rnk[aa]--;
		else ww = -ww;
		par[bb] = bb;
		sz[aa] = ww;
	}
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m, a, b, w, q, qcnt, warr[100001], rt = 200;
	cin >> n >> m;
	for(int i=1; i<=m; i++){
		cin >> edgea[i] >> edgeb[i] >> warr[i];
		edgelist.emplace_back(-warr[i], i);
	}
	sort(edgelist.begin(), edgelist.end());
	
	cin >> q;
	int tarr[100001], aarr[100001], barr[100001], curq = 0;
	for(int i=0; i<q; i++) cin >> tarr[i] >> aarr[i] >> barr[i];
	for(int i=0; i<q; i++){
		a = aarr[i], b = barr[i];
		if(tarr[i] == 1){
			uvec.emplace_back(i, a, b);
			if(!cbridges[a]){
				cbridges[a] = 1;
				uvec.emplace_back(-1, a, warr[a]);
			}
			curq += 1;
		}
		else qvec.emplace_back(b, i, a);
		if(curq != rt - 1 && i != q - 1) continue;
		curq = 0;
		
		qcnt = int(qvec.size()) - 1;
		sort(qvec.begin(), qvec.end());
		sort(uvec.begin(), uvec.end());
		for(int j=1; j<=n; j++) par[j] = j;
		fill(sz + 1, sz + n + 1, 1);
		fill(rnk + 1, rnk + n + 1, 0);
		for(auto it:edgelist){
			tie(w, a) = it;
			w = -w;
			while(qcnt >= 0 && get<0>(qvec[qcnt]) > w) findans(qcnt--);
			if(cbridges[a]) continue;
			merge(edgea[a], edgeb[a]);
		}
		while(qcnt >= 0) findans(qcnt--);
		vector<tuple<int, int> > vec;
		vector<tuple<int, int> > newvec(edgelist);
		edgelist.clear();
		for(int j=int(uvec.size())-1; j>=0; j--){
			tie(qcnt, b, w) = uvec[j];
			if(qcnt < 0) break;
			if(cbridges[b] == 2) continue;
			vec.emplace_back(-w, b);
			warr[b] = w;
			cbridges[b] = 2;
		}
		sort(vec.begin(), vec.end());
		int cnt1 = 0, cnt2 = 0;
		while(cnt1 < newvec.size() || cnt2 < vec.size()){
			if(cnt1 == newvec.size()) edgelist.push_back(vec[cnt2++]);
			else if(cnt2 == vec.size()){
				if(cbridges[get<1>(newvec[cnt1])] != 2) edgelist.push_back(newvec[cnt1++]);
				else cnt1++;
			}
			else if(get<0>(newvec[cnt1]) < get<0>(vec[cnt2])){
				if(cbridges[get<1>(newvec[cnt1])] != 2) edgelist.push_back(newvec[cnt1++]);
				else cnt1++;
			}
			else edgelist.push_back(vec[cnt2++]);
		}
		
		for(int j=int(uvec.size())-1; j>=0; j--){
			tie(qcnt, b, w) = uvec[j];
			if(qcnt < 0) break;
			if(cbridges[b] == 2) cbridges[b] = 0;
		}
		uvec.clear();
		qvec.clear();
	}
	for(int i=0; i<q; i++){
		if(ans[i]) cout << ans[i] << '\n';
	}
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:117:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(cnt1 < newvec.size() || cnt2 < vec.size()){
         ~~~~~^~~~~~~~~~~~~~~
bridges.cpp:117:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(cnt1 < newvec.size() || cnt2 < vec.size()){
                                 ~~~~~^~~~~~~~~~~~
bridges.cpp:118:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(cnt1 == newvec.size()) edgelist.push_back(vec[cnt2++]);
       ~~~~~^~~~~~~~~~~~~~~~
bridges.cpp:119:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    else if(cnt2 == vec.size()){
            ~~~~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 34 ms 636 KB Output is correct
4 Correct 7 ms 824 KB Output is correct
5 Correct 24 ms 632 KB Output is correct
6 Correct 21 ms 636 KB Output is correct
7 Correct 27 ms 632 KB Output is correct
8 Correct 28 ms 632 KB Output is correct
9 Correct 28 ms 632 KB Output is correct
10 Correct 29 ms 504 KB Output is correct
11 Correct 29 ms 632 KB Output is correct
12 Correct 31 ms 632 KB Output is correct
13 Correct 40 ms 600 KB Output is correct
14 Correct 34 ms 596 KB Output is correct
15 Correct 30 ms 632 KB Output is correct
16 Correct 28 ms 632 KB Output is correct
17 Correct 28 ms 632 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1533 ms 4372 KB Output is correct
2 Correct 1533 ms 4276 KB Output is correct
3 Correct 1485 ms 4344 KB Output is correct
4 Correct 1520 ms 4376 KB Output is correct
5 Correct 1504 ms 4336 KB Output is correct
6 Correct 1835 ms 4468 KB Output is correct
7 Correct 1824 ms 4616 KB Output is correct
8 Correct 1826 ms 4568 KB Output is correct
9 Correct 54 ms 4844 KB Output is correct
10 Correct 1098 ms 6056 KB Output is correct
11 Correct 1093 ms 5256 KB Output is correct
12 Correct 1924 ms 6968 KB Output is correct
13 Correct 1677 ms 6208 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1110 ms 4276 KB Output is correct
2 Correct 619 ms 4372 KB Output is correct
3 Correct 1139 ms 5932 KB Output is correct
4 Correct 1103 ms 4608 KB Output is correct
5 Correct 54 ms 4716 KB Output is correct
6 Correct 1117 ms 5696 KB Output is correct
7 Correct 1018 ms 5996 KB Output is correct
8 Correct 1233 ms 5668 KB Output is correct
9 Correct 1095 ms 5828 KB Output is correct
10 Correct 913 ms 5944 KB Output is correct
11 Correct 1051 ms 5656 KB Output is correct
12 Correct 1061 ms 5508 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 7652 KB Output is correct
2 Correct 72 ms 3868 KB Output is correct
3 Correct 59 ms 4460 KB Output is correct
4 Correct 55 ms 4592 KB Output is correct
5 Correct 97 ms 7908 KB Output is correct
6 Correct 113 ms 7780 KB Output is correct
7 Correct 97 ms 7788 KB Output is correct
8 Correct 88 ms 6200 KB Output is correct
9 Correct 86 ms 6252 KB Output is correct
10 Correct 87 ms 6444 KB Output is correct
11 Correct 100 ms 7116 KB Output is correct
12 Correct 99 ms 7148 KB Output is correct
13 Correct 99 ms 7368 KB Output is correct
14 Correct 92 ms 7924 KB Output is correct
15 Correct 98 ms 7780 KB Output is correct
16 Correct 117 ms 7788 KB Output is correct
17 Correct 115 ms 7780 KB Output is correct
18 Correct 115 ms 7652 KB Output is correct
19 Correct 143 ms 7700 KB Output is correct
20 Correct 105 ms 7572 KB Output is correct
21 Correct 110 ms 7704 KB Output is correct
22 Correct 116 ms 7972 KB Output is correct
23 Correct 108 ms 7464 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1533 ms 4372 KB Output is correct
2 Correct 1533 ms 4276 KB Output is correct
3 Correct 1485 ms 4344 KB Output is correct
4 Correct 1520 ms 4376 KB Output is correct
5 Correct 1504 ms 4336 KB Output is correct
6 Correct 1835 ms 4468 KB Output is correct
7 Correct 1824 ms 4616 KB Output is correct
8 Correct 1826 ms 4568 KB Output is correct
9 Correct 54 ms 4844 KB Output is correct
10 Correct 1098 ms 6056 KB Output is correct
11 Correct 1093 ms 5256 KB Output is correct
12 Correct 1924 ms 6968 KB Output is correct
13 Correct 1677 ms 6208 KB Output is correct
14 Correct 1110 ms 4276 KB Output is correct
15 Correct 619 ms 4372 KB Output is correct
16 Correct 1139 ms 5932 KB Output is correct
17 Correct 1103 ms 4608 KB Output is correct
18 Correct 54 ms 4716 KB Output is correct
19 Correct 1117 ms 5696 KB Output is correct
20 Correct 1018 ms 5996 KB Output is correct
21 Correct 1233 ms 5668 KB Output is correct
22 Correct 1095 ms 5828 KB Output is correct
23 Correct 913 ms 5944 KB Output is correct
24 Correct 1051 ms 5656 KB Output is correct
25 Correct 1061 ms 5508 KB Output is correct
26 Correct 1531 ms 7152 KB Output is correct
27 Correct 1824 ms 6956 KB Output is correct
28 Correct 1757 ms 7136 KB Output is correct
29 Correct 1429 ms 7012 KB Output is correct
30 Correct 1822 ms 5488 KB Output is correct
31 Correct 1837 ms 5188 KB Output is correct
32 Correct 1869 ms 6488 KB Output is correct
33 Correct 1685 ms 7192 KB Output is correct
34 Correct 1735 ms 7132 KB Output is correct
35 Correct 1722 ms 6188 KB Output is correct
36 Correct 1484 ms 6924 KB Output is correct
37 Correct 1431 ms 7024 KB Output is correct
38 Correct 1483 ms 7008 KB Output is correct
39 Correct 898 ms 7392 KB Output is correct
40 Correct 908 ms 6728 KB Output is correct
41 Correct 860 ms 7276 KB Output is correct
42 Correct 1944 ms 6916 KB Output is correct
43 Correct 1917 ms 6964 KB Output is correct
44 Correct 2120 ms 6904 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 34 ms 636 KB Output is correct
4 Correct 7 ms 824 KB Output is correct
5 Correct 24 ms 632 KB Output is correct
6 Correct 21 ms 636 KB Output is correct
7 Correct 27 ms 632 KB Output is correct
8 Correct 28 ms 632 KB Output is correct
9 Correct 28 ms 632 KB Output is correct
10 Correct 29 ms 504 KB Output is correct
11 Correct 29 ms 632 KB Output is correct
12 Correct 31 ms 632 KB Output is correct
13 Correct 40 ms 600 KB Output is correct
14 Correct 34 ms 596 KB Output is correct
15 Correct 30 ms 632 KB Output is correct
16 Correct 28 ms 632 KB Output is correct
17 Correct 28 ms 632 KB Output is correct
18 Correct 1533 ms 4372 KB Output is correct
19 Correct 1533 ms 4276 KB Output is correct
20 Correct 1485 ms 4344 KB Output is correct
21 Correct 1520 ms 4376 KB Output is correct
22 Correct 1504 ms 4336 KB Output is correct
23 Correct 1835 ms 4468 KB Output is correct
24 Correct 1824 ms 4616 KB Output is correct
25 Correct 1826 ms 4568 KB Output is correct
26 Correct 54 ms 4844 KB Output is correct
27 Correct 1098 ms 6056 KB Output is correct
28 Correct 1093 ms 5256 KB Output is correct
29 Correct 1924 ms 6968 KB Output is correct
30 Correct 1677 ms 6208 KB Output is correct
31 Correct 1110 ms 4276 KB Output is correct
32 Correct 619 ms 4372 KB Output is correct
33 Correct 1139 ms 5932 KB Output is correct
34 Correct 1103 ms 4608 KB Output is correct
35 Correct 54 ms 4716 KB Output is correct
36 Correct 1117 ms 5696 KB Output is correct
37 Correct 1018 ms 5996 KB Output is correct
38 Correct 1233 ms 5668 KB Output is correct
39 Correct 1095 ms 5828 KB Output is correct
40 Correct 913 ms 5944 KB Output is correct
41 Correct 1051 ms 5656 KB Output is correct
42 Correct 1061 ms 5508 KB Output is correct
43 Correct 118 ms 7652 KB Output is correct
44 Correct 72 ms 3868 KB Output is correct
45 Correct 59 ms 4460 KB Output is correct
46 Correct 55 ms 4592 KB Output is correct
47 Correct 97 ms 7908 KB Output is correct
48 Correct 113 ms 7780 KB Output is correct
49 Correct 97 ms 7788 KB Output is correct
50 Correct 88 ms 6200 KB Output is correct
51 Correct 86 ms 6252 KB Output is correct
52 Correct 87 ms 6444 KB Output is correct
53 Correct 100 ms 7116 KB Output is correct
54 Correct 99 ms 7148 KB Output is correct
55 Correct 99 ms 7368 KB Output is correct
56 Correct 92 ms 7924 KB Output is correct
57 Correct 98 ms 7780 KB Output is correct
58 Correct 117 ms 7788 KB Output is correct
59 Correct 115 ms 7780 KB Output is correct
60 Correct 115 ms 7652 KB Output is correct
61 Correct 143 ms 7700 KB Output is correct
62 Correct 105 ms 7572 KB Output is correct
63 Correct 110 ms 7704 KB Output is correct
64 Correct 116 ms 7972 KB Output is correct
65 Correct 108 ms 7464 KB Output is correct
66 Correct 1531 ms 7152 KB Output is correct
67 Correct 1824 ms 6956 KB Output is correct
68 Correct 1757 ms 7136 KB Output is correct
69 Correct 1429 ms 7012 KB Output is correct
70 Correct 1822 ms 5488 KB Output is correct
71 Correct 1837 ms 5188 KB Output is correct
72 Correct 1869 ms 6488 KB Output is correct
73 Correct 1685 ms 7192 KB Output is correct
74 Correct 1735 ms 7132 KB Output is correct
75 Correct 1722 ms 6188 KB Output is correct
76 Correct 1484 ms 6924 KB Output is correct
77 Correct 1431 ms 7024 KB Output is correct
78 Correct 1483 ms 7008 KB Output is correct
79 Correct 898 ms 7392 KB Output is correct
80 Correct 908 ms 6728 KB Output is correct
81 Correct 860 ms 7276 KB Output is correct
82 Correct 1944 ms 6916 KB Output is correct
83 Correct 1917 ms 6964 KB Output is correct
84 Correct 2120 ms 6904 KB Output is correct
85 Correct 2489 ms 9880 KB Output is correct
86 Correct 202 ms 5596 KB Output is correct
87 Correct 167 ms 5728 KB Output is correct
88 Correct 2020 ms 8464 KB Output is correct
89 Correct 2506 ms 9832 KB Output is correct
90 Correct 1986 ms 8148 KB Output is correct
91 Correct 1685 ms 7040 KB Output is correct
92 Correct 1696 ms 7136 KB Output is correct
93 Correct 2028 ms 7100 KB Output is correct
94 Correct 2127 ms 8412 KB Output is correct
95 Correct 2110 ms 8476 KB Output is correct
96 Correct 2071 ms 8348 KB Output is correct
97 Correct 920 ms 8408 KB Output is correct
98 Correct 2904 ms 8072 KB Output is correct
99 Correct 2514 ms 9828 KB Output is correct
100 Correct 2560 ms 9948 KB Output is correct
101 Correct 2624 ms 9884 KB Output is correct
102 Correct 2564 ms 9920 KB Output is correct
103 Correct 2204 ms 8820 KB Output is correct
104 Correct 2259 ms 8604 KB Output is correct
105 Correct 2978 ms 8624 KB Output is correct
106 Correct 2744 ms 8336 KB Output is correct
107 Correct 1693 ms 8992 KB Output is correct
108 Correct 2407 ms 9248 KB Output is correct
109 Correct 1986 ms 7548 KB Output is correct