oj.uz

Submission #121413

# Submission time Handle Problem Language Result Execution time Memory
121413 2019-06-26T13:44:01 Z abacaba Bridges (APIO19_bridges) C++14
59 / 100
 3000 ms 13136 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 = 500;
const int N = 1e5 + 1;
int n, m, q, ans[N], p[N], sz[N], was[N], szupd, szqq, szwas;
vector <int> g[N];
set <edge> edges;
edge last[N], back[N], e[N];
query qq[N];
pii upd[N];
bool used[N], usedupd[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) {
	used[v] = true;
	was[szwas++] = v;
	ans[ind] += sz[v];
	for(int to : g[v])
		if(!used[to])
			dfs(to, ind);
}


inline void solve() {
	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);

		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(szwas)
			used[was[--szwas]] = false;
	}
	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; 
}

bool start[N];

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) {
		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:136: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:138: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:143:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
bridges.cpp:148:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &c);
   ~~~~~^~~~~~~~~~
bridges.cpp:150: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:157: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 2816 KB Output is correct
3 Correct 24 ms 2944 KB Output is correct
4 Correct 13 ms 2816 KB Output is correct
5 Correct 21 ms 2816 KB Output is correct
6 Correct 19 ms 2816 KB Output is correct
7 Correct 22 ms 2720 KB Output is correct
8 Correct 20 ms 2816 KB Output is correct
9 Correct 23 ms 2816 KB Output is correct
10 Correct 20 ms 2816 KB Output is correct
11 Correct 19 ms 2816 KB Output is correct
12 Correct 21 ms 2816 KB Output is correct
13 Correct 24 ms 2816 KB Output is correct
14 Correct 29 ms 2816 KB Output is correct
15 Correct 23 ms 2816 KB Output is correct
16 Correct 20 ms 2816 KB Output is correct
17 Correct 20 ms 2816 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1579 ms 9932 KB Output is correct
2 Correct 1593 ms 10048 KB Output is correct
3 Correct 1536 ms 10104 KB Output is correct
4 Correct 1421 ms 9848 KB Output is correct
5 Correct 1435 ms 10000 KB Output is correct
6 Correct 1676 ms 9096 KB Output is correct
7 Correct 1479 ms 9060 KB Output is correct
8 Correct 1425 ms 9300 KB Output is correct
9 Correct 44 ms 3448 KB Output is correct
10 Correct 1183 ms 9848 KB Output is correct
11 Correct 1113 ms 10092 KB Output is correct
12 Correct 969 ms 9208 KB Output is correct
13 Correct 1227 ms 9272 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1050 ms 7940 KB Output is correct
2 Correct 494 ms 4592 KB Output is correct
3 Correct 977 ms 8048 KB Output is correct
4 Correct 908 ms 7928 KB Output is correct
5 Correct 44 ms 3448 KB Output is correct
6 Correct 1113 ms 7912 KB Output is correct
7 Correct 922 ms 7900 KB Output is correct
8 Correct 913 ms 7772 KB Output is correct
9 Correct 525 ms 7416 KB Output is correct
10 Correct 598 ms 7416 KB Output is correct
11 Correct 844 ms 7948 KB Output is correct
12 Correct 718 ms 7712 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3022 ms 13136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1579 ms 9932 KB Output is correct
2 Correct 1593 ms 10048 KB Output is correct
3 Correct 1536 ms 10104 KB Output is correct
4 Correct 1421 ms 9848 KB Output is correct
5 Correct 1435 ms 10000 KB Output is correct
6 Correct 1676 ms 9096 KB Output is correct
7 Correct 1479 ms 9060 KB Output is correct
8 Correct 1425 ms 9300 KB Output is correct
9 Correct 44 ms 3448 KB Output is correct
10 Correct 1183 ms 9848 KB Output is correct
11 Correct 1113 ms 10092 KB Output is correct
12 Correct 969 ms 9208 KB Output is correct
13 Correct 1227 ms 9272 KB Output is correct
14 Correct 1050 ms 7940 KB Output is correct
15 Correct 494 ms 4592 KB Output is correct
16 Correct 977 ms 8048 KB Output is correct
17 Correct 908 ms 7928 KB Output is correct
18 Correct 44 ms 3448 KB Output is correct
19 Correct 1113 ms 7912 KB Output is correct
20 Correct 922 ms 7900 KB Output is correct
21 Correct 913 ms 7772 KB Output is correct
22 Correct 525 ms 7416 KB Output is correct
23 Correct 598 ms 7416 KB Output is correct
24 Correct 844 ms 7948 KB Output is correct
25 Correct 718 ms 7712 KB Output is correct
26 Correct 1859 ms 10044 KB Output is correct
27 Correct 2174 ms 9908 KB Output is correct
28 Correct 1874 ms 9976 KB Output is correct
29 Correct 1609 ms 9852 KB Output is correct
30 Correct 2023 ms 10076 KB Output is correct
31 Correct 2178 ms 9912 KB Output is correct
32 Correct 1913 ms 9976 KB Output is correct
33 Correct 2045 ms 9912 KB Output is correct
34 Correct 1953 ms 9948 KB Output is correct
35 Correct 1873 ms 10064 KB Output is correct
36 Correct 1735 ms 9824 KB Output is correct
37 Correct 1998 ms 9832 KB Output is correct
38 Correct 1702 ms 9996 KB Output is correct
39 Correct 1489 ms 9208 KB Output is correct
40 Correct 1237 ms 9288 KB Output is correct
41 Correct 1177 ms 9356 KB Output is correct
42 Correct 1544 ms 10120 KB Output is correct
43 Correct 1866 ms 9956 KB Output is correct
44 Correct 1758 ms 9976 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2816 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 24 ms 2944 KB Output is correct
4 Correct 13 ms 2816 KB Output is correct
5 Correct 21 ms 2816 KB Output is correct
6 Correct 19 ms 2816 KB Output is correct
7 Correct 22 ms 2720 KB Output is correct
8 Correct 20 ms 2816 KB Output is correct
9 Correct 23 ms 2816 KB Output is correct
10 Correct 20 ms 2816 KB Output is correct
11 Correct 19 ms 2816 KB Output is correct
12 Correct 21 ms 2816 KB Output is correct
13 Correct 24 ms 2816 KB Output is correct
14 Correct 29 ms 2816 KB Output is correct
15 Correct 23 ms 2816 KB Output is correct
16 Correct 20 ms 2816 KB Output is correct
17 Correct 20 ms 2816 KB Output is correct
18 Correct 1579 ms 9932 KB Output is correct
19 Correct 1593 ms 10048 KB Output is correct
20 Correct 1536 ms 10104 KB Output is correct
21 Correct 1421 ms 9848 KB Output is correct
22 Correct 1435 ms 10000 KB Output is correct
23 Correct 1676 ms 9096 KB Output is correct
24 Correct 1479 ms 9060 KB Output is correct
25 Correct 1425 ms 9300 KB Output is correct
26 Correct 44 ms 3448 KB Output is correct
27 Correct 1183 ms 9848 KB Output is correct
28 Correct 1113 ms 10092 KB Output is correct
29 Correct 969 ms 9208 KB Output is correct
30 Correct 1227 ms 9272 KB Output is correct
31 Correct 1050 ms 7940 KB Output is correct
32 Correct 494 ms 4592 KB Output is correct
33 Correct 977 ms 8048 KB Output is correct
34 Correct 908 ms 7928 KB Output is correct
35 Correct 44 ms 3448 KB Output is correct
36 Correct 1113 ms 7912 KB Output is correct
37 Correct 922 ms 7900 KB Output is correct
38 Correct 913 ms 7772 KB Output is correct
39 Correct 525 ms 7416 KB Output is correct
40 Correct 598 ms 7416 KB Output is correct
41 Correct 844 ms 7948 KB Output is correct
42 Correct 718 ms 7712 KB Output is correct
43 Execution timed out 3022 ms 13136 KB Time limit exceeded
44 Halted 0 ms 0 KB -