oj.uz

답안 #420673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
420673 2021-06-08T13:16:36 Z Return_0 다리 (APIO19_bridges) C++17
100 / 100
 2602 ms 130668 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 50'003, M = 100'003, SQ = 1000;

ll V [M], U [M], W [M], T [M], X [M], Y [M], ans [M], par [N], sz [N], n, m, q, lst;
vector <ll> query, upd, nupd, vec [M];
vector <ll> his;
bool mark [M];

inline ll root (ll v) {
	for (; par[v]; v = par[v]);
	return v;
}

inline bool unite (ll v, ll u) {
	v = root(v); u = root(u);
	if (v == u) return false;
	if (sz[v] < sz[u]) swap(v, u);
	par[u] = v; sz[v] += sz[u];
	his.push_back(u);
	return true;
}

inline void undo (ll x) {
	for (; x--; his.pop_back()) {
		ll &v = his.back();
		sz[par[v]] -= sz[v];
		par[v] = 0;
	}
}

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> m;
	for (ll i = 1; i <= m; i++) cin>> V[i] >> U[i] >> W[i];
	cin>> q;
	for (ll i = 1; i <= q; i++) cin>> T[i] >> X [i] >> Y [i];

	for (ll l = 1, r; l <= q; l += SQ) {
		memset(par, 0, sizeof par);
		fill(sz + 1, sz + n + 1, 1);
		query.clear(); upd.clear(); nupd.clear(); his.clear();
		r = min(l + SQ, q + 1);

		for (ll i = l; i < r; i++) {
			if (T[i] == 1) {
				mark[X[i]] = 1;
				upd.push_back(X[i]);
			} else query.push_back(i);
		}
	
		for (ll i = 1; i <= m; i++) { if (!mark[i]) nupd.push_back(i); else mark[i] = false; }
		for (ll i = l; i < r; i++) {
			if (T[i] == 1) W[X[i]] = Y[i];
			else for (auto &id : upd) if (W[id] >= Y[i]) vec[i].push_back(id);
		}

		sort(All(query), [&](cl &i, cl &j) { return Y[i] > Y[j]; });
		sort(All(nupd), [&](cl &i, cl &j) { return W[i] > W[j]; });
		lst = 0; for (auto &id : query) {
			for (; lst < SZ(nupd) && W[nupd[lst]] >= Y[id]; lst++) unite(V[nupd[lst]], U[nupd[lst]]);
			ll sv = SZ(his);
			for (auto &e : vec[id]) unite(V[e], U[e]);
			ans[id] = sz[root(X[id])];
			undo(SZ(his) - sv);
		}
	}

	for (ll i = 1; i <= q; i++) if (T[i] == 2) cout<< ans[i] << '\n';

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
3 4
1 2 5
2 3 2
3 1 4
2 3 8
5
2 1 5
1 4 1
2 2 5
1 1 1
2 3 2

7 8
1 2 5
1 6 5
2 3 5
2 7 5
3 4 5
4 5 5
5 6 5
6 7 5
12
2 1 6
1 1 1
2 1 2
1 2 3
2 2 2
1 5 2
1 3 1
2 2 4
2 4 2
1 8 1
2 1 1
2 1 3

*/

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2892 KB Output is correct
2 Correct 2 ms 2892 KB Output is correct
3 Correct 50 ms 9648 KB Output is correct
4 Correct 9 ms 3020 KB Output is correct
5 Correct 49 ms 10364 KB Output is correct
6 Correct 36 ms 10632 KB Output is correct
7 Correct 38 ms 10692 KB Output is correct
8 Correct 43 ms 9072 KB Output is correct
9 Correct 50 ms 14960 KB Output is correct
10 Correct 47 ms 9796 KB Output is correct
11 Correct 44 ms 9748 KB Output is correct
12 Correct 52 ms 12132 KB Output is correct
13 Correct 50 ms 10300 KB Output is correct
14 Correct 47 ms 9492 KB Output is correct
15 Correct 50 ms 10180 KB Output is correct
16 Correct 45 ms 13108 KB Output is correct
17 Correct 45 ms 12308 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1482 ms 72696 KB Output is correct
2 Correct 1463 ms 72548 KB Output is correct
3 Correct 1476 ms 73040 KB Output is correct
4 Correct 1498 ms 72556 KB Output is correct
5 Correct 1520 ms 73024 KB Output is correct
6 Correct 2096 ms 130668 KB Output is correct
7 Correct 2215 ms 127244 KB Output is correct
8 Correct 2226 ms 126924 KB Output is correct
9 Correct 45 ms 4548 KB Output is correct
10 Correct 1195 ms 98684 KB Output is correct
11 Correct 1173 ms 98116 KB Output is correct
12 Correct 1400 ms 52536 KB Output is correct
13 Correct 1278 ms 45752 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1130 ms 72688 KB Output is correct
2 Correct 887 ms 97812 KB Output is correct
3 Correct 1381 ms 100644 KB Output is correct
4 Correct 1127 ms 72148 KB Output is correct
5 Correct 50 ms 4556 KB Output is correct
6 Correct 1322 ms 91964 KB Output is correct
7 Correct 1052 ms 64292 KB Output is correct
8 Correct 907 ms 48500 KB Output is correct
9 Correct 820 ms 40308 KB Output is correct
10 Correct 776 ms 28628 KB Output is correct
11 Correct 803 ms 37772 KB Output is correct
12 Correct 682 ms 27764 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1781 ms 7008 KB Output is correct
2 Correct 48 ms 4576 KB Output is correct
3 Correct 187 ms 4772 KB Output is correct
4 Correct 119 ms 4780 KB Output is correct
5 Correct 878 ms 7120 KB Output is correct
6 Correct 1660 ms 6984 KB Output is correct
7 Correct 892 ms 7064 KB Output is correct
8 Correct 848 ms 5868 KB Output is correct
9 Correct 889 ms 5860 KB Output is correct
10 Correct 882 ms 6116 KB Output is correct
11 Correct 1334 ms 6524 KB Output is correct
12 Correct 1308 ms 6528 KB Output is correct
13 Correct 1320 ms 6724 KB Output is correct
14 Correct 869 ms 7084 KB Output is correct
15 Correct 949 ms 7072 KB Output is correct
16 Correct 1906 ms 7068 KB Output is correct
17 Correct 1942 ms 7048 KB Output is correct
18 Correct 1802 ms 7012 KB Output is correct
19 Correct 1708 ms 6964 KB Output is correct
20 Correct 1492 ms 6924 KB Output is correct
21 Correct 1428 ms 6856 KB Output is correct
22 Correct 1697 ms 7076 KB Output is correct
23 Correct 964 ms 6804 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1482 ms 72696 KB Output is correct
2 Correct 1463 ms 72548 KB Output is correct
3 Correct 1476 ms 73040 KB Output is correct
4 Correct 1498 ms 72556 KB Output is correct
5 Correct 1520 ms 73024 KB Output is correct
6 Correct 2096 ms 130668 KB Output is correct
7 Correct 2215 ms 127244 KB Output is correct
8 Correct 2226 ms 126924 KB Output is correct
9 Correct 45 ms 4548 KB Output is correct
10 Correct 1195 ms 98684 KB Output is correct
11 Correct 1173 ms 98116 KB Output is correct
12 Correct 1400 ms 52536 KB Output is correct
13 Correct 1278 ms 45752 KB Output is correct
14 Correct 1130 ms 72688 KB Output is correct
15 Correct 887 ms 97812 KB Output is correct
16 Correct 1381 ms 100644 KB Output is correct
17 Correct 1127 ms 72148 KB Output is correct
18 Correct 50 ms 4556 KB Output is correct
19 Correct 1322 ms 91964 KB Output is correct
20 Correct 1052 ms 64292 KB Output is correct
21 Correct 907 ms 48500 KB Output is correct
22 Correct 820 ms 40308 KB Output is correct
23 Correct 776 ms 28628 KB Output is correct
24 Correct 803 ms 37772 KB Output is correct
25 Correct 682 ms 27764 KB Output is correct
26 Correct 1485 ms 72788 KB Output is correct
27 Correct 1784 ms 101972 KB Output is correct
28 Correct 1498 ms 70916 KB Output is correct
29 Correct 1093 ms 28176 KB Output is correct
30 Correct 1666 ms 88424 KB Output is correct
31 Correct 1778 ms 90820 KB Output is correct
32 Correct 1772 ms 91336 KB Output is correct
33 Correct 1483 ms 71192 KB Output is correct
34 Correct 1536 ms 71416 KB Output is correct
35 Correct 1576 ms 71724 KB Output is correct
36 Correct 1136 ms 35052 KB Output is correct
37 Correct 1202 ms 33852 KB Output is correct
38 Correct 1122 ms 32156 KB Output is correct
39 Correct 953 ms 18172 KB Output is correct
40 Correct 975 ms 17412 KB Output is correct
41 Correct 981 ms 16940 KB Output is correct
42 Correct 922 ms 16600 KB Output is correct
43 Correct 930 ms 16048 KB Output is correct
44 Correct 916 ms 15480 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2892 KB Output is correct
2 Correct 2 ms 2892 KB Output is correct
3 Correct 50 ms 9648 KB Output is correct
4 Correct 9 ms 3020 KB Output is correct
5 Correct 49 ms 10364 KB Output is correct
6 Correct 36 ms 10632 KB Output is correct
7 Correct 38 ms 10692 KB Output is correct
8 Correct 43 ms 9072 KB Output is correct
9 Correct 50 ms 14960 KB Output is correct
10 Correct 47 ms 9796 KB Output is correct
11 Correct 44 ms 9748 KB Output is correct
12 Correct 52 ms 12132 KB Output is correct
13 Correct 50 ms 10300 KB Output is correct
14 Correct 47 ms 9492 KB Output is correct
15 Correct 50 ms 10180 KB Output is correct
16 Correct 45 ms 13108 KB Output is correct
17 Correct 45 ms 12308 KB Output is correct
18 Correct 1482 ms 72696 KB Output is correct
19 Correct 1463 ms 72548 KB Output is correct
20 Correct 1476 ms 73040 KB Output is correct
21 Correct 1498 ms 72556 KB Output is correct
22 Correct 1520 ms 73024 KB Output is correct
23 Correct 2096 ms 130668 KB Output is correct
24 Correct 2215 ms 127244 KB Output is correct
25 Correct 2226 ms 126924 KB Output is correct
26 Correct 45 ms 4548 KB Output is correct
27 Correct 1195 ms 98684 KB Output is correct
28 Correct 1173 ms 98116 KB Output is correct
29 Correct 1400 ms 52536 KB Output is correct
30 Correct 1278 ms 45752 KB Output is correct
31 Correct 1130 ms 72688 KB Output is correct
32 Correct 887 ms 97812 KB Output is correct
33 Correct 1381 ms 100644 KB Output is correct
34 Correct 1127 ms 72148 KB Output is correct
35 Correct 50 ms 4556 KB Output is correct
36 Correct 1322 ms 91964 KB Output is correct
37 Correct 1052 ms 64292 KB Output is correct
38 Correct 907 ms 48500 KB Output is correct
39 Correct 820 ms 40308 KB Output is correct
40 Correct 776 ms 28628 KB Output is correct
41 Correct 803 ms 37772 KB Output is correct
42 Correct 682 ms 27764 KB Output is correct
43 Correct 1781 ms 7008 KB Output is correct
44 Correct 48 ms 4576 KB Output is correct
45 Correct 187 ms 4772 KB Output is correct
46 Correct 119 ms 4780 KB Output is correct
47 Correct 878 ms 7120 KB Output is correct
48 Correct 1660 ms 6984 KB Output is correct
49 Correct 892 ms 7064 KB Output is correct
50 Correct 848 ms 5868 KB Output is correct
51 Correct 889 ms 5860 KB Output is correct
52 Correct 882 ms 6116 KB Output is correct
53 Correct 1334 ms 6524 KB Output is correct
54 Correct 1308 ms 6528 KB Output is correct
55 Correct 1320 ms 6724 KB Output is correct
56 Correct 869 ms 7084 KB Output is correct
57 Correct 949 ms 7072 KB Output is correct
58 Correct 1906 ms 7068 KB Output is correct
59 Correct 1942 ms 7048 KB Output is correct
60 Correct 1802 ms 7012 KB Output is correct
61 Correct 1708 ms 6964 KB Output is correct
62 Correct 1492 ms 6924 KB Output is correct
63 Correct 1428 ms 6856 KB Output is correct
64 Correct 1697 ms 7076 KB Output is correct
65 Correct 964 ms 6804 KB Output is correct
66 Correct 1485 ms 72788 KB Output is correct
67 Correct 1784 ms 101972 KB Output is correct
68 Correct 1498 ms 70916 KB Output is correct
69 Correct 1093 ms 28176 KB Output is correct
70 Correct 1666 ms 88424 KB Output is correct
71 Correct 1778 ms 90820 KB Output is correct
72 Correct 1772 ms 91336 KB Output is correct
73 Correct 1483 ms 71192 KB Output is correct
74 Correct 1536 ms 71416 KB Output is correct
75 Correct 1576 ms 71724 KB Output is correct
76 Correct 1136 ms 35052 KB Output is correct
77 Correct 1202 ms 33852 KB Output is correct
78 Correct 1122 ms 32156 KB Output is correct
79 Correct 953 ms 18172 KB Output is correct
80 Correct 975 ms 17412 KB Output is correct
81 Correct 981 ms 16940 KB Output is correct
82 Correct 922 ms 16600 KB Output is correct
83 Correct 930 ms 16048 KB Output is correct
84 Correct 916 ms 15480 KB Output is correct
85 Correct 2363 ms 73768 KB Output is correct
86 Correct 225 ms 11348 KB Output is correct
87 Correct 158 ms 15740 KB Output is correct
88 Correct 1334 ms 87240 KB Output is correct
89 Correct 2246 ms 72368 KB Output is correct
90 Correct 1381 ms 96128 KB Output is correct
91 Correct 1559 ms 72960 KB Output is correct
92 Correct 1498 ms 72772 KB Output is correct
93 Correct 2148 ms 110680 KB Output is correct
94 Correct 2024 ms 73568 KB Output is correct
95 Correct 1941 ms 73592 KB Output is correct
96 Correct 2241 ms 114368 KB Output is correct
97 Correct 1098 ms 40484 KB Output is correct
98 Correct 1096 ms 37220 KB Output is correct
99 Correct 2275 ms 75416 KB Output is correct
100 Correct 2415 ms 74332 KB Output is correct
101 Correct 2602 ms 74240 KB Output is correct
102 Correct 2313 ms 74284 KB Output is correct
103 Correct 2485 ms 119956 KB Output is correct
104 Correct 2526 ms 122008 KB Output is correct
105 Correct 1928 ms 49808 KB Output is correct
106 Correct 1458 ms 29568 KB Output is correct
107 Correct 1782 ms 56340 KB Output is correct
108 Correct 2335 ms 112488 KB Output is correct
109 Correct 1664 ms 116172 KB Output is correct