oj.uz

Submission #389881

# Submission time Handle Problem Language Result Execution time Memory
389881 2021-04-14T18:59:31 Z Blagojce Bridges (APIO19_bridges) C++11
100 / 100
 2968 ms 25584 KB 
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)


using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int i_inf = 1e9;
const ll inf = 4e9;
const ll mod = 1e9+7;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;

mt19937 _rand(time(NULL));
clock_t z;

const int mxn = 1e5;
const int bsz = 800;

int n, m, q;

int t[mxn], a[mxn], b[mxn];

int l[mxn], r[mxn], w[mxn];


int neww[mxn];
bool nonstat[mxn];


int link[mxn];
int siz[mxn];
int findx(int x){
	if(x == link[x]) return x;
	link[x] = findx(link[x]);
	return link[x];
}
void unite(int u, int v){
	u = findx(u);
	v = findx(v);
	
	if(u == v) return;
	
	if(siz[u] < siz[v]) swap(u, v);
	link[v] = u;
	siz[u] += siz[v];
}


vector<int> G[mxn];
bool vis[mxn];

int dfs(int u){
	vis[u] = true;
	int ret = siz[u];
	
	for(auto e : G[u]){
		if(!vis[e]){
			ret += dfs(e);
		}
	}
	return ret;
}

int ans[mxn];


void compress(){
	vector<pair<int,int> > v;
	fr(i, 0, m){
		v.pb({w[i], (i+1)});
	}
	fr(i, 0, q){
		v.pb({b[i], -i});
	}
	sort(all(v));
	
	int pr = -1;
	int val= -1;
	
	for(auto u : v){
		if(u.st != pr) ++val;
		if(u.nd > 0){
			w[u.nd-1] = val;
		}
		else{
			b[-u.nd] = val;
		}
		pr = u.st;
	}
}
vector<pair<int,int> > SOS[3*mxn];


void solve(){
	cin >> n >> m;
	fr(i, 0, m){
		cin >> l[i] >> r[i] >> w[i];
		--l[i];
		--r[i];
	}
	cin >> q;
	fr(i, 0, q){
		cin >> t[i] >> a[i] >> b[i];
		--a[i];
	}

	


	compress();
	
		
	vector<pair<int,int> > g;
	vector<int> v;
	
	fr(bi, 0, (q+bsz-1)/bsz){
		
		memset(nonstat, false, sizeof(nonstat));
		v.clear();
		g.clear();
		
		fr(i, 0, n){
			link[i] = i;
			siz[i] = 1;
		}
		
		
		fr(i, bi*bsz, min(q, (bi+1)*bsz)){
			if(t[i] == 1){
				nonstat[a[i]] = true;
			}
			else{
				SOS[b[i]].pb({1, i});
			}
		}
		fr(i, 0, m){
			if(!nonstat[i]){
				SOS[w[i]].pb({0, i});
			}
			else{
				v.pb(i);
			}
		}
		
		for(int i = q+m; i >= 0; i --){
			
			while(!SOS[i].empty()){
				g.pb(SOS[i].back());
				SOS[i].pop_back();
			}
			
		}
		
		
		
		
		//sort(all(g));
		for(auto u : g){
			if(u.st == 0){
				unite(l[u.nd], r[u.nd]);
			}
			else{
				for(auto edge : v) neww[edge] = -1;
				
				int pos = u.nd;

				fr(i, bi*bsz, min(q, (bi+1)*bsz)){
					if(t[i] != 1) continue;
					if(i < pos){
						neww[a[i]] = b[i];
					}
					else if(neww[a[i]] == -1){
						neww[a[i]] = w[a[i]];
					}
				}
				for(auto edge : v){
					if(neww[edge] >= b[pos]){
						int A = findx(l[edge]);
						int B = findx(r[edge]);
						vis[A] = vis[B] = false;
						
						G[A].pb(B);
						G[B].pb(A);
					}
				}
				
				ans[pos] = dfs(findx(a[pos]));
				
				for(auto edge : v){
					if(neww[edge] >= b[pos]){
						int A = findx(l[edge]);
						int B = findx(r[edge]);
						G[A].pop_back();
						G[B].pop_back();
					}
				}
			}
		}
		fr(i, bi*bsz, min(q, (bi+1)*bsz)){
			if(t[i] == 1){
				w[a[i]] = b[i];
			}
		}
	}
	fr(i, 0, q){
		if(t[i] == 2){
			cout<<ans[i]<<endl;
		}
	}
}


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	solve();	
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9804 KB Output is correct
2 Correct 5 ms 9804 KB Output is correct
3 Correct 76 ms 10332 KB Output is correct
4 Correct 30 ms 10336 KB Output is correct
5 Correct 40 ms 10144 KB Output is correct
6 Correct 36 ms 10140 KB Output is correct
7 Correct 45 ms 10140 KB Output is correct
8 Correct 39 ms 10152 KB Output is correct
9 Correct 44 ms 10148 KB Output is correct
10 Correct 38 ms 10124 KB Output is correct
11 Correct 45 ms 10236 KB Output is correct
12 Correct 40 ms 10132 KB Output is correct
13 Correct 46 ms 10136 KB Output is correct
14 Correct 44 ms 10168 KB Output is correct
15 Correct 43 ms 10108 KB Output is correct
16 Correct 40 ms 10136 KB Output is correct
17 Correct 44 ms 10156 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1981 ms 19104 KB Output is correct
2 Correct 2025 ms 19004 KB Output is correct
3 Correct 1956 ms 19008 KB Output is correct
4 Correct 1987 ms 19012 KB Output is correct
5 Correct 1939 ms 19088 KB Output is correct
6 Correct 2795 ms 17624 KB Output is correct
7 Correct 2663 ms 17868 KB Output is correct
8 Correct 2517 ms 18132 KB Output is correct
9 Correct 258 ms 14684 KB Output is correct
10 Correct 1783 ms 15080 KB Output is correct
11 Correct 1647 ms 15236 KB Output is correct
12 Correct 1520 ms 17752 KB Output is correct
13 Correct 1648 ms 18328 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1612 ms 17544 KB Output is correct
2 Correct 1288 ms 14752 KB Output is correct
3 Correct 1937 ms 16980 KB Output is correct
4 Correct 1676 ms 17608 KB Output is correct
5 Correct 266 ms 14676 KB Output is correct
6 Correct 1890 ms 17680 KB Output is correct
7 Correct 1529 ms 17716 KB Output is correct
8 Correct 1347 ms 17484 KB Output is correct
9 Correct 1129 ms 17380 KB Output is correct
10 Correct 1027 ms 17148 KB Output is correct
11 Correct 1079 ms 17428 KB Output is correct
12 Correct 964 ms 17564 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2099 ms 20460 KB Output is correct
2 Correct 323 ms 14592 KB Output is correct
3 Correct 191 ms 16096 KB Output is correct
4 Correct 113 ms 14244 KB Output is correct
5 Correct 897 ms 16320 KB Output is correct
6 Correct 1891 ms 20372 KB Output is correct
7 Correct 848 ms 16268 KB Output is correct
8 Correct 1042 ms 17680 KB Output is correct
9 Correct 1155 ms 17704 KB Output is correct
10 Correct 853 ms 17736 KB Output is correct
11 Correct 1548 ms 18980 KB Output is correct
12 Correct 1597 ms 18972 KB Output is correct
13 Correct 1431 ms 19216 KB Output is correct
14 Correct 884 ms 16608 KB Output is correct
15 Correct 909 ms 16344 KB Output is correct
16 Correct 2041 ms 20320 KB Output is correct
17 Correct 2099 ms 20372 KB Output is correct
18 Correct 2112 ms 20468 KB Output is correct
19 Correct 2005 ms 20384 KB Output is correct
20 Correct 1448 ms 19752 KB Output is correct
21 Correct 1469 ms 19572 KB Output is correct
22 Correct 1754 ms 20336 KB Output is correct
23 Correct 1000 ms 15904 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1981 ms 19104 KB Output is correct
2 Correct 2025 ms 19004 KB Output is correct
3 Correct 1956 ms 19008 KB Output is correct
4 Correct 1987 ms 19012 KB Output is correct
5 Correct 1939 ms 19088 KB Output is correct
6 Correct 2795 ms 17624 KB Output is correct
7 Correct 2663 ms 17868 KB Output is correct
8 Correct 2517 ms 18132 KB Output is correct
9 Correct 258 ms 14684 KB Output is correct
10 Correct 1783 ms 15080 KB Output is correct
11 Correct 1647 ms 15236 KB Output is correct
12 Correct 1520 ms 17752 KB Output is correct
13 Correct 1648 ms 18328 KB Output is correct
14 Correct 1612 ms 17544 KB Output is correct
15 Correct 1288 ms 14752 KB Output is correct
16 Correct 1937 ms 16980 KB Output is correct
17 Correct 1676 ms 17608 KB Output is correct
18 Correct 266 ms 14676 KB Output is correct
19 Correct 1890 ms 17680 KB Output is correct
20 Correct 1529 ms 17716 KB Output is correct
21 Correct 1347 ms 17484 KB Output is correct
22 Correct 1129 ms 17380 KB Output is correct
23 Correct 1027 ms 17148 KB Output is correct
24 Correct 1079 ms 17428 KB Output is correct
25 Correct 964 ms 17564 KB Output is correct
26 Correct 2089 ms 19092 KB Output is correct
27 Correct 2561 ms 18244 KB Output is correct
28 Correct 2194 ms 19056 KB Output is correct
29 Correct 1520 ms 19100 KB Output is correct
30 Correct 2609 ms 18732 KB Output is correct
31 Correct 2550 ms 18584 KB Output is correct
32 Correct 2520 ms 18628 KB Output is correct
33 Correct 2122 ms 19264 KB Output is correct
34 Correct 2140 ms 19220 KB Output is correct
35 Correct 2135 ms 18980 KB Output is correct
36 Correct 1573 ms 18968 KB Output is correct
37 Correct 1599 ms 19400 KB Output is correct
38 Correct 1539 ms 18992 KB Output is correct
39 Correct 1164 ms 18596 KB Output is correct
40 Correct 1163 ms 18524 KB Output is correct
41 Correct 1153 ms 18400 KB Output is correct
42 Correct 1186 ms 19068 KB Output is correct
43 Correct 1160 ms 19164 KB Output is correct
44 Correct 1139 ms 19068 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9804 KB Output is correct
2 Correct 5 ms 9804 KB Output is correct
3 Correct 76 ms 10332 KB Output is correct
4 Correct 30 ms 10336 KB Output is correct
5 Correct 40 ms 10144 KB Output is correct
6 Correct 36 ms 10140 KB Output is correct
7 Correct 45 ms 10140 KB Output is correct
8 Correct 39 ms 10152 KB Output is correct
9 Correct 44 ms 10148 KB Output is correct
10 Correct 38 ms 10124 KB Output is correct
11 Correct 45 ms 10236 KB Output is correct
12 Correct 40 ms 10132 KB Output is correct
13 Correct 46 ms 10136 KB Output is correct
14 Correct 44 ms 10168 KB Output is correct
15 Correct 43 ms 10108 KB Output is correct
16 Correct 40 ms 10136 KB Output is correct
17 Correct 44 ms 10156 KB Output is correct
18 Correct 1981 ms 19104 KB Output is correct
19 Correct 2025 ms 19004 KB Output is correct
20 Correct 1956 ms 19008 KB Output is correct
21 Correct 1987 ms 19012 KB Output is correct
22 Correct 1939 ms 19088 KB Output is correct
23 Correct 2795 ms 17624 KB Output is correct
24 Correct 2663 ms 17868 KB Output is correct
25 Correct 2517 ms 18132 KB Output is correct
26 Correct 258 ms 14684 KB Output is correct
27 Correct 1783 ms 15080 KB Output is correct
28 Correct 1647 ms 15236 KB Output is correct
29 Correct 1520 ms 17752 KB Output is correct
30 Correct 1648 ms 18328 KB Output is correct
31 Correct 1612 ms 17544 KB Output is correct
32 Correct 1288 ms 14752 KB Output is correct
33 Correct 1937 ms 16980 KB Output is correct
34 Correct 1676 ms 17608 KB Output is correct
35 Correct 266 ms 14676 KB Output is correct
36 Correct 1890 ms 17680 KB Output is correct
37 Correct 1529 ms 17716 KB Output is correct
38 Correct 1347 ms 17484 KB Output is correct
39 Correct 1129 ms 17380 KB Output is correct
40 Correct 1027 ms 17148 KB Output is correct
41 Correct 1079 ms 17428 KB Output is correct
42 Correct 964 ms 17564 KB Output is correct
43 Correct 2099 ms 20460 KB Output is correct
44 Correct 323 ms 14592 KB Output is correct
45 Correct 191 ms 16096 KB Output is correct
46 Correct 113 ms 14244 KB Output is correct
47 Correct 897 ms 16320 KB Output is correct
48 Correct 1891 ms 20372 KB Output is correct
49 Correct 848 ms 16268 KB Output is correct
50 Correct 1042 ms 17680 KB Output is correct
51 Correct 1155 ms 17704 KB Output is correct
52 Correct 853 ms 17736 KB Output is correct
53 Correct 1548 ms 18980 KB Output is correct
54 Correct 1597 ms 18972 KB Output is correct
55 Correct 1431 ms 19216 KB Output is correct
56 Correct 884 ms 16608 KB Output is correct
57 Correct 909 ms 16344 KB Output is correct
58 Correct 2041 ms 20320 KB Output is correct
59 Correct 2099 ms 20372 KB Output is correct
60 Correct 2112 ms 20468 KB Output is correct
61 Correct 2005 ms 20384 KB Output is correct
62 Correct 1448 ms 19752 KB Output is correct
63 Correct 1469 ms 19572 KB Output is correct
64 Correct 1754 ms 20336 KB Output is correct
65 Correct 1000 ms 15904 KB Output is correct
66 Correct 2089 ms 19092 KB Output is correct
67 Correct 2561 ms 18244 KB Output is correct
68 Correct 2194 ms 19056 KB Output is correct
69 Correct 1520 ms 19100 KB Output is correct
70 Correct 2609 ms 18732 KB Output is correct
71 Correct 2550 ms 18584 KB Output is correct
72 Correct 2520 ms 18628 KB Output is correct
73 Correct 2122 ms 19264 KB Output is correct
74 Correct 2140 ms 19220 KB Output is correct
75 Correct 2135 ms 18980 KB Output is correct
76 Correct 1573 ms 18968 KB Output is correct
77 Correct 1599 ms 19400 KB Output is correct
78 Correct 1539 ms 18992 KB Output is correct
79 Correct 1164 ms 18596 KB Output is correct
80 Correct 1163 ms 18524 KB Output is correct
81 Correct 1153 ms 18400 KB Output is correct
82 Correct 1186 ms 19068 KB Output is correct
83 Correct 1160 ms 19164 KB Output is correct
84 Correct 1139 ms 19068 KB Output is correct
85 Correct 2887 ms 21908 KB Output is correct
86 Correct 251 ms 16408 KB Output is correct
87 Correct 206 ms 14620 KB Output is correct
88 Correct 1846 ms 16844 KB Output is correct
89 Correct 2909 ms 21796 KB Output is correct
90 Correct 1849 ms 16400 KB Output is correct
91 Correct 2181 ms 19132 KB Output is correct
92 Correct 2149 ms 19148 KB Output is correct
93 Correct 2859 ms 18384 KB Output is correct
94 Correct 2552 ms 20592 KB Output is correct
95 Correct 2560 ms 20460 KB Output is correct
96 Correct 2750 ms 19752 KB Output is correct
97 Correct 1253 ms 16484 KB Output is correct
98 Correct 1143 ms 16188 KB Output is correct
99 Correct 2894 ms 21832 KB Output is correct
100 Correct 2849 ms 25444 KB Output is correct
101 Correct 2905 ms 25584 KB Output is correct
102 Correct 2931 ms 25452 KB Output is correct
103 Correct 2810 ms 23064 KB Output is correct
104 Correct 2839 ms 23296 KB Output is correct
105 Correct 2075 ms 23276 KB Output is correct
106 Correct 1665 ms 23060 KB Output is correct
107 Correct 1891 ms 23112 KB Output is correct
108 Correct 2968 ms 24268 KB Output is correct
109 Correct 2083 ms 18164 KB Output is correct