oj.uz

Submission #251254

# Submission time Handle Problem Language Result Execution time Memory
251254 2020-07-20T16:16:37 Z _7_7_ Bridges (APIO19_bridges) C++14
100 / 100
 2341 ms 5512 KB 
#include <bits/stdc++.h>                                           
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 

using namespace std;
using namespace __gnu_pbds;

//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 

 
 
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 1055;
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 1e5 + 11;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;

int timer;
struct DSU {
	int p[N], cnt[N];
	stack < int > st;

	void init (int n) {
		for (int i = 1; i <= n; ++i) {
			p[i] = i;
			cnt[i] = 1;
		}

		while (sz(st))
			st.pop();
	}	
	int get (int v) { 
		return p[v] == v ? v : get(p[v]);
	}

	void merge (int v, int u) {
		v = get(v), u = get(u);
		if (v == u)
			return;

		if (cnt[v] < cnt[u])
			swap(v, u);   	
		st.push(u);
		p[u] = v;
		cnt[v] += cnt[u];
		++timer;
	}

	void undo () {
		int u = st.top();
		int v = p[u];
		st.pop();
		p[u] = u;
		cnt[v] -= cnt[u];
	}
} T;


vi nw;
vpii prv;
bool was[N];
vector < pair < pii, int > > a, b;
int n, m, q, v[N], u[N], w[N], tp, x, y, ww[N], res[N];

main () {
	fastio
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; ++i) 
		scanf("%d%d%d", &v[i], &u[i], &w[i]);
	
	scanf("%d", &q);
	for (int i = 1; i <= q; ++i) {
		scanf("%d%d%d", &tp, &x, &y);	
		if (tp == 1) 
			a.pb({{x, y}, i});
		else
			b.pb({{y, x}, i});

		if (i % block == 0 || i == q) {
			T.init(n);
			for (int i = 1; i <= m; ++i)
				was[i] = 0;

			for (auto x : a)
				was[x.f.f] = 1;
			sort(all(b));
			reverse(all(b));
			for (int i = 1; i <= m; ++i)
				if (!was[i])
					prv.pb({w[i], i});
				else
					nw.pb(i);	

			sort(all(prv));
			reverse(all(prv));
			int j = 0;

			for (auto x : b) {
				while (j < sz(prv) && prv[j].f >= x.f.f) {
					T.merge(v[prv[j].s], u[prv[j].s]);
					++j;
				}

				for (auto y : nw)
					ww[y] = w[y];

				for (auto y : a)
					if (y.s <= x.s)
						ww[y.f.f] = y.f.s;

				timer = 0;
				for (auto y : nw)
					if (ww[y] >= x.f.f)
						T.merge(v[y], u[y]);

				res[x.s] = T.cnt[T.get(x.f.s)];
				while (timer--)
					T.undo();
			}
			
			for (auto y : a)
				w[y.f.f] = y.f.s;
			
			a.clear();
			b.clear();
			nw.clear();
			prv.clear();	
		}
	}
	
	for (int i = 1; i <= q; ++i)
		if (res[i])
			printf("%d\n", res[i]);
}

Compilation message

bridges.cpp:92:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
bridges.cpp: In function 'int main()':
bridges.cpp:94: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:96:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &v[i], &u[i], &w[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:98:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
bridges.cpp:100:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &tp, &x, &y); 
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 34 ms 688 KB Output is correct
4 Correct 8 ms 640 KB Output is correct
5 Correct 17 ms 640 KB Output is correct
6 Correct 17 ms 640 KB Output is correct
7 Correct 23 ms 512 KB Output is correct
8 Correct 22 ms 640 KB Output is correct
9 Correct 21 ms 512 KB Output is correct
10 Correct 18 ms 640 KB Output is correct
11 Correct 18 ms 640 KB Output is correct
12 Correct 25 ms 640 KB Output is correct
13 Correct 23 ms 640 KB Output is correct
14 Correct 22 ms 640 KB Output is correct
15 Correct 20 ms 640 KB Output is correct
16 Correct 19 ms 512 KB Output is correct
17 Correct 19 ms 512 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1519 ms 2716 KB Output is correct
2 Correct 1488 ms 3452 KB Output is correct
3 Correct 1481 ms 3452 KB Output is correct
4 Correct 1465 ms 3684 KB Output is correct
5 Correct 1502 ms 3588 KB Output is correct
6 Correct 2085 ms 4100 KB Output is correct
7 Correct 2023 ms 4136 KB Output is correct
8 Correct 2069 ms 3684 KB Output is correct
9 Correct 48 ms 1400 KB Output is correct
10 Correct 1449 ms 3404 KB Output is correct
11 Correct 1436 ms 3332 KB Output is correct
12 Correct 1235 ms 4076 KB Output is correct
13 Correct 1157 ms 3580 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1242 ms 2252 KB Output is correct
2 Correct 869 ms 1912 KB Output is correct
3 Correct 1423 ms 2816 KB Output is correct
4 Correct 1174 ms 2824 KB Output is correct
5 Correct 48 ms 1400 KB Output is correct
6 Correct 1367 ms 2800 KB Output is correct
7 Correct 1125 ms 2648 KB Output is correct
8 Correct 983 ms 2696 KB Output is correct
9 Correct 758 ms 2816 KB Output is correct
10 Correct 676 ms 2816 KB Output is correct
11 Correct 766 ms 2688 KB Output is correct
12 Correct 679 ms 2652 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1564 ms 3980 KB Output is correct
2 Correct 48 ms 1656 KB Output is correct
3 Correct 171 ms 3464 KB Output is correct
4 Correct 138 ms 3696 KB Output is correct
5 Correct 1485 ms 5512 KB Output is correct
6 Correct 1468 ms 4936 KB Output is correct
7 Correct 1462 ms 5356 KB Output is correct
8 Correct 758 ms 3716 KB Output is correct
9 Correct 744 ms 3824 KB Output is correct
10 Correct 761 ms 4080 KB Output is correct
11 Correct 1196 ms 4332 KB Output is correct
12 Correct 1123 ms 4332 KB Output is correct
13 Correct 1154 ms 4672 KB Output is correct
14 Correct 1241 ms 5328 KB Output is correct
15 Correct 1364 ms 5352 KB Output is correct
16 Correct 1559 ms 5172 KB Output is correct
17 Correct 1554 ms 5032 KB Output is correct
18 Correct 1551 ms 4948 KB Output is correct
19 Correct 1482 ms 4972 KB Output is correct
20 Correct 1284 ms 4944 KB Output is correct
21 Correct 1282 ms 4960 KB Output is correct
22 Correct 1485 ms 5352 KB Output is correct
23 Correct 1344 ms 4600 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1519 ms 2716 KB Output is correct
2 Correct 1488 ms 3452 KB Output is correct
3 Correct 1481 ms 3452 KB Output is correct
4 Correct 1465 ms 3684 KB Output is correct
5 Correct 1502 ms 3588 KB Output is correct
6 Correct 2085 ms 4100 KB Output is correct
7 Correct 2023 ms 4136 KB Output is correct
8 Correct 2069 ms 3684 KB Output is correct
9 Correct 48 ms 1400 KB Output is correct
10 Correct 1449 ms 3404 KB Output is correct
11 Correct 1436 ms 3332 KB Output is correct
12 Correct 1235 ms 4076 KB Output is correct
13 Correct 1157 ms 3580 KB Output is correct
14 Correct 1242 ms 2252 KB Output is correct
15 Correct 869 ms 1912 KB Output is correct
16 Correct 1423 ms 2816 KB Output is correct
17 Correct 1174 ms 2824 KB Output is correct
18 Correct 48 ms 1400 KB Output is correct
19 Correct 1367 ms 2800 KB Output is correct
20 Correct 1125 ms 2648 KB Output is correct
21 Correct 983 ms 2696 KB Output is correct
22 Correct 758 ms 2816 KB Output is correct
23 Correct 676 ms 2816 KB Output is correct
24 Correct 766 ms 2688 KB Output is correct
25 Correct 679 ms 2652 KB Output is correct
26 Correct 1518 ms 3580 KB Output is correct
27 Correct 1894 ms 3748 KB Output is correct
28 Correct 1686 ms 3616 KB Output is correct
29 Correct 1200 ms 3592 KB Output is correct
30 Correct 1887 ms 3524 KB Output is correct
31 Correct 1883 ms 3628 KB Output is correct
32 Correct 1864 ms 3712 KB Output is correct
33 Correct 1591 ms 3716 KB Output is correct
34 Correct 1622 ms 3648 KB Output is correct
35 Correct 1614 ms 3756 KB Output is correct
36 Correct 1244 ms 3728 KB Output is correct
37 Correct 1255 ms 3792 KB Output is correct
38 Correct 1209 ms 3704 KB Output is correct
39 Correct 931 ms 3928 KB Output is correct
40 Correct 913 ms 3708 KB Output is correct
41 Correct 918 ms 3524 KB Output is correct
42 Correct 936 ms 3452 KB Output is correct
43 Correct 908 ms 3452 KB Output is correct
44 Correct 912 ms 3448 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 34 ms 688 KB Output is correct
4 Correct 8 ms 640 KB Output is correct
5 Correct 17 ms 640 KB Output is correct
6 Correct 17 ms 640 KB Output is correct
7 Correct 23 ms 512 KB Output is correct
8 Correct 22 ms 640 KB Output is correct
9 Correct 21 ms 512 KB Output is correct
10 Correct 18 ms 640 KB Output is correct
11 Correct 18 ms 640 KB Output is correct
12 Correct 25 ms 640 KB Output is correct
13 Correct 23 ms 640 KB Output is correct
14 Correct 22 ms 640 KB Output is correct
15 Correct 20 ms 640 KB Output is correct
16 Correct 19 ms 512 KB Output is correct
17 Correct 19 ms 512 KB Output is correct
18 Correct 1519 ms 2716 KB Output is correct
19 Correct 1488 ms 3452 KB Output is correct
20 Correct 1481 ms 3452 KB Output is correct
21 Correct 1465 ms 3684 KB Output is correct
22 Correct 1502 ms 3588 KB Output is correct
23 Correct 2085 ms 4100 KB Output is correct
24 Correct 2023 ms 4136 KB Output is correct
25 Correct 2069 ms 3684 KB Output is correct
26 Correct 48 ms 1400 KB Output is correct
27 Correct 1449 ms 3404 KB Output is correct
28 Correct 1436 ms 3332 KB Output is correct
29 Correct 1235 ms 4076 KB Output is correct
30 Correct 1157 ms 3580 KB Output is correct
31 Correct 1242 ms 2252 KB Output is correct
32 Correct 869 ms 1912 KB Output is correct
33 Correct 1423 ms 2816 KB Output is correct
34 Correct 1174 ms 2824 KB Output is correct
35 Correct 48 ms 1400 KB Output is correct
36 Correct 1367 ms 2800 KB Output is correct
37 Correct 1125 ms 2648 KB Output is correct
38 Correct 983 ms 2696 KB Output is correct
39 Correct 758 ms 2816 KB Output is correct
40 Correct 676 ms 2816 KB Output is correct
41 Correct 766 ms 2688 KB Output is correct
42 Correct 679 ms 2652 KB Output is correct
43 Correct 1564 ms 3980 KB Output is correct
44 Correct 48 ms 1656 KB Output is correct
45 Correct 171 ms 3464 KB Output is correct
46 Correct 138 ms 3696 KB Output is correct
47 Correct 1485 ms 5512 KB Output is correct
48 Correct 1468 ms 4936 KB Output is correct
49 Correct 1462 ms 5356 KB Output is correct
50 Correct 758 ms 3716 KB Output is correct
51 Correct 744 ms 3824 KB Output is correct
52 Correct 761 ms 4080 KB Output is correct
53 Correct 1196 ms 4332 KB Output is correct
54 Correct 1123 ms 4332 KB Output is correct
55 Correct 1154 ms 4672 KB Output is correct
56 Correct 1241 ms 5328 KB Output is correct
57 Correct 1364 ms 5352 KB Output is correct
58 Correct 1559 ms 5172 KB Output is correct
59 Correct 1554 ms 5032 KB Output is correct
60 Correct 1551 ms 4948 KB Output is correct
61 Correct 1482 ms 4972 KB Output is correct
62 Correct 1284 ms 4944 KB Output is correct
63 Correct 1282 ms 4960 KB Output is correct
64 Correct 1485 ms 5352 KB Output is correct
65 Correct 1344 ms 4600 KB Output is correct
66 Correct 1518 ms 3580 KB Output is correct
67 Correct 1894 ms 3748 KB Output is correct
68 Correct 1686 ms 3616 KB Output is correct
69 Correct 1200 ms 3592 KB Output is correct
70 Correct 1887 ms 3524 KB Output is correct
71 Correct 1883 ms 3628 KB Output is correct
72 Correct 1864 ms 3712 KB Output is correct
73 Correct 1591 ms 3716 KB Output is correct
74 Correct 1622 ms 3648 KB Output is correct
75 Correct 1614 ms 3756 KB Output is correct
76 Correct 1244 ms 3728 KB Output is correct
77 Correct 1255 ms 3792 KB Output is correct
78 Correct 1209 ms 3704 KB Output is correct
79 Correct 931 ms 3928 KB Output is correct
80 Correct 913 ms 3708 KB Output is correct
81 Correct 918 ms 3524 KB Output is correct
82 Correct 936 ms 3452 KB Output is correct
83 Correct 908 ms 3452 KB Output is correct
84 Correct 912 ms 3448 KB Output is correct
85 Correct 2160 ms 4704 KB Output is correct
86 Correct 211 ms 3448 KB Output is correct
87 Correct 171 ms 3464 KB Output is correct
88 Correct 1956 ms 4664 KB Output is correct
89 Correct 2113 ms 4700 KB Output is correct
90 Correct 2044 ms 4340 KB Output is correct
91 Correct 1665 ms 3560 KB Output is correct
92 Correct 1662 ms 3708 KB Output is correct
93 Correct 2341 ms 3688 KB Output is correct
94 Correct 1830 ms 4344 KB Output is correct
95 Correct 1877 ms 4460 KB Output is correct
96 Correct 1930 ms 4480 KB Output is correct
97 Correct 1636 ms 4852 KB Output is correct
98 Correct 1703 ms 4228 KB Output is correct
99 Correct 2101 ms 5248 KB Output is correct
100 Correct 2094 ms 4984 KB Output is correct
101 Correct 2186 ms 5028 KB Output is correct
102 Correct 2177 ms 4992 KB Output is correct
103 Correct 2114 ms 4728 KB Output is correct
104 Correct 2099 ms 4472 KB Output is correct
105 Correct 1651 ms 3960 KB Output is correct
106 Correct 1325 ms 3704 KB Output is correct
107 Correct 1466 ms 4052 KB Output is correct
108 Correct 2053 ms 4148 KB Output is correct
109 Correct 1911 ms 3600 KB Output is correct