oj.uz

Submission #477094

# Submission time Handle Problem Language Result Execution time Memory
477094 2021-09-30T09:29:05 Z ymm Bridges (APIO19_bridges) C++17
100 / 100
 2821 ms 13172 KB 
///
///   Yare Yare Daze
///

#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define Loop(x,l,r) for(ll x = (l); x < (r); ++x)
typedef long long ll;
typedef std::pair<int,int> pii;
using namespace std;

//#ifndef EVAL
//void dbg(){cerr << "!\n";}
//template<class T, class... U> void dbg(T x, U... y){cerr << x << ' '; dbg(y...);}
//#else
template<class... T> inline void dbg(T... x){}
//#endif

const int N = 100010;
const int S = 600;
int n, m, q;

int ep1[N], ep2[N], cur_wt[N], new_wt[N];
int par[N], cmp_size[N];
int qt[N], qa[N], qb[N];

int root(int v){while(par[v] != -1) v = par[v]; return v;}
int root_cmp(int v){
	int rt = root(v);
	while(v != rt) {
		int u = par[v];
		par[v] = rt;
		v = u;
	}
	return v;
}

vector<pii> dsu_rev;
void unite(int v, int u)
{
	dbg("unite", v, u);
	v = root(v); u = root(u);
	if(v == u) return;
	if(cmp_size[v] < cmp_size[u]) swap(v, u);
	par[u] = v;
	cmp_size[v] += cmp_size[u];
	dsu_rev.emplace_back(v, u);
}
void unite_cmp(int v, int u)
{
	dbg("unitec", v, u);
	v = root_cmp(v); u = root_cmp(u);
	if(v == u) return;
	if(cmp_size[v] < cmp_size[u]) swap(v, u);
	par[u] = v;
	cmp_size[v] += cmp_size[u];
}

void dsu_reverse()
{
	for(auto it = dsu_rev.end(); it != dsu_rev.begin();)
	{
		--it;
		dbg("rev", it->first, it->second);
		cmp_size[it->first] -= cmp_size[it->second];
		par[it->second] = -1;
	}
	dsu_rev.clear();
}

void init()
{
	fill(par,par+N,-1);
	fill(cmp_size,cmp_size+N,1);
}

void Input()
{
	#ifndef EVAL
	freopen("in.txt", "r", stdin);
	#else
	ios::sync_with_stdio(false); cin.tie(0);
	#endif
	mt19937_64 rd;
	//n=50000;m=100000;
	cin >> n >> m;
	Loop(i,0,m)
		//ep1[i]=rd()%n,ep2[i]=rd()%n,cur_wt[i]=rd();
		cin >> ep1[i] >> ep2[i] >> cur_wt[i], ep1[i]--, ep2[i]--;
	//q=100000;
	cin >> q;
	Loop(i,0,q){
		cin >> qt[i] >> qa[i] >> qb[i];
		qa[i]--;
		//qt[i] = 2; qa[i] = rand()%n; qb[i] = rand();
	}
}

int ans[N];
void Output()
{
	Loop(i,0,q) if(qt[i] == 2) cout << ans[i] << '\n';
	#ifndef EVAL
	cout << double(clock())/CLOCKS_PER_SEC << '\n';
	#endif
}

bool in_ivl[N];
set<pii, greater<pii>> srt_edge;
vector<pii> srt_car;

int main()
{
	Input();
	Loop(i,0,m) srt_edge.emplace(cur_wt[i], i);
	for(int l = 0; l < q; l += S)
	{
		int r = min(q, l+S);
		init();
		Loop(i,l,r) {
			if(qt[i] == 1) in_ivl[qa[i]] = 1;
			else           srt_car.emplace_back(qb[i], i);
		}
		sort(srt_car.begin(), srt_car.end(), greater<pii>());
		auto edge_pnt = srt_edge.begin();
		memcpy(new_wt, cur_wt, m*4);
		for(auto [car_wt, car] : srt_car)
		{
			dbg("test", car, car_wt, edge_pnt->first);
			while(edge_pnt != srt_edge.end() && edge_pnt->first >= car_wt){
				if(!in_ivl[edge_pnt->second])
					unite_cmp(ep1[edge_pnt->second], ep2[edge_pnt->second]);
				edge_pnt++;
			}
			Loop(i,l,car) if(qt[i] == 1) new_wt[qa[i]] = qb[i]; 
			Loop(i,l,r) {
				if(qt[i] == 1) dbg("qt", qa[i], new_wt[qa[i]], car_wt);
				if(qt[i] == 1 && new_wt[qa[i]] >= car_wt) unite(ep1[qa[i]], ep2[qa[i]]);
			}
			ans[car] = cmp_size[root(qa[car])];
			dsu_reverse();
			Loop(i,l,car) if(qt[i] == 1) new_wt[qa[i]] = cur_wt[qa[i]];
		}
		srt_car.clear();
		Loop(i,l,r) if(qt[i] == 1) {
			int e = qa[i], w = qb[i];
			in_ivl[e] = 0;
			srt_edge.erase({cur_wt[e], e});
			cur_wt[e] = w;
			srt_edge.insert({cur_wt[e], e});
		}
	}
	Output();
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 31 ms 1512 KB Output is correct
4 Correct 14 ms 1428 KB Output is correct
5 Correct 38 ms 1412 KB Output is correct
6 Correct 30 ms 1424 KB Output is correct
7 Correct 33 ms 1352 KB Output is correct
8 Correct 41 ms 1432 KB Output is correct
9 Correct 33 ms 1344 KB Output is correct
10 Correct 43 ms 1544 KB Output is correct
11 Correct 39 ms 1416 KB Output is correct
12 Correct 44 ms 1356 KB Output is correct
13 Correct 44 ms 1356 KB Output is correct
14 Correct 44 ms 1432 KB Output is correct
15 Correct 44 ms 1432 KB Output is correct
16 Correct 38 ms 1344 KB Output is correct
17 Correct 36 ms 1352 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1268 ms 6404 KB Output is correct
2 Correct 1256 ms 6276 KB Output is correct
3 Correct 1328 ms 6292 KB Output is correct
4 Correct 1330 ms 6356 KB Output is correct
5 Correct 1328 ms 6356 KB Output is correct
6 Correct 1561 ms 6684 KB Output is correct
7 Correct 1645 ms 6472 KB Output is correct
8 Correct 1612 ms 6748 KB Output is correct
9 Correct 120 ms 3268 KB Output is correct
10 Correct 934 ms 6452 KB Output is correct
11 Correct 940 ms 6348 KB Output is correct
12 Correct 1151 ms 6868 KB Output is correct
13 Correct 1081 ms 6280 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 931 ms 5160 KB Output is correct
2 Correct 615 ms 3824 KB Output is correct
3 Correct 1016 ms 5368 KB Output is correct
4 Correct 886 ms 5264 KB Output is correct
5 Correct 128 ms 3140 KB Output is correct
6 Correct 1027 ms 5248 KB Output is correct
7 Correct 897 ms 5256 KB Output is correct
8 Correct 792 ms 5400 KB Output is correct
9 Correct 736 ms 5408 KB Output is correct
10 Correct 609 ms 5308 KB Output is correct
11 Correct 697 ms 5056 KB Output is correct
12 Correct 591 ms 5072 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2560 ms 9740 KB Output is correct
2 Correct 126 ms 3068 KB Output is correct
3 Correct 242 ms 7900 KB Output is correct
4 Correct 105 ms 7860 KB Output is correct
5 Correct 1658 ms 9696 KB Output is correct
6 Correct 2126 ms 9640 KB Output is correct
7 Correct 1760 ms 9900 KB Output is correct
8 Correct 864 ms 6340 KB Output is correct
9 Correct 834 ms 6324 KB Output is correct
10 Correct 911 ms 6460 KB Output is correct
11 Correct 1572 ms 8012 KB Output is correct
12 Correct 1579 ms 7964 KB Output is correct
13 Correct 1716 ms 8136 KB Output is correct
14 Correct 973 ms 9756 KB Output is correct
15 Correct 1236 ms 9820 KB Output is correct
16 Correct 2367 ms 9680 KB Output is correct
17 Correct 2479 ms 9620 KB Output is correct
18 Correct 2366 ms 9660 KB Output is correct
19 Correct 2333 ms 9656 KB Output is correct
20 Correct 2058 ms 8828 KB Output is correct
21 Correct 2255 ms 8768 KB Output is correct
22 Correct 2306 ms 9516 KB Output is correct
23 Correct 1662 ms 8604 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1268 ms 6404 KB Output is correct
2 Correct 1256 ms 6276 KB Output is correct
3 Correct 1328 ms 6292 KB Output is correct
4 Correct 1330 ms 6356 KB Output is correct
5 Correct 1328 ms 6356 KB Output is correct
6 Correct 1561 ms 6684 KB Output is correct
7 Correct 1645 ms 6472 KB Output is correct
8 Correct 1612 ms 6748 KB Output is correct
9 Correct 120 ms 3268 KB Output is correct
10 Correct 934 ms 6452 KB Output is correct
11 Correct 940 ms 6348 KB Output is correct
12 Correct 1151 ms 6868 KB Output is correct
13 Correct 1081 ms 6280 KB Output is correct
14 Correct 931 ms 5160 KB Output is correct
15 Correct 615 ms 3824 KB Output is correct
16 Correct 1016 ms 5368 KB Output is correct
17 Correct 886 ms 5264 KB Output is correct
18 Correct 128 ms 3140 KB Output is correct
19 Correct 1027 ms 5248 KB Output is correct
20 Correct 897 ms 5256 KB Output is correct
21 Correct 792 ms 5400 KB Output is correct
22 Correct 736 ms 5408 KB Output is correct
23 Correct 609 ms 5308 KB Output is correct
24 Correct 697 ms 5056 KB Output is correct
25 Correct 591 ms 5072 KB Output is correct
26 Correct 1477 ms 6488 KB Output is correct
27 Correct 1705 ms 6584 KB Output is correct
28 Correct 1594 ms 6552 KB Output is correct
29 Correct 1154 ms 6480 KB Output is correct
30 Correct 1612 ms 6468 KB Output is correct
31 Correct 1451 ms 6644 KB Output is correct
32 Correct 1576 ms 6448 KB Output is correct
33 Correct 1607 ms 6416 KB Output is correct
34 Correct 1405 ms 6364 KB Output is correct
35 Correct 1520 ms 6592 KB Output is correct
36 Correct 1245 ms 6528 KB Output is correct
37 Correct 1171 ms 6472 KB Output is correct
38 Correct 1180 ms 6392 KB Output is correct
39 Correct 987 ms 6464 KB Output is correct
40 Correct 961 ms 6600 KB Output is correct
41 Correct 839 ms 6508 KB Output is correct
42 Correct 854 ms 6320 KB Output is correct
43 Correct 875 ms 6348 KB Output is correct
44 Correct 908 ms 6624 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 31 ms 1512 KB Output is correct
4 Correct 14 ms 1428 KB Output is correct
5 Correct 38 ms 1412 KB Output is correct
6 Correct 30 ms 1424 KB Output is correct
7 Correct 33 ms 1352 KB Output is correct
8 Correct 41 ms 1432 KB Output is correct
9 Correct 33 ms 1344 KB Output is correct
10 Correct 43 ms 1544 KB Output is correct
11 Correct 39 ms 1416 KB Output is correct
12 Correct 44 ms 1356 KB Output is correct
13 Correct 44 ms 1356 KB Output is correct
14 Correct 44 ms 1432 KB Output is correct
15 Correct 44 ms 1432 KB Output is correct
16 Correct 38 ms 1344 KB Output is correct
17 Correct 36 ms 1352 KB Output is correct
18 Correct 1268 ms 6404 KB Output is correct
19 Correct 1256 ms 6276 KB Output is correct
20 Correct 1328 ms 6292 KB Output is correct
21 Correct 1330 ms 6356 KB Output is correct
22 Correct 1328 ms 6356 KB Output is correct
23 Correct 1561 ms 6684 KB Output is correct
24 Correct 1645 ms 6472 KB Output is correct
25 Correct 1612 ms 6748 KB Output is correct
26 Correct 120 ms 3268 KB Output is correct
27 Correct 934 ms 6452 KB Output is correct
28 Correct 940 ms 6348 KB Output is correct
29 Correct 1151 ms 6868 KB Output is correct
30 Correct 1081 ms 6280 KB Output is correct
31 Correct 931 ms 5160 KB Output is correct
32 Correct 615 ms 3824 KB Output is correct
33 Correct 1016 ms 5368 KB Output is correct
34 Correct 886 ms 5264 KB Output is correct
35 Correct 128 ms 3140 KB Output is correct
36 Correct 1027 ms 5248 KB Output is correct
37 Correct 897 ms 5256 KB Output is correct
38 Correct 792 ms 5400 KB Output is correct
39 Correct 736 ms 5408 KB Output is correct
40 Correct 609 ms 5308 KB Output is correct
41 Correct 697 ms 5056 KB Output is correct
42 Correct 591 ms 5072 KB Output is correct
43 Correct 2560 ms 9740 KB Output is correct
44 Correct 126 ms 3068 KB Output is correct
45 Correct 242 ms 7900 KB Output is correct
46 Correct 105 ms 7860 KB Output is correct
47 Correct 1658 ms 9696 KB Output is correct
48 Correct 2126 ms 9640 KB Output is correct
49 Correct 1760 ms 9900 KB Output is correct
50 Correct 864 ms 6340 KB Output is correct
51 Correct 834 ms 6324 KB Output is correct
52 Correct 911 ms 6460 KB Output is correct
53 Correct 1572 ms 8012 KB Output is correct
54 Correct 1579 ms 7964 KB Output is correct
55 Correct 1716 ms 8136 KB Output is correct
56 Correct 973 ms 9756 KB Output is correct
57 Correct 1236 ms 9820 KB Output is correct
58 Correct 2367 ms 9680 KB Output is correct
59 Correct 2479 ms 9620 KB Output is correct
60 Correct 2366 ms 9660 KB Output is correct
61 Correct 2333 ms 9656 KB Output is correct
62 Correct 2058 ms 8828 KB Output is correct
63 Correct 2255 ms 8768 KB Output is correct
64 Correct 2306 ms 9516 KB Output is correct
65 Correct 1662 ms 8604 KB Output is correct
66 Correct 1477 ms 6488 KB Output is correct
67 Correct 1705 ms 6584 KB Output is correct
68 Correct 1594 ms 6552 KB Output is correct
69 Correct 1154 ms 6480 KB Output is correct
70 Correct 1612 ms 6468 KB Output is correct
71 Correct 1451 ms 6644 KB Output is correct
72 Correct 1576 ms 6448 KB Output is correct
73 Correct 1607 ms 6416 KB Output is correct
74 Correct 1405 ms 6364 KB Output is correct
75 Correct 1520 ms 6592 KB Output is correct
76 Correct 1245 ms 6528 KB Output is correct
77 Correct 1171 ms 6472 KB Output is correct
78 Correct 1180 ms 6392 KB Output is correct
79 Correct 987 ms 6464 KB Output is correct
80 Correct 961 ms 6600 KB Output is correct
81 Correct 839 ms 6508 KB Output is correct
82 Correct 854 ms 6320 KB Output is correct
83 Correct 875 ms 6348 KB Output is correct
84 Correct 908 ms 6624 KB Output is correct
85 Correct 2746 ms 9576 KB Output is correct
86 Correct 250 ms 7904 KB Output is correct
87 Correct 122 ms 7952 KB Output is correct
88 Correct 1799 ms 9692 KB Output is correct
89 Correct 2147 ms 9652 KB Output is correct
90 Correct 1415 ms 9760 KB Output is correct
91 Correct 1385 ms 6428 KB Output is correct
92 Correct 1414 ms 6436 KB Output is correct
93 Correct 1792 ms 6544 KB Output is correct
94 Correct 1877 ms 7948 KB Output is correct
95 Correct 1933 ms 8132 KB Output is correct
96 Correct 1874 ms 8204 KB Output is correct
97 Correct 1254 ms 9804 KB Output is correct
98 Correct 1511 ms 9456 KB Output is correct
99 Correct 2821 ms 9552 KB Output is correct
100 Correct 2764 ms 9632 KB Output is correct
101 Correct 2679 ms 13172 KB Output is correct
102 Correct 2792 ms 13020 KB Output is correct
103 Correct 2132 ms 11400 KB Output is correct
104 Correct 1936 ms 11560 KB Output is correct
105 Correct 1670 ms 11444 KB Output is correct
106 Correct 1347 ms 10760 KB Output is correct
107 Correct 1736 ms 11684 KB Output is correct
108 Correct 2039 ms 12484 KB Output is correct
109 Correct 1487 ms 10180 KB Output is correct