oj.uz

Submission #258291

# Submission time Handle Problem Language Result Execution time Memory
258291 2020-08-05T16:14:43 Z amoo_safar Bridges (APIO19_bridges) C++14
100 / 100
 2945 ms 122788 KB 
// Zende bad Shoma nasime faghat !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const int N = 1e5 + 10;
const int Sq = 700;

int n, m, q, un;
int fr[N], to[N], w[N];
int t[N], a[N], b[N], ans[N];

int mk[N], Tmk = 1;
int mk2[N], Tmk2 = 1;

int par[N], sz[N];
inline int Find(int u){
	if(par[u] == u) return u;
	int w, v = u;
	while(par[u] != u) u = par[u];
	while(v != u){
		w = v;
		v = par[v];
		par[w] = u;
	}
	return u;
}
inline void Unite(int u, int v){
	u = Find(u); v = Find(v);
	if(u == v) return ;
	if(sz[u] > sz[v]) swap(u, v);
	par[u] = v;
	sz[v] += sz[u];
}

vector<int> Ws[N];

vector<int> E[N], Q[N], G[N];

int que[N], lq, rq;

void Solve(int l, int r){

	iota(par, par + n + 1, 0);
	fill(sz, sz + n + 1, 1);
	for(int i = 0; i < un; i++) E[i].clear();
	for(int i = 0; i < un; i++) Q[i].clear();
	Tmk ++;
	//////////////////
	for(int i = l; i < r; i++)
		if(t[i] == 1) mk[a[i]] = Tmk;

	for(int i = 1; i <= m; i++) if(mk[i] != Tmk) E[w[i]].pb(i);
	vector<int> C;
	for(int i = 1; i <= m; i++) if(mk[i] == Tmk) C.pb(i);

	for(int i = l; i < r; i++){
		if(t[i] == 1){
			w[a[i]] = b[i];
		}
		if(t[i] == 2){
			for(auto &x : C) Ws[i].pb(w[x]);
			Q[b[i]].pb(i);
		}
	}

	int ed;
	for(int W = un; W >= 0; W--){
		for(auto &x : E[W]) Unite(fr[x], to[x]);
		for(auto &id : Q[W]){

			for(int i = 0; i < (int) C.size(); i++){
				if(Ws[id][i] < W) continue;
				ed = C[i];
				G[Find(fr[ed])].pb(Find(to[ed]));
				G[Find(to[ed])].pb(Find(fr[ed]));
			}

			Tmk2 ++;

			lq = 0, rq = 1;
			que[0] = Find(a[id]);
			mk2[que[0]] = Tmk2;
			while(lq < rq){
				ans[id] += sz[que[lq]];

				for(auto &adj : G[que[lq]]){
					if(mk2[adj] != Tmk2){
						mk2[adj] = Tmk2;
						que[rq ++] = adj;
					}
				}
				lq ++;
			}
			for(int i = 0; i < (int) C.size(); i++) G[ Find(fr[C[i]]) ].clear();
			for(int i = 0; i < (int) C.size(); i++) G[ Find(to[C[i]]) ].clear();
		}
	}

}

int main(){
	//ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	//cin >> n >> m;
	scanf("%d%d", &n, &m);
	vector<int> V;
	for(int i = 1; i <= m; i++){
		//cin >> fr[i] >> to[i] >> w[i];
		scanf("%d%d%d", fr + i, to + i, w + i);
		//V.pb(w[i]);
	}
	//cin >> q;
	scanf("%d", &q);
	for(int i = 1; i <= q; i++){
		scanf("%d%d%d", t + i, a + i, b + i);
		//cin >> t[i] >> a[i] >> b[i];
		if(t[i] == 2) V.pb(b[i]);	
	}
	V.pb(-1);
	sort(all(V)); V.resize(unique(all(V)) - V.begin());
	for(int i = 1; i <= m; i++)
		w[i] = (upper_bound(all(V), w[i]) - V.begin()) - 1;
	for(int i = 1; i <= q; i++)
		b[i] = (upper_bound(all(V), b[i]) - V.begin()) - 1;

	un = V.size();

	for(int i = 1; i <= q; i += Sq)
		Solve(i, min(q + 1, i + Sq));
	
	for(int i = 1; i <= q; i++) if(t[i] == 2) printf("%d\n", ans[i]); //cout << ans[i] << '\n';
	return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:116: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:120:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", fr + i, to + i, w + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:124:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
bridges.cpp:126:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", t + i, a + i, b + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 89 ms 20012 KB Output is correct
4 Correct 15 ms 10240 KB Output is correct
5 Correct 37 ms 12620 KB Output is correct
6 Correct 36 ms 12668 KB Output is correct
7 Correct 35 ms 12536 KB Output is correct
8 Correct 36 ms 12664 KB Output is correct
9 Correct 42 ms 12536 KB Output is correct
10 Correct 36 ms 12668 KB Output is correct
11 Correct 36 ms 12664 KB Output is correct
12 Correct 37 ms 12664 KB Output is correct
13 Correct 52 ms 15224 KB Output is correct
14 Correct 47 ms 15224 KB Output is correct
15 Correct 39 ms 12664 KB Output is correct
16 Correct 36 ms 12544 KB Output is correct
17 Correct 37 ms 12664 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2360 ms 117960 KB Output is correct
2 Correct 2456 ms 118132 KB Output is correct
3 Correct 2318 ms 118120 KB Output is correct
4 Correct 2196 ms 118156 KB Output is correct
5 Correct 2088 ms 118196 KB Output is correct
6 Correct 2021 ms 116200 KB Output is correct
7 Correct 1915 ms 117004 KB Output is correct
8 Correct 1876 ms 116984 KB Output is correct
9 Correct 147 ms 14960 KB Output is correct
10 Correct 1798 ms 115492 KB Output is correct
11 Correct 1720 ms 115572 KB Output is correct
12 Correct 877 ms 57856 KB Output is correct
13 Correct 841 ms 54716 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1788 ms 117364 KB Output is correct
2 Correct 1305 ms 114768 KB Output is correct
3 Correct 1860 ms 116396 KB Output is correct
4 Correct 1982 ms 117624 KB Output is correct
5 Correct 153 ms 15088 KB Output is correct
6 Correct 1928 ms 117288 KB Output is correct
7 Correct 1755 ms 117260 KB Output is correct
8 Correct 1679 ms 117236 KB Output is correct
9 Correct 1125 ms 59100 KB Output is correct
10 Correct 1073 ms 56576 KB Output is correct
11 Correct 820 ms 54264 KB Output is correct
12 Correct 775 ms 54684 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1521 ms 18828 KB Output is correct
2 Correct 149 ms 14960 KB Output is correct
3 Correct 110 ms 12152 KB Output is correct
4 Correct 75 ms 11764 KB Output is correct
5 Correct 574 ms 14576 KB Output is correct
6 Correct 1598 ms 18588 KB Output is correct
7 Correct 565 ms 14844 KB Output is correct
8 Correct 1123 ms 17260 KB Output is correct
9 Correct 856 ms 17268 KB Output is correct
10 Correct 505 ms 16624 KB Output is correct
11 Correct 1301 ms 17964 KB Output is correct
12 Correct 1280 ms 18124 KB Output is correct
13 Correct 671 ms 17264 KB Output is correct
14 Correct 568 ms 14832 KB Output is correct
15 Correct 616 ms 14704 KB Output is correct
16 Correct 1808 ms 18672 KB Output is correct
17 Correct 1938 ms 18588 KB Output is correct
18 Correct 1650 ms 18700 KB Output is correct
19 Correct 2047 ms 18656 KB Output is correct
20 Correct 745 ms 17444 KB Output is correct
21 Correct 718 ms 17228 KB Output is correct
22 Correct 1142 ms 18156 KB Output is correct
23 Correct 534 ms 14260 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2360 ms 117960 KB Output is correct
2 Correct 2456 ms 118132 KB Output is correct
3 Correct 2318 ms 118120 KB Output is correct
4 Correct 2196 ms 118156 KB Output is correct
5 Correct 2088 ms 118196 KB Output is correct
6 Correct 2021 ms 116200 KB Output is correct
7 Correct 1915 ms 117004 KB Output is correct
8 Correct 1876 ms 116984 KB Output is correct
9 Correct 147 ms 14960 KB Output is correct
10 Correct 1798 ms 115492 KB Output is correct
11 Correct 1720 ms 115572 KB Output is correct
12 Correct 877 ms 57856 KB Output is correct
13 Correct 841 ms 54716 KB Output is correct
14 Correct 1788 ms 117364 KB Output is correct
15 Correct 1305 ms 114768 KB Output is correct
16 Correct 1860 ms 116396 KB Output is correct
17 Correct 1982 ms 117624 KB Output is correct
18 Correct 153 ms 15088 KB Output is correct
19 Correct 1928 ms 117288 KB Output is correct
20 Correct 1755 ms 117260 KB Output is correct
21 Correct 1679 ms 117236 KB Output is correct
22 Correct 1125 ms 59100 KB Output is correct
23 Correct 1073 ms 56576 KB Output is correct
24 Correct 820 ms 54264 KB Output is correct
25 Correct 775 ms 54684 KB Output is correct
26 Correct 2337 ms 117888 KB Output is correct
27 Correct 2434 ms 116812 KB Output is correct
28 Correct 2541 ms 118004 KB Output is correct
29 Correct 2007 ms 117616 KB Output is correct
30 Correct 2623 ms 117376 KB Output is correct
31 Correct 2542 ms 117452 KB Output is correct
32 Correct 2560 ms 117308 KB Output is correct
33 Correct 2475 ms 118116 KB Output is correct
34 Correct 2494 ms 118132 KB Output is correct
35 Correct 2432 ms 118048 KB Output is correct
36 Correct 1922 ms 117876 KB Output is correct
37 Correct 1903 ms 118020 KB Output is correct
38 Correct 1924 ms 117960 KB Output is correct
39 Correct 1469 ms 58628 KB Output is correct
40 Correct 1293 ms 58708 KB Output is correct
41 Correct 1251 ms 58608 KB Output is correct
42 Correct 998 ms 55672 KB Output is correct
43 Correct 986 ms 55544 KB Output is correct
44 Correct 965 ms 55544 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 89 ms 20012 KB Output is correct
4 Correct 15 ms 10240 KB Output is correct
5 Correct 37 ms 12620 KB Output is correct
6 Correct 36 ms 12668 KB Output is correct
7 Correct 35 ms 12536 KB Output is correct
8 Correct 36 ms 12664 KB Output is correct
9 Correct 42 ms 12536 KB Output is correct
10 Correct 36 ms 12668 KB Output is correct
11 Correct 36 ms 12664 KB Output is correct
12 Correct 37 ms 12664 KB Output is correct
13 Correct 52 ms 15224 KB Output is correct
14 Correct 47 ms 15224 KB Output is correct
15 Correct 39 ms 12664 KB Output is correct
16 Correct 36 ms 12544 KB Output is correct
17 Correct 37 ms 12664 KB Output is correct
18 Correct 2360 ms 117960 KB Output is correct
19 Correct 2456 ms 118132 KB Output is correct
20 Correct 2318 ms 118120 KB Output is correct
21 Correct 2196 ms 118156 KB Output is correct
22 Correct 2088 ms 118196 KB Output is correct
23 Correct 2021 ms 116200 KB Output is correct
24 Correct 1915 ms 117004 KB Output is correct
25 Correct 1876 ms 116984 KB Output is correct
26 Correct 147 ms 14960 KB Output is correct
27 Correct 1798 ms 115492 KB Output is correct
28 Correct 1720 ms 115572 KB Output is correct
29 Correct 877 ms 57856 KB Output is correct
30 Correct 841 ms 54716 KB Output is correct
31 Correct 1788 ms 117364 KB Output is correct
32 Correct 1305 ms 114768 KB Output is correct
33 Correct 1860 ms 116396 KB Output is correct
34 Correct 1982 ms 117624 KB Output is correct
35 Correct 153 ms 15088 KB Output is correct
36 Correct 1928 ms 117288 KB Output is correct
37 Correct 1755 ms 117260 KB Output is correct
38 Correct 1679 ms 117236 KB Output is correct
39 Correct 1125 ms 59100 KB Output is correct
40 Correct 1073 ms 56576 KB Output is correct
41 Correct 820 ms 54264 KB Output is correct
42 Correct 775 ms 54684 KB Output is correct
43 Correct 1521 ms 18828 KB Output is correct
44 Correct 149 ms 14960 KB Output is correct
45 Correct 110 ms 12152 KB Output is correct
46 Correct 75 ms 11764 KB Output is correct
47 Correct 574 ms 14576 KB Output is correct
48 Correct 1598 ms 18588 KB Output is correct
49 Correct 565 ms 14844 KB Output is correct
50 Correct 1123 ms 17260 KB Output is correct
51 Correct 856 ms 17268 KB Output is correct
52 Correct 505 ms 16624 KB Output is correct
53 Correct 1301 ms 17964 KB Output is correct
54 Correct 1280 ms 18124 KB Output is correct
55 Correct 671 ms 17264 KB Output is correct
56 Correct 568 ms 14832 KB Output is correct
57 Correct 616 ms 14704 KB Output is correct
58 Correct 1808 ms 18672 KB Output is correct
59 Correct 1938 ms 18588 KB Output is correct
60 Correct 1650 ms 18700 KB Output is correct
61 Correct 2047 ms 18656 KB Output is correct
62 Correct 745 ms 17444 KB Output is correct
63 Correct 718 ms 17228 KB Output is correct
64 Correct 1142 ms 18156 KB Output is correct
65 Correct 534 ms 14260 KB Output is correct
66 Correct 2337 ms 117888 KB Output is correct
67 Correct 2434 ms 116812 KB Output is correct
68 Correct 2541 ms 118004 KB Output is correct
69 Correct 2007 ms 117616 KB Output is correct
70 Correct 2623 ms 117376 KB Output is correct
71 Correct 2542 ms 117452 KB Output is correct
72 Correct 2560 ms 117308 KB Output is correct
73 Correct 2475 ms 118116 KB Output is correct
74 Correct 2494 ms 118132 KB Output is correct
75 Correct 2432 ms 118048 KB Output is correct
76 Correct 1922 ms 117876 KB Output is correct
77 Correct 1903 ms 118020 KB Output is correct
78 Correct 1924 ms 117960 KB Output is correct
79 Correct 1469 ms 58628 KB Output is correct
80 Correct 1293 ms 58708 KB Output is correct
81 Correct 1251 ms 58608 KB Output is correct
82 Correct 998 ms 55672 KB Output is correct
83 Correct 986 ms 55544 KB Output is correct
84 Correct 965 ms 55544 KB Output is correct
85 Correct 2841 ms 119160 KB Output is correct
86 Correct 213 ms 22448 KB Output is correct
87 Correct 190 ms 22000 KB Output is correct
88 Correct 1928 ms 116084 KB Output is correct
89 Correct 2836 ms 118900 KB Output is correct
90 Correct 1891 ms 115768 KB Output is correct
91 Correct 2334 ms 118116 KB Output is correct
92 Correct 2335 ms 118260 KB Output is correct
93 Correct 2202 ms 116972 KB Output is correct
94 Correct 2945 ms 118520 KB Output is correct
95 Correct 2931 ms 118800 KB Output is correct
96 Correct 2231 ms 116664 KB Output is correct
97 Correct 1008 ms 54948 KB Output is correct
98 Correct 1100 ms 55032 KB Output is correct
99 Correct 2835 ms 118772 KB Output is correct
100 Correct 2811 ms 119376 KB Output is correct
101 Correct 2944 ms 118780 KB Output is correct
102 Correct 2825 ms 122788 KB Output is correct
103 Correct 2069 ms 119896 KB Output is correct
104 Correct 2077 ms 119868 KB Output is correct
105 Correct 1144 ms 57944 KB Output is correct
106 Correct 807 ms 37620 KB Output is correct
107 Correct 1189 ms 61236 KB Output is correct
108 Correct 2487 ms 121808 KB Output is correct
109 Correct 1954 ms 116756 KB Output is correct