oj.uz

Submission #121471

# Submission time Handle Problem Language Result Execution time Memory
121471 2019-06-26T14:24:23 Z abacaba Bridges (APIO19_bridges) C++14
100 / 100
 2994 ms 12628 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define e first
#define w second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>

struct edge {
	int u, v, w;
	bool operator < (const edge &b) const {
		return w > b.w;
	}
};

struct query {
	int v, w, updatesTillNow, ind;
	bool operator < (const query &b) const {
		return w > b.w;
	}
};

const int block = 500;
const int N = 1e5 + 1;
int n, m, q, ans[N], p[N], sz[N], szedges;
vector <int> g[N];
edge edges[N];
vector <int> was;
edge last[N], back[N];
query qq[N];
pii upd[N];
int szupd, szqq;
edge e[N];
bool used[N], usedupd[N], start[N];

int find(int v) {
	if(v == p[v])
		return v;
	return p[v] = find(p[v]);
}

inline void unio(int a, int b) {
	a = find(a);
	b = find(b);
	if(a != b) {
		if(sz[a] < sz[b])
			swap(a, b);
		p[b] = a;
		sz[a] += sz[b];
	}
}


void dfs(int v, int ind, int w) {
	used[v] = true;
	was.pb(v);
	ans[ind] += sz[v];
	for(int to : g[v])
		if(!used[to])
			dfs(to, ind, w);
}

inline void getrid() {
	szedges = 0;
	for(int i = 0; i < szupd; ++i)
		used[upd[i].e] = true;
	for(int i = 1; i <= m; ++i)
		if(!used[i])
			edges[szedges++] = e[i];
	for(int i = 0; i < szupd; ++i)
		used[upd[i].e] = false;
}


inline void solve() {
	sort(qq, qq + szqq);
	getrid();
	sort(edges, edges + szedges);
	int index = 0;
	for(int i = 1; i <= n; ++i)
		p[i] = i, sz[i] = 1;
	for(int k = 0; k < szqq; ++k) {
		query cur = qq[k];
		while(index < szedges && edges[index].w >= cur.w) {
			unio(edges[index].v, edges[index].u);
			++index;
		}
		for(int i = cur.updatesTillNow - 1; i >= 0; --i) {
			if(!usedupd[upd[i].e]) {
				edge x = e[upd[i].e];
				x.w = upd[i].w;
				int a = find(x.u), b = find(x.v);
				if(x.w >= cur.w && b != a) {
					g[b].pb(a);
					g[a].pb(b);
				}
			}
			usedupd[upd[i].e] = true;
		}
		for(int i = cur.updatesTillNow; i < szupd; ++i) {
			if(!usedupd[upd[i].e]) {
				edge x = back[i];
				int a = find(x.u), b = find(x.v);
				if(x.w >= cur.w && b != a) {
					g[b].pb(a);
					g[a].pb(b);
				}
			}
			usedupd[upd[i].e] = true;
		}

		dfs(find(cur.v), cur.ind, cur.w);

		for(int i = 0; i < szupd; ++i) {
			usedupd[upd[i].e] = false;
			g[find(e[upd[i].e].u)].clear();
			g[find(e[upd[i].e].v)].clear();
		}

		while(!was.empty()) {
			used[was.back()] = false;
			was.ppb();
		}
	}
	for(int i = 0; i < szupd; ++i)
		e[upd[i].e].w = upd[i].w;
	szqq = szupd = 0; 
}


int main() {
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; ++i) {
		scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].w);
		last[i] = e[i];
	}
	scanf("%d", &q);
	for(int i = block - 1; i <= q; i += block)
		start[i] = true;
	for(int i = 1; i <= q; ++i) {
		int c;
		scanf("%d", &c);
		if(c == 1) {
			scanf("%d%d", &upd[szupd].e, &upd[szupd].w);
			back[szupd] = last[upd[szupd].e];
			last[upd[szupd].e] = e[upd[szupd].e];
			last[upd[szupd].e].w = upd[szupd].w;
			++szupd;
		}
		else {
			scanf("%d%d", &qq[szqq].v, &qq[szqq].w);
			qq[szqq].updatesTillNow = szupd;
			qq[szqq].ind = i;
			++szqq;
		}
		if(start[i])
			solve();
	}
	solve();
	for(int i = 1; i <= q; ++i)
		if(ans[i])
			printf("%d\n", ans[i]);
	return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:146:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
bridges.cpp:148:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:151:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
bridges.cpp:156:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &c);
   ~~~~~^~~~~~~~~~
bridges.cpp:158:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &upd[szupd].e, &upd[szupd].w);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:165:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d", &qq[szqq].v, &qq[szqq].w);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2816 KB Output is correct
2 Correct 4 ms 2788 KB Output is correct
3 Correct 25 ms 2956 KB Output is correct
4 Correct 8 ms 2816 KB Output is correct
5 Correct 19 ms 2936 KB Output is correct
6 Correct 21 ms 2932 KB Output is correct
7 Correct 20 ms 2816 KB Output is correct
8 Correct 19 ms 2936 KB Output is correct
9 Correct 21 ms 2816 KB Output is correct
10 Correct 18 ms 2944 KB Output is correct
11 Correct 20 ms 2944 KB Output is correct
12 Correct 17 ms 2944 KB Output is correct
13 Correct 22 ms 2944 KB Output is correct
14 Correct 21 ms 2944 KB Output is correct
15 Correct 22 ms 2944 KB Output is correct
16 Correct 21 ms 2816 KB Output is correct
17 Correct 21 ms 2816 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1488 ms 9788 KB Output is correct
2 Correct 1573 ms 9016 KB Output is correct
3 Correct 1682 ms 9040 KB Output is correct
4 Correct 1638 ms 9168 KB Output is correct
5 Correct 1638 ms 9208 KB Output is correct
6 Correct 1926 ms 8176 KB Output is correct
7 Correct 1821 ms 8248 KB Output is correct
8 Correct 1765 ms 8328 KB Output is correct
9 Correct 48 ms 4600 KB Output is correct
10 Correct 1062 ms 8716 KB Output is correct
11 Correct 1035 ms 8704 KB Output is correct
12 Correct 1347 ms 8200 KB Output is correct
13 Correct 1434 ms 8188 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1151 ms 8056 KB Output is correct
2 Correct 568 ms 5624 KB Output is correct
3 Correct 1197 ms 8048 KB Output is correct
4 Correct 1163 ms 8108 KB Output is correct
5 Correct 46 ms 4600 KB Output is correct
6 Correct 1089 ms 8056 KB Output is correct
7 Correct 1088 ms 7972 KB Output is correct
8 Correct 1058 ms 8060 KB Output is correct
9 Correct 836 ms 7772 KB Output is correct
10 Correct 838 ms 7688 KB Output is correct
11 Correct 955 ms 7920 KB Output is correct
12 Correct 974 ms 8104 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2561 ms 11268 KB Output is correct
2 Correct 44 ms 4728 KB Output is correct
3 Correct 249 ms 8084 KB Output is correct
4 Correct 117 ms 8312 KB Output is correct
5 Correct 1339 ms 10232 KB Output is correct
6 Correct 2383 ms 9976 KB Output is correct
7 Correct 1385 ms 9840 KB Output is correct
8 Correct 1217 ms 8088 KB Output is correct
9 Correct 1281 ms 7928 KB Output is correct
10 Correct 1268 ms 8084 KB Output is correct
11 Correct 1998 ms 9044 KB Output is correct
12 Correct 1865 ms 8952 KB Output is correct
13 Correct 1890 ms 9224 KB Output is correct
14 Correct 1173 ms 10064 KB Output is correct
15 Correct 1253 ms 10132 KB Output is correct
16 Correct 2593 ms 9756 KB Output is correct
17 Correct 2486 ms 9800 KB Output is correct
18 Correct 2456 ms 9908 KB Output is correct
19 Correct 2508 ms 9860 KB Output is correct
20 Correct 2142 ms 9624 KB Output is correct
21 Correct 2128 ms 9444 KB Output is correct
22 Correct 2347 ms 9964 KB Output is correct
23 Correct 1460 ms 9212 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1488 ms 9788 KB Output is correct
2 Correct 1573 ms 9016 KB Output is correct
3 Correct 1682 ms 9040 KB Output is correct
4 Correct 1638 ms 9168 KB Output is correct
5 Correct 1638 ms 9208 KB Output is correct
6 Correct 1926 ms 8176 KB Output is correct
7 Correct 1821 ms 8248 KB Output is correct
8 Correct 1765 ms 8328 KB Output is correct
9 Correct 48 ms 4600 KB Output is correct
10 Correct 1062 ms 8716 KB Output is correct
11 Correct 1035 ms 8704 KB Output is correct
12 Correct 1347 ms 8200 KB Output is correct
13 Correct 1434 ms 8188 KB Output is correct
14 Correct 1151 ms 8056 KB Output is correct
15 Correct 568 ms 5624 KB Output is correct
16 Correct 1197 ms 8048 KB Output is correct
17 Correct 1163 ms 8108 KB Output is correct
18 Correct 46 ms 4600 KB Output is correct
19 Correct 1089 ms 8056 KB Output is correct
20 Correct 1088 ms 7972 KB Output is correct
21 Correct 1058 ms 8060 KB Output is correct
22 Correct 836 ms 7772 KB Output is correct
23 Correct 838 ms 7688 KB Output is correct
24 Correct 955 ms 7920 KB Output is correct
25 Correct 974 ms 8104 KB Output is correct
26 Correct 1617 ms 9068 KB Output is correct
27 Correct 1763 ms 9152 KB Output is correct
28 Correct 1695 ms 9052 KB Output is correct
29 Correct 1631 ms 9064 KB Output is correct
30 Correct 1779 ms 9132 KB Output is correct
31 Correct 1804 ms 9084 KB Output is correct
32 Correct 1830 ms 9056 KB Output is correct
33 Correct 1654 ms 8988 KB Output is correct
34 Correct 1664 ms 9360 KB Output is correct
35 Correct 1624 ms 9472 KB Output is correct
36 Correct 1594 ms 9480 KB Output is correct
37 Correct 1616 ms 9472 KB Output is correct
38 Correct 1601 ms 9404 KB Output is correct
39 Correct 1333 ms 8828 KB Output is correct
40 Correct 1331 ms 8812 KB Output is correct
41 Correct 1317 ms 8804 KB Output is correct
42 Correct 1339 ms 9600 KB Output is correct
43 Correct 1345 ms 9568 KB Output is correct
44 Correct 1363 ms 9620 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2816 KB Output is correct
2 Correct 4 ms 2788 KB Output is correct
3 Correct 25 ms 2956 KB Output is correct
4 Correct 8 ms 2816 KB Output is correct
5 Correct 19 ms 2936 KB Output is correct
6 Correct 21 ms 2932 KB Output is correct
7 Correct 20 ms 2816 KB Output is correct
8 Correct 19 ms 2936 KB Output is correct
9 Correct 21 ms 2816 KB Output is correct
10 Correct 18 ms 2944 KB Output is correct
11 Correct 20 ms 2944 KB Output is correct
12 Correct 17 ms 2944 KB Output is correct
13 Correct 22 ms 2944 KB Output is correct
14 Correct 21 ms 2944 KB Output is correct
15 Correct 22 ms 2944 KB Output is correct
16 Correct 21 ms 2816 KB Output is correct
17 Correct 21 ms 2816 KB Output is correct
18 Correct 1488 ms 9788 KB Output is correct
19 Correct 1573 ms 9016 KB Output is correct
20 Correct 1682 ms 9040 KB Output is correct
21 Correct 1638 ms 9168 KB Output is correct
22 Correct 1638 ms 9208 KB Output is correct
23 Correct 1926 ms 8176 KB Output is correct
24 Correct 1821 ms 8248 KB Output is correct
25 Correct 1765 ms 8328 KB Output is correct
26 Correct 48 ms 4600 KB Output is correct
27 Correct 1062 ms 8716 KB Output is correct
28 Correct 1035 ms 8704 KB Output is correct
29 Correct 1347 ms 8200 KB Output is correct
30 Correct 1434 ms 8188 KB Output is correct
31 Correct 1151 ms 8056 KB Output is correct
32 Correct 568 ms 5624 KB Output is correct
33 Correct 1197 ms 8048 KB Output is correct
34 Correct 1163 ms 8108 KB Output is correct
35 Correct 46 ms 4600 KB Output is correct
36 Correct 1089 ms 8056 KB Output is correct
37 Correct 1088 ms 7972 KB Output is correct
38 Correct 1058 ms 8060 KB Output is correct
39 Correct 836 ms 7772 KB Output is correct
40 Correct 838 ms 7688 KB Output is correct
41 Correct 955 ms 7920 KB Output is correct
42 Correct 974 ms 8104 KB Output is correct
43 Correct 2561 ms 11268 KB Output is correct
44 Correct 44 ms 4728 KB Output is correct
45 Correct 249 ms 8084 KB Output is correct
46 Correct 117 ms 8312 KB Output is correct
47 Correct 1339 ms 10232 KB Output is correct
48 Correct 2383 ms 9976 KB Output is correct
49 Correct 1385 ms 9840 KB Output is correct
50 Correct 1217 ms 8088 KB Output is correct
51 Correct 1281 ms 7928 KB Output is correct
52 Correct 1268 ms 8084 KB Output is correct
53 Correct 1998 ms 9044 KB Output is correct
54 Correct 1865 ms 8952 KB Output is correct
55 Correct 1890 ms 9224 KB Output is correct
56 Correct 1173 ms 10064 KB Output is correct
57 Correct 1253 ms 10132 KB Output is correct
58 Correct 2593 ms 9756 KB Output is correct
59 Correct 2486 ms 9800 KB Output is correct
60 Correct 2456 ms 9908 KB Output is correct
61 Correct 2508 ms 9860 KB Output is correct
62 Correct 2142 ms 9624 KB Output is correct
63 Correct 2128 ms 9444 KB Output is correct
64 Correct 2347 ms 9964 KB Output is correct
65 Correct 1460 ms 9212 KB Output is correct
66 Correct 1617 ms 9068 KB Output is correct
67 Correct 1763 ms 9152 KB Output is correct
68 Correct 1695 ms 9052 KB Output is correct
69 Correct 1631 ms 9064 KB Output is correct
70 Correct 1779 ms 9132 KB Output is correct
71 Correct 1804 ms 9084 KB Output is correct
72 Correct 1830 ms 9056 KB Output is correct
73 Correct 1654 ms 8988 KB Output is correct
74 Correct 1664 ms 9360 KB Output is correct
75 Correct 1624 ms 9472 KB Output is correct
76 Correct 1594 ms 9480 KB Output is correct
77 Correct 1616 ms 9472 KB Output is correct
78 Correct 1601 ms 9404 KB Output is correct
79 Correct 1333 ms 8828 KB Output is correct
80 Correct 1331 ms 8812 KB Output is correct
81 Correct 1317 ms 8804 KB Output is correct
82 Correct 1339 ms 9600 KB Output is correct
83 Correct 1345 ms 9568 KB Output is correct
84 Correct 1363 ms 9620 KB Output is correct
85 Correct 2806 ms 11532 KB Output is correct
86 Correct 263 ms 8468 KB Output is correct
87 Correct 127 ms 8440 KB Output is correct
88 Correct 1615 ms 10828 KB Output is correct
89 Correct 2675 ms 12332 KB Output is correct
90 Correct 1698 ms 10420 KB Output is correct
91 Correct 1649 ms 9648 KB Output is correct
92 Correct 1623 ms 9840 KB Output is correct
93 Correct 1649 ms 8856 KB Output is correct
94 Correct 2490 ms 10908 KB Output is correct
95 Correct 2315 ms 11084 KB Output is correct
96 Correct 2216 ms 9964 KB Output is correct
97 Correct 1395 ms 10204 KB Output is correct
98 Correct 1488 ms 10336 KB Output is correct
99 Correct 2810 ms 12172 KB Output is correct
100 Correct 2994 ms 12276 KB Output is correct
101 Correct 2956 ms 12628 KB Output is correct
102 Correct 2914 ms 12528 KB Output is correct
103 Correct 2374 ms 10152 KB Output is correct
104 Correct 2362 ms 10256 KB Output is correct
105 Correct 2267 ms 10120 KB Output is correct
106 Correct 1982 ms 9720 KB Output is correct
107 Correct 2190 ms 10388 KB Output is correct
108 Correct 2581 ms 11300 KB Output is correct
109 Correct 1575 ms 9080 KB Output is correct