oj.uz

Submission #251251

# Submission time Handle Problem Language Result Execution time Memory
251251 2020-07-20T16:13:27 Z _7_7_ Bridges (APIO19_bridges) C++14
100 / 100
 2323 ms 6656 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 == q || i % block == 0) {
			T.init(n);
			for (int i = 1; i <= m; ++i) 
				was[i] = 0;
			
			sort(all(b));
			reverse(all(b));
 
			for (auto x : a)
				was[x.f.f] = 1;
 
			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 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 33 ms 512 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 16 ms 640 KB Output is correct
6 Correct 15 ms 640 KB Output is correct
7 Correct 18 ms 512 KB Output is correct
8 Correct 19 ms 640 KB Output is correct
9 Correct 20 ms 512 KB Output is correct
10 Correct 19 ms 640 KB Output is correct
11 Correct 19 ms 640 KB Output is correct
12 Correct 21 ms 640 KB Output is correct
13 Correct 27 ms 624 KB Output is correct
14 Correct 23 ms 640 KB Output is correct
15 Correct 25 ms 640 KB Output is correct
16 Correct 19 ms 512 KB Output is correct
17 Correct 22 ms 632 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1502 ms 2940 KB Output is correct
2 Correct 1511 ms 4928 KB Output is correct
3 Correct 1501 ms 5116 KB Output is correct
4 Correct 1475 ms 5084 KB Output is correct
5 Correct 1486 ms 4988 KB Output is correct
6 Correct 2082 ms 5116 KB Output is correct
7 Correct 2069 ms 5236 KB Output is correct
8 Correct 2077 ms 5148 KB Output is correct
9 Correct 49 ms 2296 KB Output is correct
10 Correct 1448 ms 4544 KB Output is correct
11 Correct 1438 ms 4580 KB Output is correct
12 Correct 1209 ms 5400 KB Output is correct
13 Correct 1175 ms 5140 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1227 ms 2276 KB Output is correct
2 Correct 874 ms 3068 KB Output is correct
3 Correct 1423 ms 4352 KB Output is correct
4 Correct 1193 ms 4408 KB Output is correct
5 Correct 50 ms 2296 KB Output is correct
6 Correct 1361 ms 4480 KB Output is correct
7 Correct 1113 ms 4360 KB Output is correct
8 Correct 984 ms 4464 KB Output is correct
9 Correct 763 ms 4608 KB Output is correct
10 Correct 682 ms 4352 KB Output is correct
11 Correct 761 ms 4348 KB Output is correct
12 Correct 684 ms 4224 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1482 ms 3960 KB Output is correct
2 Correct 54 ms 1020 KB Output is correct
3 Correct 168 ms 2880 KB Output is correct
4 Correct 137 ms 2800 KB Output is correct
5 Correct 1415 ms 4336 KB Output is correct
6 Correct 1489 ms 3972 KB Output is correct
7 Correct 1411 ms 4196 KB Output is correct
8 Correct 751 ms 2800 KB Output is correct
9 Correct 747 ms 3012 KB Output is correct
10 Correct 756 ms 3056 KB Output is correct
11 Correct 1143 ms 3368 KB Output is correct
12 Correct 1140 ms 3380 KB Output is correct
13 Correct 1195 ms 3472 KB Output is correct
14 Correct 1244 ms 4332 KB Output is correct
15 Correct 1377 ms 4080 KB Output is correct
16 Correct 1532 ms 4200 KB Output is correct
17 Correct 1548 ms 3944 KB Output is correct
18 Correct 1502 ms 3888 KB Output is correct
19 Correct 1476 ms 4080 KB Output is correct
20 Correct 1256 ms 3872 KB Output is correct
21 Correct 1280 ms 3888 KB Output is correct
22 Correct 1419 ms 3948 KB Output is correct
23 Correct 1306 ms 3576 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1502 ms 2940 KB Output is correct
2 Correct 1511 ms 4928 KB Output is correct
3 Correct 1501 ms 5116 KB Output is correct
4 Correct 1475 ms 5084 KB Output is correct
5 Correct 1486 ms 4988 KB Output is correct
6 Correct 2082 ms 5116 KB Output is correct
7 Correct 2069 ms 5236 KB Output is correct
8 Correct 2077 ms 5148 KB Output is correct
9 Correct 49 ms 2296 KB Output is correct
10 Correct 1448 ms 4544 KB Output is correct
11 Correct 1438 ms 4580 KB Output is correct
12 Correct 1209 ms 5400 KB Output is correct
13 Correct 1175 ms 5140 KB Output is correct
14 Correct 1227 ms 2276 KB Output is correct
15 Correct 874 ms 3068 KB Output is correct
16 Correct 1423 ms 4352 KB Output is correct
17 Correct 1193 ms 4408 KB Output is correct
18 Correct 50 ms 2296 KB Output is correct
19 Correct 1361 ms 4480 KB Output is correct
20 Correct 1113 ms 4360 KB Output is correct
21 Correct 984 ms 4464 KB Output is correct
22 Correct 763 ms 4608 KB Output is correct
23 Correct 682 ms 4352 KB Output is correct
24 Correct 761 ms 4348 KB Output is correct
25 Correct 684 ms 4224 KB Output is correct
26 Correct 1528 ms 5140 KB Output is correct
27 Correct 1915 ms 5408 KB Output is correct
28 Correct 1620 ms 5212 KB Output is correct
29 Correct 1174 ms 5000 KB Output is correct
30 Correct 1837 ms 4880 KB Output is correct
31 Correct 1851 ms 4968 KB Output is correct
32 Correct 1885 ms 4996 KB Output is correct
33 Correct 1588 ms 4832 KB Output is correct
34 Correct 1608 ms 4996 KB Output is correct
35 Correct 1608 ms 4992 KB Output is correct
36 Correct 1475 ms 4960 KB Output is correct
37 Correct 1213 ms 4860 KB Output is correct
38 Correct 1217 ms 4892 KB Output is correct
39 Correct 914 ms 4988 KB Output is correct
40 Correct 920 ms 5128 KB Output is correct
41 Correct 893 ms 5252 KB Output is correct
42 Correct 923 ms 4988 KB Output is correct
43 Correct 916 ms 4860 KB Output is correct
44 Correct 916 ms 5020 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 33 ms 512 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 16 ms 640 KB Output is correct
6 Correct 15 ms 640 KB Output is correct
7 Correct 18 ms 512 KB Output is correct
8 Correct 19 ms 640 KB Output is correct
9 Correct 20 ms 512 KB Output is correct
10 Correct 19 ms 640 KB Output is correct
11 Correct 19 ms 640 KB Output is correct
12 Correct 21 ms 640 KB Output is correct
13 Correct 27 ms 624 KB Output is correct
14 Correct 23 ms 640 KB Output is correct
15 Correct 25 ms 640 KB Output is correct
16 Correct 19 ms 512 KB Output is correct
17 Correct 22 ms 632 KB Output is correct
18 Correct 1502 ms 2940 KB Output is correct
19 Correct 1511 ms 4928 KB Output is correct
20 Correct 1501 ms 5116 KB Output is correct
21 Correct 1475 ms 5084 KB Output is correct
22 Correct 1486 ms 4988 KB Output is correct
23 Correct 2082 ms 5116 KB Output is correct
24 Correct 2069 ms 5236 KB Output is correct
25 Correct 2077 ms 5148 KB Output is correct
26 Correct 49 ms 2296 KB Output is correct
27 Correct 1448 ms 4544 KB Output is correct
28 Correct 1438 ms 4580 KB Output is correct
29 Correct 1209 ms 5400 KB Output is correct
30 Correct 1175 ms 5140 KB Output is correct
31 Correct 1227 ms 2276 KB Output is correct
32 Correct 874 ms 3068 KB Output is correct
33 Correct 1423 ms 4352 KB Output is correct
34 Correct 1193 ms 4408 KB Output is correct
35 Correct 50 ms 2296 KB Output is correct
36 Correct 1361 ms 4480 KB Output is correct
37 Correct 1113 ms 4360 KB Output is correct
38 Correct 984 ms 4464 KB Output is correct
39 Correct 763 ms 4608 KB Output is correct
40 Correct 682 ms 4352 KB Output is correct
41 Correct 761 ms 4348 KB Output is correct
42 Correct 684 ms 4224 KB Output is correct
43 Correct 1482 ms 3960 KB Output is correct
44 Correct 54 ms 1020 KB Output is correct
45 Correct 168 ms 2880 KB Output is correct
46 Correct 137 ms 2800 KB Output is correct
47 Correct 1415 ms 4336 KB Output is correct
48 Correct 1489 ms 3972 KB Output is correct
49 Correct 1411 ms 4196 KB Output is correct
50 Correct 751 ms 2800 KB Output is correct
51 Correct 747 ms 3012 KB Output is correct
52 Correct 756 ms 3056 KB Output is correct
53 Correct 1143 ms 3368 KB Output is correct
54 Correct 1140 ms 3380 KB Output is correct
55 Correct 1195 ms 3472 KB Output is correct
56 Correct 1244 ms 4332 KB Output is correct
57 Correct 1377 ms 4080 KB Output is correct
58 Correct 1532 ms 4200 KB Output is correct
59 Correct 1548 ms 3944 KB Output is correct
60 Correct 1502 ms 3888 KB Output is correct
61 Correct 1476 ms 4080 KB Output is correct
62 Correct 1256 ms 3872 KB Output is correct
63 Correct 1280 ms 3888 KB Output is correct
64 Correct 1419 ms 3948 KB Output is correct
65 Correct 1306 ms 3576 KB Output is correct
66 Correct 1528 ms 5140 KB Output is correct
67 Correct 1915 ms 5408 KB Output is correct
68 Correct 1620 ms 5212 KB Output is correct
69 Correct 1174 ms 5000 KB Output is correct
70 Correct 1837 ms 4880 KB Output is correct
71 Correct 1851 ms 4968 KB Output is correct
72 Correct 1885 ms 4996 KB Output is correct
73 Correct 1588 ms 4832 KB Output is correct
74 Correct 1608 ms 4996 KB Output is correct
75 Correct 1608 ms 4992 KB Output is correct
76 Correct 1475 ms 4960 KB Output is correct
77 Correct 1213 ms 4860 KB Output is correct
78 Correct 1217 ms 4892 KB Output is correct
79 Correct 914 ms 4988 KB Output is correct
80 Correct 920 ms 5128 KB Output is correct
81 Correct 893 ms 5252 KB Output is correct
82 Correct 923 ms 4988 KB Output is correct
83 Correct 916 ms 4860 KB Output is correct
84 Correct 916 ms 5020 KB Output is correct
85 Correct 2119 ms 6292 KB Output is correct
86 Correct 209 ms 4856 KB Output is correct
87 Correct 170 ms 4972 KB Output is correct
88 Correct 1941 ms 6620 KB Output is correct
89 Correct 2075 ms 6472 KB Output is correct
90 Correct 1987 ms 6132 KB Output is correct
91 Correct 1651 ms 4988 KB Output is correct
92 Correct 1636 ms 4992 KB Output is correct
93 Correct 2323 ms 5036 KB Output is correct
94 Correct 1815 ms 5720 KB Output is correct
95 Correct 1882 ms 5660 KB Output is correct
96 Correct 1939 ms 5832 KB Output is correct
97 Correct 1564 ms 6412 KB Output is correct
98 Correct 1686 ms 6156 KB Output is correct
99 Correct 2152 ms 6656 KB Output is correct
100 Correct 2094 ms 6532 KB Output is correct
101 Correct 2188 ms 6380 KB Output is correct
102 Correct 2175 ms 6292 KB Output is correct
103 Correct 2165 ms 5852 KB Output is correct
104 Correct 2161 ms 6032 KB Output is correct
105 Correct 1673 ms 6248 KB Output is correct
106 Correct 1341 ms 5696 KB Output is correct
107 Correct 1515 ms 6356 KB Output is correct
108 Correct 2124 ms 6360 KB Output is correct
109 Correct 1872 ms 5500 KB Output is correct