oj.uz

Submission #121426

# Submission time Handle Problem Language Result Execution time Memory
121426 2019-06-26T14:01:01 Z abacaba Bridges (APIO19_bridges) C++17
59 / 100
 3000 ms 13748 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, ind;
	bool operator < (const edge &b) const {
		if(w == b.w)
			return ind > b.ind;
		return w > b.w;
	}
};

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

const int block = 515;
const int N = 1e5 + 1;
int n, m, q, ans[N], p[N], sz[N], szupd, szqq;
vector <int> g[N];
set <edge> edges;
vector <int> was;
edge last[N], back[N];
query qq[N];
pii upd[N];
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);
}

int c;

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];
		e[i].ind = i;
		edges.insert(e[i]);
	}
	scanf("%d", &q);
	for(int i = block - 1; i <= q; i += block)
		start[i] = true;
	for(int i = 1; i <= q; ++i) {
		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;
		}
		if(start[i]) {
			sort(qq, qq + szqq);
			for(int i = 0; i < szupd; ++i)
				edges.erase(e[upd[i].e]);
			set <edge>::iterator it = edges.end();
			if(!edges.empty())
				it = edges.begin();
			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(it != edges.end() && it->w >= cur.w) {
					unio(it->v, it->u);
					++it;
				}
				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 && a != b) {
							g[a].pb(b);
							g[b].pb(a);
						}
					}
					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 && a != b) {
							g[a].pb(b);
							g[b].pb(a);
						}
					}
					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) {
				edges.erase(e[upd[i].e]);
				e[upd[i].e].w = upd[i].w;
				edges.insert(e[upd[i].e]);
			}
			szqq = szupd = 0; 
		}
	}
	sort(qq, qq + szqq);
	for(int i = 0; i < szupd; ++i)
		edges.erase(e[upd[i].e]);
	set <edge>::iterator it = edges.end();
	if(!edges.empty())
		it = edges.begin();
	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(it != edges.end() && it->w >= cur.w) {
			unio(it->v, it->u);
			++it;
		}
		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 && a != b) {
					g[a].pb(b);
					g[b].pb(a);
				}
			}
			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 && a != b) {
					g[a].pb(b);
					g[b].pb(a);
				}
			}
			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) {
		edges.erase(e[upd[i].e]);
		e[upd[i].e].w = upd[i].w;
		edges.insert(e[upd[i].e]);
	}
	szqq = szupd = 0; 
	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:81: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:83: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:88:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
bridges.cpp:92:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &c);
   ~~~~~^~~~~~~~~~
bridges.cpp:94: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:101: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 3 ms 2688 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 26 ms 3044 KB Output is correct
4 Correct 9 ms 2816 KB Output is correct
5 Correct 22 ms 2816 KB Output is correct
6 Correct 21 ms 2816 KB Output is correct
7 Correct 22 ms 2816 KB Output is correct
8 Correct 21 ms 2816 KB Output is correct
9 Correct 24 ms 2816 KB Output is correct
10 Correct 21 ms 2816 KB Output is correct
11 Correct 22 ms 2816 KB Output is correct
12 Correct 20 ms 2816 KB Output is correct
13 Correct 25 ms 2816 KB Output is correct
14 Correct 23 ms 2816 KB Output is correct
15 Correct 24 ms 2816 KB Output is correct
16 Correct 22 ms 2808 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 1857 ms 9868 KB Output is correct
2 Correct 1512 ms 9800 KB Output is correct
3 Correct 1446 ms 9804 KB Output is correct
4 Correct 1431 ms 9896 KB Output is correct
5 Correct 1461 ms 9864 KB Output is correct
6 Correct 1747 ms 8924 KB Output is correct
7 Correct 1690 ms 8924 KB Output is correct
8 Correct 1649 ms 9048 KB Output is correct
9 Correct 45 ms 3320 KB Output is correct
10 Correct 1147 ms 9692 KB Output is correct
11 Correct 1156 ms 9768 KB Output is correct
12 Correct 937 ms 9092 KB Output is correct
13 Correct 1534 ms 9156 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1091 ms 7688 KB Output is correct
2 Correct 584 ms 4580 KB Output is correct
3 Correct 1115 ms 7840 KB Output is correct
4 Correct 867 ms 7664 KB Output is correct
5 Correct 45 ms 3320 KB Output is correct
6 Correct 960 ms 7760 KB Output is correct
7 Correct 984 ms 7832 KB Output is correct
8 Correct 1083 ms 7796 KB Output is correct
9 Correct 568 ms 7384 KB Output is correct
10 Correct 564 ms 7252 KB Output is correct
11 Correct 878 ms 7692 KB Output is correct
12 Correct 728 ms 7736 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2852 ms 13532 KB Output is correct
2 Correct 45 ms 3320 KB Output is correct
3 Correct 306 ms 12152 KB Output is correct
4 Correct 91 ms 12124 KB Output is correct
5 Correct 1362 ms 13500 KB Output is correct
6 Correct 2665 ms 13516 KB Output is correct
7 Correct 2413 ms 13660 KB Output is correct
8 Correct 932 ms 8740 KB Output is correct
9 Correct 1000 ms 8484 KB Output is correct
10 Correct 687 ms 8780 KB Output is correct
11 Correct 2103 ms 10856 KB Output is correct
12 Correct 2145 ms 10984 KB Output is correct
13 Correct 1938 ms 11316 KB Output is correct
14 Correct 1389 ms 13748 KB Output is correct
15 Correct 1479 ms 13636 KB Output is correct
16 Correct 2822 ms 13372 KB Output is correct
17 Correct 2713 ms 13340 KB Output is correct
18 Execution timed out 3005 ms 13456 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1857 ms 9868 KB Output is correct
2 Correct 1512 ms 9800 KB Output is correct
3 Correct 1446 ms 9804 KB Output is correct
4 Correct 1431 ms 9896 KB Output is correct
5 Correct 1461 ms 9864 KB Output is correct
6 Correct 1747 ms 8924 KB Output is correct
7 Correct 1690 ms 8924 KB Output is correct
8 Correct 1649 ms 9048 KB Output is correct
9 Correct 45 ms 3320 KB Output is correct
10 Correct 1147 ms 9692 KB Output is correct
11 Correct 1156 ms 9768 KB Output is correct
12 Correct 937 ms 9092 KB Output is correct
13 Correct 1534 ms 9156 KB Output is correct
14 Correct 1091 ms 7688 KB Output is correct
15 Correct 584 ms 4580 KB Output is correct
16 Correct 1115 ms 7840 KB Output is correct
17 Correct 867 ms 7664 KB Output is correct
18 Correct 45 ms 3320 KB Output is correct
19 Correct 960 ms 7760 KB Output is correct
20 Correct 984 ms 7832 KB Output is correct
21 Correct 1083 ms 7796 KB Output is correct
22 Correct 568 ms 7384 KB Output is correct
23 Correct 564 ms 7252 KB Output is correct
24 Correct 878 ms 7692 KB Output is correct
25 Correct 728 ms 7736 KB Output is correct
26 Correct 1525 ms 9916 KB Output is correct
27 Correct 1650 ms 9804 KB Output is correct
28 Correct 1554 ms 9876 KB Output is correct
29 Correct 1604 ms 9760 KB Output is correct
30 Correct 2113 ms 9800 KB Output is correct
31 Correct 2189 ms 9956 KB Output is correct
32 Correct 1901 ms 9804 KB Output is correct
33 Correct 1711 ms 9836 KB Output is correct
34 Correct 1818 ms 9912 KB Output is correct
35 Correct 1759 ms 9784 KB Output is correct
36 Correct 1493 ms 9796 KB Output is correct
37 Correct 1461 ms 9740 KB Output is correct
38 Correct 1337 ms 9784 KB Output is correct
39 Correct 986 ms 9132 KB Output is correct
40 Correct 934 ms 9232 KB Output is correct
41 Correct 854 ms 9336 KB Output is correct
42 Correct 1273 ms 9964 KB Output is correct
43 Correct 1095 ms 10000 KB Output is correct
44 Correct 1208 ms 9836 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2688 KB Output is correct
2 Correct 3 ms 2688 KB Output is correct
3 Correct 26 ms 3044 KB Output is correct
4 Correct 9 ms 2816 KB Output is correct
5 Correct 22 ms 2816 KB Output is correct
6 Correct 21 ms 2816 KB Output is correct
7 Correct 22 ms 2816 KB Output is correct
8 Correct 21 ms 2816 KB Output is correct
9 Correct 24 ms 2816 KB Output is correct
10 Correct 21 ms 2816 KB Output is correct
11 Correct 22 ms 2816 KB Output is correct
12 Correct 20 ms 2816 KB Output is correct
13 Correct 25 ms 2816 KB Output is correct
14 Correct 23 ms 2816 KB Output is correct
15 Correct 24 ms 2816 KB Output is correct
16 Correct 22 ms 2808 KB Output is correct
17 Correct 21 ms 2816 KB Output is correct
18 Correct 1857 ms 9868 KB Output is correct
19 Correct 1512 ms 9800 KB Output is correct
20 Correct 1446 ms 9804 KB Output is correct
21 Correct 1431 ms 9896 KB Output is correct
22 Correct 1461 ms 9864 KB Output is correct
23 Correct 1747 ms 8924 KB Output is correct
24 Correct 1690 ms 8924 KB Output is correct
25 Correct 1649 ms 9048 KB Output is correct
26 Correct 45 ms 3320 KB Output is correct
27 Correct 1147 ms 9692 KB Output is correct
28 Correct 1156 ms 9768 KB Output is correct
29 Correct 937 ms 9092 KB Output is correct
30 Correct 1534 ms 9156 KB Output is correct
31 Correct 1091 ms 7688 KB Output is correct
32 Correct 584 ms 4580 KB Output is correct
33 Correct 1115 ms 7840 KB Output is correct
34 Correct 867 ms 7664 KB Output is correct
35 Correct 45 ms 3320 KB Output is correct
36 Correct 960 ms 7760 KB Output is correct
37 Correct 984 ms 7832 KB Output is correct
38 Correct 1083 ms 7796 KB Output is correct
39 Correct 568 ms 7384 KB Output is correct
40 Correct 564 ms 7252 KB Output is correct
41 Correct 878 ms 7692 KB Output is correct
42 Correct 728 ms 7736 KB Output is correct
43 Correct 2852 ms 13532 KB Output is correct
44 Correct 45 ms 3320 KB Output is correct
45 Correct 306 ms 12152 KB Output is correct
46 Correct 91 ms 12124 KB Output is correct
47 Correct 1362 ms 13500 KB Output is correct
48 Correct 2665 ms 13516 KB Output is correct
49 Correct 2413 ms 13660 KB Output is correct
50 Correct 932 ms 8740 KB Output is correct
51 Correct 1000 ms 8484 KB Output is correct
52 Correct 687 ms 8780 KB Output is correct
53 Correct 2103 ms 10856 KB Output is correct
54 Correct 2145 ms 10984 KB Output is correct
55 Correct 1938 ms 11316 KB Output is correct
56 Correct 1389 ms 13748 KB Output is correct
57 Correct 1479 ms 13636 KB Output is correct
58 Correct 2822 ms 13372 KB Output is correct
59 Correct 2713 ms 13340 KB Output is correct
60 Execution timed out 3005 ms 13456 KB Time limit exceeded
61 Halted 0 ms 0 KB -