oj.uz

답안 #778030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778030 2023-07-10T03:41:14 Z horiiseun 다리 (APIO19_bridges) C++17
100 / 100
 1494 ms 32024 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
    #define D(...)
#endif
 
const int SIZE = 1008;
 
int n, m, q, u[100005], v[100005], w[100005], t[100005], x[100005], y[100005], ans[100005], par[50005], sz[50005];
stack<int> stk;
vector<int> edge[2005], upd, qry, oth;
bool updated[100005];
 
void init() {
	for (int i = 0; i <= n; i++) {
		par[i] = i;
		sz[i] = 1;
	}
}
 
int find(int x) {
	while (par[x] != x) x = par[x];
	return x;
}
 
void merge(int x, int y) {
	x = find(x);
	y = find(y);
	if (x != y) {
		if (sz[x] < sz[y]) swap(x, y);
		stk.push(y);
		par[y] = par[x];
		sz[x] += sz[y];
	}
}
 
void undo(int x) {
	while (stk.size() > x) {
		int curr = stk.top();
		stk.pop();
		sz[par[curr]] -= sz[curr];
		par[curr] = curr;
	}
}
 
int main() {
 
	ios_base::sync_with_stdio(false);
	cin.tie(0);
 
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> u[i] >> v[i] >> w[i];
	}
 
	cin >> q;
	for (int i = 1; i <= q; i++) {
		cin >> t[i] >> x[i] >> y[i];
	}
	for (int l = 1, r, idx, csz; l <= q; l += SIZE) {
		r = min(q + 1, l + SIZE);
		fill(updated, updated + m + 1, false);
		if (upd.size()) upd.clear();
		if (qry.size()) qry.clear();
		if (oth.size()) oth.clear();
		init();
		for (int i = l; i < r; i++) {
			if (t[i] == 1) {
				updated[x[i]] = true;
				upd.push_back(i);
			} else qry.push_back(i);
		}
		for (int i = 1; i <= m; i++) {
			if (!updated[i]) {
				oth.push_back(i);
			}
		}
		for (int i = l; i < r; i++) {
			if (t[i] == 1) {
				w[x[i]] = y[i];
			} else {
				edge[i - l].clear();
				for (int j : upd) {
					if (w[x[j]] >= y[i]) {
						edge[i - l].push_back(x[j]);
					}
				}	
			}
		}
		sort(qry.begin(), qry.end(), [&](int a, int b) {
			return y[a] > y[b];
		});
		sort(oth.begin(), oth.end(), [&](int a, int b) {
			return w[a] > w[b];
		});
		idx = 0, csz = 0;		
		for (int i : qry) {
			while (idx < oth.size() && w[oth[idx]] >= y[i]) {
				merge(u[oth[idx]], v[oth[idx]]);
				idx++;
			}
			csz = stk.size();
			for (int j : edge[i - l]) {
				merge(u[j], v[j]);
			}
			ans[i] = sz[find(x[i])];
			undo(csz);
		}
	}
 
	for (int i = 1; i <= q; i++) {
		if (t[i] == 2) cout << ans[i] << "\n";
	}
 
}

Compilation message

bridges.cpp: In function 'void undo(int)':
bridges.cpp:146:20: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  146 |  while (stk.size() > x) {
      |         ~~~~~~~~~~~^~~
bridges.cpp: In function 'int main()':
bridges.cpp:206:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  206 |    while (idx < oth.size() && w[oth[idx]] >= y[i]) {
      |           ~~~~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 23 ms 2924 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 24 ms 3356 KB Output is correct
6 Correct 17 ms 2780 KB Output is correct
7 Correct 20 ms 3484 KB Output is correct
8 Correct 27 ms 2772 KB Output is correct
9 Correct 26 ms 4564 KB Output is correct
10 Correct 26 ms 2948 KB Output is correct
11 Correct 30 ms 2860 KB Output is correct
12 Correct 32 ms 2860 KB Output is correct
13 Correct 31 ms 2996 KB Output is correct
14 Correct 31 ms 2788 KB Output is correct
15 Correct 33 ms 2800 KB Output is correct
16 Correct 23 ms 4052 KB Output is correct
17 Correct 25 ms 3740 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 809 ms 28928 KB Output is correct
2 Correct 831 ms 28800 KB Output is correct
3 Correct 856 ms 28792 KB Output is correct
4 Correct 861 ms 28748 KB Output is correct
5 Correct 903 ms 28928 KB Output is correct
6 Correct 967 ms 30468 KB Output is correct
7 Correct 997 ms 30416 KB Output is correct
8 Correct 995 ms 30336 KB Output is correct
9 Correct 30 ms 3540 KB Output is correct
10 Correct 533 ms 29444 KB Output is correct
11 Correct 482 ms 29524 KB Output is correct
12 Correct 741 ms 27104 KB Output is correct
13 Correct 680 ms 30028 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 638 ms 21152 KB Output is correct
2 Correct 366 ms 11324 KB Output is correct
3 Correct 687 ms 22660 KB Output is correct
4 Correct 591 ms 21084 KB Output is correct
5 Correct 26 ms 3496 KB Output is correct
6 Correct 631 ms 21256 KB Output is correct
7 Correct 567 ms 20884 KB Output is correct
8 Correct 514 ms 20720 KB Output is correct
9 Correct 433 ms 19332 KB Output is correct
10 Correct 418 ms 19196 KB Output is correct
11 Correct 497 ms 22140 KB Output is correct
12 Correct 424 ms 22100 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1260 ms 28344 KB Output is correct
2 Correct 29 ms 3416 KB Output is correct
3 Correct 125 ms 4220 KB Output is correct
4 Correct 57 ms 4416 KB Output is correct
5 Correct 619 ms 26896 KB Output is correct
6 Correct 1184 ms 28288 KB Output is correct
7 Correct 585 ms 26824 KB Output is correct
8 Correct 549 ms 26496 KB Output is correct
9 Correct 560 ms 26632 KB Output is correct
10 Correct 554 ms 26444 KB Output is correct
11 Correct 878 ms 27504 KB Output is correct
12 Correct 859 ms 27632 KB Output is correct
13 Correct 886 ms 27580 KB Output is correct
14 Correct 530 ms 26840 KB Output is correct
15 Correct 547 ms 26892 KB Output is correct
16 Correct 1267 ms 28612 KB Output is correct
17 Correct 1208 ms 28400 KB Output is correct
18 Correct 1205 ms 28716 KB Output is correct
19 Correct 1224 ms 28668 KB Output is correct
20 Correct 999 ms 27876 KB Output is correct
21 Correct 1002 ms 27840 KB Output is correct
22 Correct 1168 ms 27944 KB Output is correct
23 Correct 665 ms 24620 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 809 ms 28928 KB Output is correct
2 Correct 831 ms 28800 KB Output is correct
3 Correct 856 ms 28792 KB Output is correct
4 Correct 861 ms 28748 KB Output is correct
5 Correct 903 ms 28928 KB Output is correct
6 Correct 967 ms 30468 KB Output is correct
7 Correct 997 ms 30416 KB Output is correct
8 Correct 995 ms 30336 KB Output is correct
9 Correct 30 ms 3540 KB Output is correct
10 Correct 533 ms 29444 KB Output is correct
11 Correct 482 ms 29524 KB Output is correct
12 Correct 741 ms 27104 KB Output is correct
13 Correct 680 ms 30028 KB Output is correct
14 Correct 638 ms 21152 KB Output is correct
15 Correct 366 ms 11324 KB Output is correct
16 Correct 687 ms 22660 KB Output is correct
17 Correct 591 ms 21084 KB Output is correct
18 Correct 26 ms 3496 KB Output is correct
19 Correct 631 ms 21256 KB Output is correct
20 Correct 567 ms 20884 KB Output is correct
21 Correct 514 ms 20720 KB Output is correct
22 Correct 433 ms 19332 KB Output is correct
23 Correct 418 ms 19196 KB Output is correct
24 Correct 497 ms 22140 KB Output is correct
25 Correct 424 ms 22100 KB Output is correct
26 Correct 801 ms 29068 KB Output is correct
27 Correct 939 ms 30512 KB Output is correct
28 Correct 850 ms 29116 KB Output is correct
29 Correct 684 ms 28408 KB Output is correct
30 Correct 925 ms 30472 KB Output is correct
31 Correct 924 ms 30388 KB Output is correct
32 Correct 934 ms 30404 KB Output is correct
33 Correct 850 ms 29012 KB Output is correct
34 Correct 842 ms 28920 KB Output is correct
35 Correct 859 ms 29028 KB Output is correct
36 Correct 711 ms 28536 KB Output is correct
37 Correct 729 ms 28396 KB Output is correct
38 Correct 711 ms 28380 KB Output is correct
39 Correct 608 ms 27076 KB Output is correct
40 Correct 606 ms 26976 KB Output is correct
41 Correct 640 ms 26960 KB Output is correct
42 Correct 597 ms 29032 KB Output is correct
43 Correct 593 ms 28928 KB Output is correct
44 Correct 630 ms 28736 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 23 ms 2924 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 24 ms 3356 KB Output is correct
6 Correct 17 ms 2780 KB Output is correct
7 Correct 20 ms 3484 KB Output is correct
8 Correct 27 ms 2772 KB Output is correct
9 Correct 26 ms 4564 KB Output is correct
10 Correct 26 ms 2948 KB Output is correct
11 Correct 30 ms 2860 KB Output is correct
12 Correct 32 ms 2860 KB Output is correct
13 Correct 31 ms 2996 KB Output is correct
14 Correct 31 ms 2788 KB Output is correct
15 Correct 33 ms 2800 KB Output is correct
16 Correct 23 ms 4052 KB Output is correct
17 Correct 25 ms 3740 KB Output is correct
18 Correct 809 ms 28928 KB Output is correct
19 Correct 831 ms 28800 KB Output is correct
20 Correct 856 ms 28792 KB Output is correct
21 Correct 861 ms 28748 KB Output is correct
22 Correct 903 ms 28928 KB Output is correct
23 Correct 967 ms 30468 KB Output is correct
24 Correct 997 ms 30416 KB Output is correct
25 Correct 995 ms 30336 KB Output is correct
26 Correct 30 ms 3540 KB Output is correct
27 Correct 533 ms 29444 KB Output is correct
28 Correct 482 ms 29524 KB Output is correct
29 Correct 741 ms 27104 KB Output is correct
30 Correct 680 ms 30028 KB Output is correct
31 Correct 638 ms 21152 KB Output is correct
32 Correct 366 ms 11324 KB Output is correct
33 Correct 687 ms 22660 KB Output is correct
34 Correct 591 ms 21084 KB Output is correct
35 Correct 26 ms 3496 KB Output is correct
36 Correct 631 ms 21256 KB Output is correct
37 Correct 567 ms 20884 KB Output is correct
38 Correct 514 ms 20720 KB Output is correct
39 Correct 433 ms 19332 KB Output is correct
40 Correct 418 ms 19196 KB Output is correct
41 Correct 497 ms 22140 KB Output is correct
42 Correct 424 ms 22100 KB Output is correct
43 Correct 1260 ms 28344 KB Output is correct
44 Correct 29 ms 3416 KB Output is correct
45 Correct 125 ms 4220 KB Output is correct
46 Correct 57 ms 4416 KB Output is correct
47 Correct 619 ms 26896 KB Output is correct
48 Correct 1184 ms 28288 KB Output is correct
49 Correct 585 ms 26824 KB Output is correct
50 Correct 549 ms 26496 KB Output is correct
51 Correct 560 ms 26632 KB Output is correct
52 Correct 554 ms 26444 KB Output is correct
53 Correct 878 ms 27504 KB Output is correct
54 Correct 859 ms 27632 KB Output is correct
55 Correct 886 ms 27580 KB Output is correct
56 Correct 530 ms 26840 KB Output is correct
57 Correct 547 ms 26892 KB Output is correct
58 Correct 1267 ms 28612 KB Output is correct
59 Correct 1208 ms 28400 KB Output is correct
60 Correct 1205 ms 28716 KB Output is correct
61 Correct 1224 ms 28668 KB Output is correct
62 Correct 999 ms 27876 KB Output is correct
63 Correct 1002 ms 27840 KB Output is correct
64 Correct 1168 ms 27944 KB Output is correct
65 Correct 665 ms 24620 KB Output is correct
66 Correct 801 ms 29068 KB Output is correct
67 Correct 939 ms 30512 KB Output is correct
68 Correct 850 ms 29116 KB Output is correct
69 Correct 684 ms 28408 KB Output is correct
70 Correct 925 ms 30472 KB Output is correct
71 Correct 924 ms 30388 KB Output is correct
72 Correct 934 ms 30404 KB Output is correct
73 Correct 850 ms 29012 KB Output is correct
74 Correct 842 ms 28920 KB Output is correct
75 Correct 859 ms 29028 KB Output is correct
76 Correct 711 ms 28536 KB Output is correct
77 Correct 729 ms 28396 KB Output is correct
78 Correct 711 ms 28380 KB Output is correct
79 Correct 608 ms 27076 KB Output is correct
80 Correct 606 ms 26976 KB Output is correct
81 Correct 640 ms 26960 KB Output is correct
82 Correct 597 ms 29032 KB Output is correct
83 Correct 593 ms 28928 KB Output is correct
84 Correct 630 ms 28736 KB Output is correct
85 Correct 1442 ms 30904 KB Output is correct
86 Correct 147 ms 6200 KB Output is correct
87 Correct 77 ms 7472 KB Output is correct
88 Correct 778 ms 30852 KB Output is correct
89 Correct 1446 ms 30756 KB Output is correct
90 Correct 802 ms 30872 KB Output is correct
91 Correct 876 ms 29024 KB Output is correct
92 Correct 862 ms 29004 KB Output is correct
93 Correct 1078 ms 30456 KB Output is correct
94 Correct 1174 ms 30040 KB Output is correct
95 Correct 1240 ms 30152 KB Output is correct
96 Correct 1219 ms 31624 KB Output is correct
97 Correct 685 ms 27496 KB Output is correct
98 Correct 673 ms 30536 KB Output is correct
99 Correct 1467 ms 31084 KB Output is correct
100 Correct 1447 ms 31020 KB Output is correct
101 Correct 1467 ms 31204 KB Output is correct
102 Correct 1494 ms 31144 KB Output is correct
103 Correct 1351 ms 31872 KB Output is correct
104 Correct 1312 ms 32024 KB Output is correct
105 Correct 1141 ms 31584 KB Output is correct
106 Correct 950 ms 31332 KB Output is correct
107 Correct 1138 ms 28612 KB Output is correct
108 Correct 1449 ms 30984 KB Output is correct
109 Correct 919 ms 28500 KB Output is correct