oj.uz

Submission #564344

# Submission time Handle Problem Language Result Execution time Memory
564344 2022-05-19T02:42:56 Z ngpin04 Bridges (APIO19_bridges) C++14
100 / 100
 2541 ms 18940 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) {
	return l + rd() % (r - l + 1);
}
const int N = 1e5 + 5; 
const int K = 500;
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

vector <int> a[2 * N];

int val[2 * N];
int *where[2 * N];

int tmpw[N];
int ind[N];
int ans[N];
int par[N];
int fr[N];
int to[N];
int op[N];
int w[N];
int s[N];
int d[N];
int n,m,q,timer;

bool flag[N];

void rollback() {
	*where[timer] = val[timer];
	timer--;
}

void change(int &a, int b) {
	timer++;
	where[timer] = &a;
	val[timer] = a;
	a = b;
}

int getpar(int u) {
	return (par[u] < 0) ? u : (getpar(par[u]));
}

void join(int u, int v) {
	u = getpar(u);
	v = getpar(v);
	if (u == v)
		return;
	if (par[u] > par[v])
		swap(u, v);
	change(par[u], par[u] + par[v]);
	change(par[v], u);
}

void compress() {
	vector <int> val;
	for (int i = 1; i <= m; i++)
		val.push_back(w[i]);

	for (int i = 1; i <= q; i++)
		val.push_back(d[i]);
	sort(ALL(val));

	for (int i = 1; i <= m; i++)
		w[i] = lower_bound(ALL(val), w[i]) - val.begin() + 1;

	for (int i = 1; i <= q; i++)
		d[i] = lower_bound(ALL(val), d[i]) - val.begin() + 1;
}

void solve(int l, int r) {
	timer = 0;
	for (int i = 1; i <= n; i++)
		par[i] = -1;

	for (int i = 1; i <= m; i++)
		flag[i] = false;

	vector <int> ed;
	vector <int> qr;
	for (int i = l; i <= r; i++) {
		if (op[i] == 1) {
			ed.push_back(s[i]);
			flag[s[i]] = true;
		} else
			qr.push_back(i);
	}

	sort(ALL(qr), [](int i, int j) {
		return d[i] > d[j];
	});

	{
		for (int i = 1; i <= m; i++) 
			a[w[i]].push_back(i);

		int it = 0;
		for (int i = m + q; i >= 1; i--) {
			for (int j : a[i])
				ind[++it] = j;
			a[i].clear();
		}
	}

	int it = 1;
	for (int i : qr) {
		while (it <= m && w[ind[it]] >=	d[i]) {
			if (!flag[ind[it]])
				join(fr[ind[it]], to[ind[it]]);
			it++;
		}

		int cur = timer;
		for (int j = l; j <= i; j++) 
			if (op[j] == 1) 
				tmpw[s[j]] = d[j];
		
		for (int j : ed) {
			int val = (tmpw[j] == 0) ? w[j] : tmpw[j];
			if (val >= d[i])
				join(fr[j], to[j]);
		}

		ans[i] = -par[getpar(s[i])];

		for (int j : ed)
			tmpw[j] = 0;

		while (timer != cur)
			rollback();
	}	

	for (int i = l; i <= r; i++) 
		if (op[i] == 1)
			w[s[i]] = d[i];
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	#ifdef ONLINE_JUDGE
	// freopen(TASK".inp","r",stdin);
	// freopen(TASK".out","w",stdout);
	#endif
	cin >> n >> m;
	for (int i = 1; i <= m; i++) 
		cin >> fr[i] >> to[i] >> w[i];
	
	cin >> q;
	for (int i = 1; i <= q; i++)
		cin >> op[i] >> s[i] >> d[i];

	compress();

	for (int l = 1; l <= q; l++) {
		int r = min(q, l + K);

		solve(l, r);
		l = r;
	}

	for (int i = 1; i <= q; i++)
		if (op[i] == 2)
			cout << ans[i] << "\n";
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 26 ms 5544 KB Output is correct
4 Correct 9 ms 5420 KB Output is correct
5 Correct 27 ms 5460 KB Output is correct
6 Correct 23 ms 5460 KB Output is correct
7 Correct 26 ms 5332 KB Output is correct
8 Correct 28 ms 5460 KB Output is correct
9 Correct 28 ms 5408 KB Output is correct
10 Correct 30 ms 5460 KB Output is correct
11 Correct 29 ms 5444 KB Output is correct
12 Correct 33 ms 5444 KB Output is correct
13 Correct 32 ms 5400 KB Output is correct
14 Correct 30 ms 5460 KB Output is correct
15 Correct 32 ms 5452 KB Output is correct
16 Correct 29 ms 5412 KB Output is correct
17 Correct 29 ms 5400 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1262 ms 12628 KB Output is correct
2 Correct 1232 ms 12524 KB Output is correct
3 Correct 1255 ms 12660 KB Output is correct
4 Correct 1249 ms 12728 KB Output is correct
5 Correct 1249 ms 12376 KB Output is correct
6 Correct 1480 ms 12660 KB Output is correct
7 Correct 1449 ms 12700 KB Output is correct
8 Correct 1468 ms 12636 KB Output is correct
9 Correct 88 ms 6992 KB Output is correct
10 Correct 667 ms 9668 KB Output is correct
11 Correct 637 ms 9616 KB Output is correct
12 Correct 914 ms 11544 KB Output is correct
13 Correct 1136 ms 13604 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 878 ms 11076 KB Output is correct
2 Correct 543 ms 9136 KB Output is correct
3 Correct 951 ms 11124 KB Output is correct
4 Correct 857 ms 11088 KB Output is correct
5 Correct 85 ms 6984 KB Output is correct
6 Correct 918 ms 11092 KB Output is correct
7 Correct 802 ms 11196 KB Output is correct
8 Correct 768 ms 10956 KB Output is correct
9 Correct 671 ms 10060 KB Output is correct
10 Correct 636 ms 10080 KB Output is correct
11 Correct 705 ms 12096 KB Output is correct
12 Correct 630 ms 12124 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2168 ms 13456 KB Output is correct
2 Correct 85 ms 8256 KB Output is correct
3 Correct 180 ms 11844 KB Output is correct
4 Correct 97 ms 9740 KB Output is correct
5 Correct 889 ms 13100 KB Output is correct
6 Correct 2170 ms 17060 KB Output is correct
7 Correct 889 ms 13096 KB Output is correct
8 Correct 880 ms 13328 KB Output is correct
9 Correct 887 ms 13480 KB Output is correct
10 Correct 730 ms 13276 KB Output is correct
11 Correct 1557 ms 14992 KB Output is correct
12 Correct 1525 ms 15316 KB Output is correct
13 Correct 1316 ms 15164 KB Output is correct
14 Correct 891 ms 13352 KB Output is correct
15 Correct 905 ms 13288 KB Output is correct
16 Correct 2177 ms 16972 KB Output is correct
17 Correct 2227 ms 16740 KB Output is correct
18 Correct 2248 ms 17204 KB Output is correct
19 Correct 2205 ms 17132 KB Output is correct
20 Correct 1454 ms 15796 KB Output is correct
21 Correct 1501 ms 15756 KB Output is correct
22 Correct 1983 ms 16820 KB Output is correct
23 Correct 903 ms 12356 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1262 ms 12628 KB Output is correct
2 Correct 1232 ms 12524 KB Output is correct
3 Correct 1255 ms 12660 KB Output is correct
4 Correct 1249 ms 12728 KB Output is correct
5 Correct 1249 ms 12376 KB Output is correct
6 Correct 1480 ms 12660 KB Output is correct
7 Correct 1449 ms 12700 KB Output is correct
8 Correct 1468 ms 12636 KB Output is correct
9 Correct 88 ms 6992 KB Output is correct
10 Correct 667 ms 9668 KB Output is correct
11 Correct 637 ms 9616 KB Output is correct
12 Correct 914 ms 11544 KB Output is correct
13 Correct 1136 ms 13604 KB Output is correct
14 Correct 878 ms 11076 KB Output is correct
15 Correct 543 ms 9136 KB Output is correct
16 Correct 951 ms 11124 KB Output is correct
17 Correct 857 ms 11088 KB Output is correct
18 Correct 85 ms 6984 KB Output is correct
19 Correct 918 ms 11092 KB Output is correct
20 Correct 802 ms 11196 KB Output is correct
21 Correct 768 ms 10956 KB Output is correct
22 Correct 671 ms 10060 KB Output is correct
23 Correct 636 ms 10080 KB Output is correct
24 Correct 705 ms 12096 KB Output is correct
25 Correct 630 ms 12124 KB Output is correct
26 Correct 1229 ms 12600 KB Output is correct
27 Correct 1490 ms 12624 KB Output is correct
28 Correct 1307 ms 12608 KB Output is correct
29 Correct 1116 ms 12524 KB Output is correct
30 Correct 1345 ms 12536 KB Output is correct
31 Correct 1432 ms 12444 KB Output is correct
32 Correct 1423 ms 12552 KB Output is correct
33 Correct 1343 ms 12616 KB Output is correct
34 Correct 1265 ms 12720 KB Output is correct
35 Correct 1264 ms 12508 KB Output is correct
36 Correct 1124 ms 12564 KB Output is correct
37 Correct 1179 ms 12504 KB Output is correct
38 Correct 1074 ms 12508 KB Output is correct
39 Correct 979 ms 11324 KB Output is correct
40 Correct 913 ms 11316 KB Output is correct
41 Correct 902 ms 11476 KB Output is correct
42 Correct 1000 ms 13704 KB Output is correct
43 Correct 998 ms 13756 KB Output is correct
44 Correct 1006 ms 13700 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 26 ms 5544 KB Output is correct
4 Correct 9 ms 5420 KB Output is correct
5 Correct 27 ms 5460 KB Output is correct
6 Correct 23 ms 5460 KB Output is correct
7 Correct 26 ms 5332 KB Output is correct
8 Correct 28 ms 5460 KB Output is correct
9 Correct 28 ms 5408 KB Output is correct
10 Correct 30 ms 5460 KB Output is correct
11 Correct 29 ms 5444 KB Output is correct
12 Correct 33 ms 5444 KB Output is correct
13 Correct 32 ms 5400 KB Output is correct
14 Correct 30 ms 5460 KB Output is correct
15 Correct 32 ms 5452 KB Output is correct
16 Correct 29 ms 5412 KB Output is correct
17 Correct 29 ms 5400 KB Output is correct
18 Correct 1262 ms 12628 KB Output is correct
19 Correct 1232 ms 12524 KB Output is correct
20 Correct 1255 ms 12660 KB Output is correct
21 Correct 1249 ms 12728 KB Output is correct
22 Correct 1249 ms 12376 KB Output is correct
23 Correct 1480 ms 12660 KB Output is correct
24 Correct 1449 ms 12700 KB Output is correct
25 Correct 1468 ms 12636 KB Output is correct
26 Correct 88 ms 6992 KB Output is correct
27 Correct 667 ms 9668 KB Output is correct
28 Correct 637 ms 9616 KB Output is correct
29 Correct 914 ms 11544 KB Output is correct
30 Correct 1136 ms 13604 KB Output is correct
31 Correct 878 ms 11076 KB Output is correct
32 Correct 543 ms 9136 KB Output is correct
33 Correct 951 ms 11124 KB Output is correct
34 Correct 857 ms 11088 KB Output is correct
35 Correct 85 ms 6984 KB Output is correct
36 Correct 918 ms 11092 KB Output is correct
37 Correct 802 ms 11196 KB Output is correct
38 Correct 768 ms 10956 KB Output is correct
39 Correct 671 ms 10060 KB Output is correct
40 Correct 636 ms 10080 KB Output is correct
41 Correct 705 ms 12096 KB Output is correct
42 Correct 630 ms 12124 KB Output is correct
43 Correct 2168 ms 13456 KB Output is correct
44 Correct 85 ms 8256 KB Output is correct
45 Correct 180 ms 11844 KB Output is correct
46 Correct 97 ms 9740 KB Output is correct
47 Correct 889 ms 13100 KB Output is correct
48 Correct 2170 ms 17060 KB Output is correct
49 Correct 889 ms 13096 KB Output is correct
50 Correct 880 ms 13328 KB Output is correct
51 Correct 887 ms 13480 KB Output is correct
52 Correct 730 ms 13276 KB Output is correct
53 Correct 1557 ms 14992 KB Output is correct
54 Correct 1525 ms 15316 KB Output is correct
55 Correct 1316 ms 15164 KB Output is correct
56 Correct 891 ms 13352 KB Output is correct
57 Correct 905 ms 13288 KB Output is correct
58 Correct 2177 ms 16972 KB Output is correct
59 Correct 2227 ms 16740 KB Output is correct
60 Correct 2248 ms 17204 KB Output is correct
61 Correct 2205 ms 17132 KB Output is correct
62 Correct 1454 ms 15796 KB Output is correct
63 Correct 1501 ms 15756 KB Output is correct
64 Correct 1983 ms 16820 KB Output is correct
65 Correct 903 ms 12356 KB Output is correct
66 Correct 1229 ms 12600 KB Output is correct
67 Correct 1490 ms 12624 KB Output is correct
68 Correct 1307 ms 12608 KB Output is correct
69 Correct 1116 ms 12524 KB Output is correct
70 Correct 1345 ms 12536 KB Output is correct
71 Correct 1432 ms 12444 KB Output is correct
72 Correct 1423 ms 12552 KB Output is correct
73 Correct 1343 ms 12616 KB Output is correct
74 Correct 1265 ms 12720 KB Output is correct
75 Correct 1264 ms 12508 KB Output is correct
76 Correct 1124 ms 12564 KB Output is correct
77 Correct 1179 ms 12504 KB Output is correct
78 Correct 1074 ms 12508 KB Output is correct
79 Correct 979 ms 11324 KB Output is correct
80 Correct 913 ms 11316 KB Output is correct
81 Correct 902 ms 11476 KB Output is correct
82 Correct 1000 ms 13704 KB Output is correct
83 Correct 998 ms 13756 KB Output is correct
84 Correct 1006 ms 13700 KB Output is correct
85 Correct 2525 ms 18784 KB Output is correct
86 Correct 197 ms 12396 KB Output is correct
87 Correct 121 ms 10120 KB Output is correct
88 Correct 1093 ms 13340 KB Output is correct
89 Correct 2443 ms 18940 KB Output is correct
90 Correct 1105 ms 12880 KB Output is correct
91 Correct 1317 ms 14888 KB Output is correct
92 Correct 1295 ms 15012 KB Output is correct
93 Correct 1506 ms 14988 KB Output is correct
94 Correct 2013 ms 16808 KB Output is correct
95 Correct 1866 ms 16760 KB Output is correct
96 Correct 1915 ms 16632 KB Output is correct
97 Correct 962 ms 13224 KB Output is correct
98 Correct 974 ms 13000 KB Output is correct
99 Correct 2531 ms 18812 KB Output is correct
100 Correct 2521 ms 18592 KB Output is correct
101 Correct 2541 ms 18788 KB Output is correct
102 Correct 2494 ms 18696 KB Output is correct
103 Correct 2135 ms 17388 KB Output is correct
104 Correct 2121 ms 17268 KB Output is correct
105 Correct 2142 ms 18484 KB Output is correct
106 Correct 1767 ms 18092 KB Output is correct
107 Correct 1641 ms 16248 KB Output is correct
108 Correct 2433 ms 18148 KB Output is correct
109 Correct 1177 ms 12280 KB Output is correct