oj.uz

Submission #254683

# Submission time Handle Problem Language Result Execution time Memory
254683 2020-07-30T12:44:15 Z Mahdi_Jfri Bridges (APIO19_bridges) C++14
100 / 100
 1878 ms 16120 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define lb(a) ((a)&(-(a)))

const int maxn = 1e5 + 20;
const int sq = 1000;

int from[maxn] , to[maxn] , w[maxn];

bool has[maxn];

int e[maxn] , nw[maxn] , s[maxn] , tmpw[maxn] , ans[maxn] , type[maxn];

vector<int> edges[maxn] , query[maxn];

vector<pair<int , int> > history;

int par[maxn / 2];

int root(int v , bool compress = 1)
{
	if(compress)
		return (par[v] < 0? v : par[v] = root(par[v]));

	while(par[v] >= 0)
		v = par[v];
	return v;
}

void merge(int a , int b , bool save = 0 , bool compress = 1)
{
	a = root(a , compress) , b = root(b , compress);

	if(a == b)
	{
		if(save)
			history.pb({-1 , -1});
		return;
	}

	if(-par[a] < -par[b])
		swap(a , b);
	
	if(save)
		history.pb({par[b] , b});
	par[a] += par[b];
	par[b] = a;
}

void undo()
{
	auto tmp = history.back();
	history.pop_back();

	if(tmp.second == -1)
		return;

	int b = tmp.second;
	int a = par[b];

	par[b] = tmp.first;
	par[a] -= par[b];
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	int n , m;
	cin >> n >> m;

	vector<int> cmp;
	for(int i = 0; i < m; i++)
	{
		int a , b;
		cin >> a >> b >> w[i];
		a-- , b--;

		from[i] = a , to[i] = b;
	}

	int q;
	cin >> q;

	for(int i = 0; i < q; i++)
	{
		cin >> type[i];
		if(type[i] == 1)
		{
			cin >> e[i] >> nw[i];
			e[i]--;
		}
		else
		{
			cin >> s[i] >> nw[i];
			s[i]--;
			cmp.pb(nw[i]);
		}
	}

	sort(cmp.begin() , cmp.end());
	cmp.resize(unique(cmp.begin() , cmp.end()) - cmp.begin());

	for(int i = 0; i < m; i++)
		w[i] = upper_bound(cmp.begin() , cmp.end() , w[i]) - cmp.begin() - 1;

	for(int i = 0; i < q; i++)
		nw[i] = upper_bound(cmp.begin() , cmp.end() , nw[i]) - cmp.begin() - 1;

	for(int l = 0; l < q; l += sq)
	{
		memset(has , 0 , sizeof has);
		memset(par , -1 , sizeof par);

		int sz = min(sq , q - l);
		vector<int> tmp;
		for(int i = l; i < l + sz; i++)
		{
			if(type[i] == 1)
				has[e[i]] = 1 , tmp.pb(e[i]);
			else
				query[nw[i]].pb(i);
		}

		for(int i = 0; i < m; i++)
			if(!has[i])
				edges[w[i]].pb(i);

		sort(tmp.begin() , tmp.end());
		tmp.resize(unique(tmp.begin() , tmp.end()) - tmp.begin());

		for(int i = (int)cmp.size() - 1; i >= 0; i--)
		{
			for(auto e : edges[i])
				merge(from[e] , to[e]);

			for(auto ind : query[i])
			{
				for(auto e : tmp)
					tmpw[e] = w[e];
				for(int j = l; j < ind; j++)
					if(type[j] == 1)
						tmpw[e[j]] = nw[j];

				int sz = 0;
				for(auto e : tmp)
					if(tmpw[e] >= i)
					{
						merge(from[e] , to[e] , 1 , 0);
						sz++;
					}

				ans[ind] = -par[root(s[ind] , 0)];

				while(sz--)
					undo();
			}

			edges[i].clear();
			query[i].clear();
		}

		for(int i = l; i < l + sz; i++)
			if(type[i] == 1)
				w[e[i]] = nw[i];
	}

	for(int i = 0; i < q; i++)
		if(type[i] == 2)
			cout << ans[i] << endl;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5376 KB Output is correct
2 Correct 3 ms 5376 KB Output is correct
3 Correct 49 ms 6008 KB Output is correct
4 Correct 35 ms 6016 KB Output is correct
5 Correct 31 ms 5888 KB Output is correct
6 Correct 29 ms 5760 KB Output is correct
7 Correct 30 ms 5760 KB Output is correct
8 Correct 32 ms 5888 KB Output is correct
9 Correct 38 ms 5632 KB Output is correct
10 Correct 32 ms 5888 KB Output is correct
11 Correct 33 ms 6008 KB Output is correct
12 Correct 34 ms 5888 KB Output is correct
13 Correct 40 ms 5880 KB Output is correct
14 Correct 37 ms 5888 KB Output is correct
15 Correct 35 ms 5888 KB Output is correct
16 Correct 31 ms 5632 KB Output is correct
17 Correct 31 ms 5632 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1396 ms 11192 KB Output is correct
2 Correct 1346 ms 11232 KB Output is correct
3 Correct 1317 ms 11256 KB Output is correct
4 Correct 1343 ms 11480 KB Output is correct
5 Correct 1352 ms 11128 KB Output is correct
6 Correct 1272 ms 9748 KB Output is correct
7 Correct 1290 ms 10232 KB Output is correct
8 Correct 1306 ms 10232 KB Output is correct
9 Correct 352 ms 10740 KB Output is correct
10 Correct 1193 ms 8824 KB Output is correct
11 Correct 1110 ms 8936 KB Output is correct
12 Correct 834 ms 11564 KB Output is correct
13 Correct 578 ms 8820 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1153 ms 10744 KB Output is correct
2 Correct 889 ms 9208 KB Output is correct
3 Correct 1262 ms 9848 KB Output is correct
4 Correct 1127 ms 11004 KB Output is correct
5 Correct 361 ms 10740 KB Output is correct
6 Correct 1186 ms 10888 KB Output is correct
7 Correct 1044 ms 10836 KB Output is correct
8 Correct 924 ms 10872 KB Output is correct
9 Correct 946 ms 12148 KB Output is correct
10 Correct 859 ms 12148 KB Output is correct
11 Correct 517 ms 8696 KB Output is correct
12 Correct 471 ms 8684 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1476 ms 13912 KB Output is correct
2 Correct 357 ms 10868 KB Output is correct
3 Correct 128 ms 7928 KB Output is correct
4 Correct 93 ms 7540 KB Output is correct
5 Correct 705 ms 9716 KB Output is correct
6 Correct 1494 ms 13960 KB Output is correct
7 Correct 715 ms 9844 KB Output is correct
8 Correct 910 ms 12400 KB Output is correct
9 Correct 912 ms 12636 KB Output is correct
10 Correct 618 ms 11764 KB Output is correct
11 Correct 1316 ms 13044 KB Output is correct
12 Correct 1231 ms 13044 KB Output is correct
13 Correct 782 ms 12404 KB Output is correct
14 Correct 723 ms 9968 KB Output is correct
15 Correct 715 ms 9916 KB Output is correct
16 Correct 1544 ms 13868 KB Output is correct
17 Correct 1471 ms 14000 KB Output is correct
18 Correct 1660 ms 13940 KB Output is correct
19 Correct 1479 ms 14064 KB Output is correct
20 Correct 808 ms 12444 KB Output is correct
21 Correct 801 ms 12512 KB Output is correct
22 Correct 1072 ms 13468 KB Output is correct
23 Correct 674 ms 9708 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1396 ms 11192 KB Output is correct
2 Correct 1346 ms 11232 KB Output is correct
3 Correct 1317 ms 11256 KB Output is correct
4 Correct 1343 ms 11480 KB Output is correct
5 Correct 1352 ms 11128 KB Output is correct
6 Correct 1272 ms 9748 KB Output is correct
7 Correct 1290 ms 10232 KB Output is correct
8 Correct 1306 ms 10232 KB Output is correct
9 Correct 352 ms 10740 KB Output is correct
10 Correct 1193 ms 8824 KB Output is correct
11 Correct 1110 ms 8936 KB Output is correct
12 Correct 834 ms 11564 KB Output is correct
13 Correct 578 ms 8820 KB Output is correct
14 Correct 1153 ms 10744 KB Output is correct
15 Correct 889 ms 9208 KB Output is correct
16 Correct 1262 ms 9848 KB Output is correct
17 Correct 1127 ms 11004 KB Output is correct
18 Correct 361 ms 10740 KB Output is correct
19 Correct 1186 ms 10888 KB Output is correct
20 Correct 1044 ms 10836 KB Output is correct
21 Correct 924 ms 10872 KB Output is correct
22 Correct 946 ms 12148 KB Output is correct
23 Correct 859 ms 12148 KB Output is correct
24 Correct 517 ms 8696 KB Output is correct
25 Correct 471 ms 8684 KB Output is correct
26 Correct 1405 ms 11456 KB Output is correct
27 Correct 1612 ms 10188 KB Output is correct
28 Correct 1433 ms 11300 KB Output is correct
29 Correct 1022 ms 10876 KB Output is correct
30 Correct 1665 ms 10816 KB Output is correct
31 Correct 1696 ms 10736 KB Output is correct
32 Correct 1732 ms 10940 KB Output is correct
33 Correct 1521 ms 11480 KB Output is correct
34 Correct 1522 ms 11688 KB Output is correct
35 Correct 1557 ms 11628 KB Output is correct
36 Correct 1125 ms 11252 KB Output is correct
37 Correct 1112 ms 11416 KB Output is correct
38 Correct 1020 ms 11464 KB Output is correct
39 Correct 1006 ms 12788 KB Output is correct
40 Correct 959 ms 13068 KB Output is correct
41 Correct 1004 ms 12788 KB Output is correct
42 Correct 575 ms 9464 KB Output is correct
43 Correct 565 ms 9572 KB Output is correct
44 Correct 563 ms 9464 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5376 KB Output is correct
2 Correct 3 ms 5376 KB Output is correct
3 Correct 49 ms 6008 KB Output is correct
4 Correct 35 ms 6016 KB Output is correct
5 Correct 31 ms 5888 KB Output is correct
6 Correct 29 ms 5760 KB Output is correct
7 Correct 30 ms 5760 KB Output is correct
8 Correct 32 ms 5888 KB Output is correct
9 Correct 38 ms 5632 KB Output is correct
10 Correct 32 ms 5888 KB Output is correct
11 Correct 33 ms 6008 KB Output is correct
12 Correct 34 ms 5888 KB Output is correct
13 Correct 40 ms 5880 KB Output is correct
14 Correct 37 ms 5888 KB Output is correct
15 Correct 35 ms 5888 KB Output is correct
16 Correct 31 ms 5632 KB Output is correct
17 Correct 31 ms 5632 KB Output is correct
18 Correct 1396 ms 11192 KB Output is correct
19 Correct 1346 ms 11232 KB Output is correct
20 Correct 1317 ms 11256 KB Output is correct
21 Correct 1343 ms 11480 KB Output is correct
22 Correct 1352 ms 11128 KB Output is correct
23 Correct 1272 ms 9748 KB Output is correct
24 Correct 1290 ms 10232 KB Output is correct
25 Correct 1306 ms 10232 KB Output is correct
26 Correct 352 ms 10740 KB Output is correct
27 Correct 1193 ms 8824 KB Output is correct
28 Correct 1110 ms 8936 KB Output is correct
29 Correct 834 ms 11564 KB Output is correct
30 Correct 578 ms 8820 KB Output is correct
31 Correct 1153 ms 10744 KB Output is correct
32 Correct 889 ms 9208 KB Output is correct
33 Correct 1262 ms 9848 KB Output is correct
34 Correct 1127 ms 11004 KB Output is correct
35 Correct 361 ms 10740 KB Output is correct
36 Correct 1186 ms 10888 KB Output is correct
37 Correct 1044 ms 10836 KB Output is correct
38 Correct 924 ms 10872 KB Output is correct
39 Correct 946 ms 12148 KB Output is correct
40 Correct 859 ms 12148 KB Output is correct
41 Correct 517 ms 8696 KB Output is correct
42 Correct 471 ms 8684 KB Output is correct
43 Correct 1476 ms 13912 KB Output is correct
44 Correct 357 ms 10868 KB Output is correct
45 Correct 128 ms 7928 KB Output is correct
46 Correct 93 ms 7540 KB Output is correct
47 Correct 705 ms 9716 KB Output is correct
48 Correct 1494 ms 13960 KB Output is correct
49 Correct 715 ms 9844 KB Output is correct
50 Correct 910 ms 12400 KB Output is correct
51 Correct 912 ms 12636 KB Output is correct
52 Correct 618 ms 11764 KB Output is correct
53 Correct 1316 ms 13044 KB Output is correct
54 Correct 1231 ms 13044 KB Output is correct
55 Correct 782 ms 12404 KB Output is correct
56 Correct 723 ms 9968 KB Output is correct
57 Correct 715 ms 9916 KB Output is correct
58 Correct 1544 ms 13868 KB Output is correct
59 Correct 1471 ms 14000 KB Output is correct
60 Correct 1660 ms 13940 KB Output is correct
61 Correct 1479 ms 14064 KB Output is correct
62 Correct 808 ms 12444 KB Output is correct
63 Correct 801 ms 12512 KB Output is correct
64 Correct 1072 ms 13468 KB Output is correct
65 Correct 674 ms 9708 KB Output is correct
66 Correct 1405 ms 11456 KB Output is correct
67 Correct 1612 ms 10188 KB Output is correct
68 Correct 1433 ms 11300 KB Output is correct
69 Correct 1022 ms 10876 KB Output is correct
70 Correct 1665 ms 10816 KB Output is correct
71 Correct 1696 ms 10736 KB Output is correct
72 Correct 1732 ms 10940 KB Output is correct
73 Correct 1521 ms 11480 KB Output is correct
74 Correct 1522 ms 11688 KB Output is correct
75 Correct 1557 ms 11628 KB Output is correct
76 Correct 1125 ms 11252 KB Output is correct
77 Correct 1112 ms 11416 KB Output is correct
78 Correct 1020 ms 11464 KB Output is correct
79 Correct 1006 ms 12788 KB Output is correct
80 Correct 959 ms 13068 KB Output is correct
81 Correct 1004 ms 12788 KB Output is correct
82 Correct 575 ms 9464 KB Output is correct
83 Correct 565 ms 9572 KB Output is correct
84 Correct 563 ms 9464 KB Output is correct
85 Correct 1655 ms 12920 KB Output is correct
86 Correct 143 ms 8440 KB Output is correct
87 Correct 117 ms 8304 KB Output is correct
88 Correct 1087 ms 10616 KB Output is correct
89 Correct 1648 ms 12920 KB Output is correct
90 Correct 1086 ms 10488 KB Output is correct
91 Correct 1451 ms 11572 KB Output is correct
92 Correct 1439 ms 11636 KB Output is correct
93 Correct 1878 ms 10940 KB Output is correct
94 Correct 1671 ms 12172 KB Output is correct
95 Correct 1662 ms 12152 KB Output is correct
96 Correct 1464 ms 11584 KB Output is correct
97 Correct 875 ms 10740 KB Output is correct
98 Correct 708 ms 10104 KB Output is correct
99 Correct 1765 ms 12792 KB Output is correct
100 Correct 1871 ms 16000 KB Output is correct
101 Correct 1791 ms 16120 KB Output is correct
102 Correct 1765 ms 16120 KB Output is correct
103 Correct 1414 ms 14544 KB Output is correct
104 Correct 1467 ms 14456 KB Output is correct
105 Correct 815 ms 12740 KB Output is correct
106 Correct 640 ms 12272 KB Output is correct
107 Correct 1049 ms 15712 KB Output is correct
108 Correct 1493 ms 15552 KB Output is correct
109 Correct 1187 ms 11540 KB Output is correct