oj.uz

답안 #478762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
478762 2021-10-08T09:02:18 Z Karliver 다리 (APIO19_bridges) C++17
100 / 100
 2414 ms 32596 KB 
    
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()

using ll = long long;
int mod = (ll)1e9 + 7;
#define PI acos(-1)
typedef pair<int, int> pairs;

const int INF = 1e9 + 1;
const int N = 1e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}

const int B = 1000;
int n, m, q;
stack<int> st;

int SI[N], R[N];

void reset() {
    iota(R + 1, R + n + 1, 1);
    fill(SI + 1, SI + n + 1, 1);
}

inline int root(int x) {
    while(x != R[x])x = R[x];
    return x;
}

void merge(int x, int y) {
    x = root(x), y = root(y);
    if(x == y)
        return ;
    if(SI[x] > SI[y])
        swap(x, y);

    st.push(x);
    SI[y] += SI[x];
    R[x] = y;
}

void rollback(int p) {
    while(sz(st) > p) {
        int x = st.top();
        st.pop();
        SI[R[x]] -= SI[x];
        R[x]= x;
    }
}
int u[N], v[N], w[N], t[N], x[N], y[N];
V<int> to_join[B];
bool changed[N];
int ans[N];
void solve() {


    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;l <= q;l += B) {
        int r = min(q + 1, l + B);
        reset();
        fill(changed + 1, changed + m + 1, false);

        V<int> upd, ask, unchanged;

        for(int i = l;i < r;++i) {
            if(t[i] == 1) {
                changed[x[i]] = true;
                upd.push_back(i);
            }
            else ask.push_back(i);
        }
        for(int i = 1;i <= m;++i)if(!changed[i])unchanged.push_back(i);

        for(int i = l;i < r;++i) {
            if(t[i] == 1)w[x[i]] = y[i];
            else {
                to_join[i - l].clear();
                for(int j : upd) if(w[x[j]] >= y[i])to_join[i - l].push_back(x[j]);
            }
        }

        sort(all(ask), [&](int a, int b) {return y[a] > y[b];});
        sort(all(unchanged), [&](int a, int b) {return w[a] > w[b];});

        int pt = 0;
        for(auto i : ask) {
            while(pt < sz(unchanged) && w[unchanged[pt]] >= y[i]) {
                merge(u[unchanged[pt]], v[unchanged[pt]]);
                ++pt;
            }

            int pr = sz(st);

            for(auto j : to_join[i - l]) merge(u[j], v[j]);

            ans[i] = SI[root(x[i])];

            rollback(pr);
        }
    }

    for(int i= 1;i <= q;++i)if(t[i] == 2)cout << ans[i] << '\n';



}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 42 ms 2728 KB Output is correct
4 Correct 5 ms 588 KB Output is correct
5 Correct 42 ms 3024 KB Output is correct
6 Correct 31 ms 2756 KB Output is correct
7 Correct 40 ms 3524 KB Output is correct
8 Correct 41 ms 2732 KB Output is correct
9 Correct 53 ms 4260 KB Output is correct
10 Correct 42 ms 2844 KB Output is correct
11 Correct 43 ms 2780 KB Output is correct
12 Correct 50 ms 2944 KB Output is correct
13 Correct 48 ms 2912 KB Output is correct
14 Correct 44 ms 2708 KB Output is correct
15 Correct 50 ms 2940 KB Output is correct
16 Correct 49 ms 4036 KB Output is correct
17 Correct 47 ms 3464 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1439 ms 26128 KB Output is correct
2 Correct 1410 ms 26280 KB Output is correct
3 Correct 1421 ms 26184 KB Output is correct
4 Correct 1456 ms 26328 KB Output is correct
5 Correct 1476 ms 26396 KB Output is correct
6 Correct 2190 ms 28016 KB Output is correct
7 Correct 2189 ms 27960 KB Output is correct
8 Correct 2187 ms 28064 KB Output is correct
9 Correct 38 ms 1996 KB Output is correct
10 Correct 1231 ms 27936 KB Output is correct
11 Correct 1126 ms 27908 KB Output is correct
12 Correct 1231 ms 24676 KB Output is correct
13 Correct 1289 ms 27456 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1187 ms 18664 KB Output is correct
2 Correct 944 ms 9668 KB Output is correct
3 Correct 1446 ms 20504 KB Output is correct
4 Correct 1167 ms 18912 KB Output is correct
5 Correct 38 ms 2116 KB Output is correct
6 Correct 1342 ms 18820 KB Output is correct
7 Correct 1065 ms 18460 KB Output is correct
8 Correct 942 ms 18300 KB Output is correct
9 Correct 734 ms 17108 KB Output is correct
10 Correct 669 ms 16940 KB Output is correct
11 Correct 810 ms 19800 KB Output is correct
12 Correct 707 ms 19740 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1619 ms 24804 KB Output is correct
2 Correct 37 ms 2096 KB Output is correct
3 Correct 165 ms 2688 KB Output is correct
4 Correct 82 ms 2696 KB Output is correct
5 Correct 846 ms 24812 KB Output is correct
6 Correct 1635 ms 25016 KB Output is correct
7 Correct 814 ms 25000 KB Output is correct
8 Correct 813 ms 23968 KB Output is correct
9 Correct 778 ms 24092 KB Output is correct
10 Correct 790 ms 24148 KB Output is correct
11 Correct 1230 ms 24812 KB Output is correct
12 Correct 1211 ms 24700 KB Output is correct
13 Correct 1234 ms 24904 KB Output is correct
14 Correct 712 ms 24972 KB Output is correct
15 Correct 791 ms 25020 KB Output is correct
16 Correct 1621 ms 25080 KB Output is correct
17 Correct 1631 ms 25092 KB Output is correct
18 Correct 1645 ms 25328 KB Output is correct
19 Correct 1604 ms 25312 KB Output is correct
20 Correct 1341 ms 25180 KB Output is correct
21 Correct 1354 ms 25376 KB Output is correct
22 Correct 1555 ms 24792 KB Output is correct
23 Correct 906 ms 23052 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1439 ms 26128 KB Output is correct
2 Correct 1410 ms 26280 KB Output is correct
3 Correct 1421 ms 26184 KB Output is correct
4 Correct 1456 ms 26328 KB Output is correct
5 Correct 1476 ms 26396 KB Output is correct
6 Correct 2190 ms 28016 KB Output is correct
7 Correct 2189 ms 27960 KB Output is correct
8 Correct 2187 ms 28064 KB Output is correct
9 Correct 38 ms 1996 KB Output is correct
10 Correct 1231 ms 27936 KB Output is correct
11 Correct 1126 ms 27908 KB Output is correct
12 Correct 1231 ms 24676 KB Output is correct
13 Correct 1289 ms 27456 KB Output is correct
14 Correct 1187 ms 18664 KB Output is correct
15 Correct 944 ms 9668 KB Output is correct
16 Correct 1446 ms 20504 KB Output is correct
17 Correct 1167 ms 18912 KB Output is correct
18 Correct 38 ms 2116 KB Output is correct
19 Correct 1342 ms 18820 KB Output is correct
20 Correct 1065 ms 18460 KB Output is correct
21 Correct 942 ms 18300 KB Output is correct
22 Correct 734 ms 17108 KB Output is correct
23 Correct 669 ms 16940 KB Output is correct
24 Correct 810 ms 19800 KB Output is correct
25 Correct 707 ms 19740 KB Output is correct
26 Correct 1535 ms 26296 KB Output is correct
27 Correct 1848 ms 27964 KB Output is correct
28 Correct 1521 ms 26140 KB Output is correct
29 Correct 1080 ms 25656 KB Output is correct
30 Correct 1764 ms 27860 KB Output is correct
31 Correct 1785 ms 27792 KB Output is correct
32 Correct 1816 ms 27872 KB Output is correct
33 Correct 1522 ms 26052 KB Output is correct
34 Correct 1501 ms 25932 KB Output is correct
35 Correct 1526 ms 26064 KB Output is correct
36 Correct 1133 ms 25776 KB Output is correct
37 Correct 1125 ms 25712 KB Output is correct
38 Correct 1197 ms 25756 KB Output is correct
39 Correct 919 ms 24340 KB Output is correct
40 Correct 899 ms 24372 KB Output is correct
41 Correct 902 ms 24376 KB Output is correct
42 Correct 921 ms 26444 KB Output is correct
43 Correct 903 ms 26268 KB Output is correct
44 Correct 889 ms 26232 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 42 ms 2728 KB Output is correct
4 Correct 5 ms 588 KB Output is correct
5 Correct 42 ms 3024 KB Output is correct
6 Correct 31 ms 2756 KB Output is correct
7 Correct 40 ms 3524 KB Output is correct
8 Correct 41 ms 2732 KB Output is correct
9 Correct 53 ms 4260 KB Output is correct
10 Correct 42 ms 2844 KB Output is correct
11 Correct 43 ms 2780 KB Output is correct
12 Correct 50 ms 2944 KB Output is correct
13 Correct 48 ms 2912 KB Output is correct
14 Correct 44 ms 2708 KB Output is correct
15 Correct 50 ms 2940 KB Output is correct
16 Correct 49 ms 4036 KB Output is correct
17 Correct 47 ms 3464 KB Output is correct
18 Correct 1439 ms 26128 KB Output is correct
19 Correct 1410 ms 26280 KB Output is correct
20 Correct 1421 ms 26184 KB Output is correct
21 Correct 1456 ms 26328 KB Output is correct
22 Correct 1476 ms 26396 KB Output is correct
23 Correct 2190 ms 28016 KB Output is correct
24 Correct 2189 ms 27960 KB Output is correct
25 Correct 2187 ms 28064 KB Output is correct
26 Correct 38 ms 1996 KB Output is correct
27 Correct 1231 ms 27936 KB Output is correct
28 Correct 1126 ms 27908 KB Output is correct
29 Correct 1231 ms 24676 KB Output is correct
30 Correct 1289 ms 27456 KB Output is correct
31 Correct 1187 ms 18664 KB Output is correct
32 Correct 944 ms 9668 KB Output is correct
33 Correct 1446 ms 20504 KB Output is correct
34 Correct 1167 ms 18912 KB Output is correct
35 Correct 38 ms 2116 KB Output is correct
36 Correct 1342 ms 18820 KB Output is correct
37 Correct 1065 ms 18460 KB Output is correct
38 Correct 942 ms 18300 KB Output is correct
39 Correct 734 ms 17108 KB Output is correct
40 Correct 669 ms 16940 KB Output is correct
41 Correct 810 ms 19800 KB Output is correct
42 Correct 707 ms 19740 KB Output is correct
43 Correct 1619 ms 24804 KB Output is correct
44 Correct 37 ms 2096 KB Output is correct
45 Correct 165 ms 2688 KB Output is correct
46 Correct 82 ms 2696 KB Output is correct
47 Correct 846 ms 24812 KB Output is correct
48 Correct 1635 ms 25016 KB Output is correct
49 Correct 814 ms 25000 KB Output is correct
50 Correct 813 ms 23968 KB Output is correct
51 Correct 778 ms 24092 KB Output is correct
52 Correct 790 ms 24148 KB Output is correct
53 Correct 1230 ms 24812 KB Output is correct
54 Correct 1211 ms 24700 KB Output is correct
55 Correct 1234 ms 24904 KB Output is correct
56 Correct 712 ms 24972 KB Output is correct
57 Correct 791 ms 25020 KB Output is correct
58 Correct 1621 ms 25080 KB Output is correct
59 Correct 1631 ms 25092 KB Output is correct
60 Correct 1645 ms 25328 KB Output is correct
61 Correct 1604 ms 25312 KB Output is correct
62 Correct 1341 ms 25180 KB Output is correct
63 Correct 1354 ms 25376 KB Output is correct
64 Correct 1555 ms 24792 KB Output is correct
65 Correct 906 ms 23052 KB Output is correct
66 Correct 1535 ms 26296 KB Output is correct
67 Correct 1848 ms 27964 KB Output is correct
68 Correct 1521 ms 26140 KB Output is correct
69 Correct 1080 ms 25656 KB Output is correct
70 Correct 1764 ms 27860 KB Output is correct
71 Correct 1785 ms 27792 KB Output is correct
72 Correct 1816 ms 27872 KB Output is correct
73 Correct 1522 ms 26052 KB Output is correct
74 Correct 1501 ms 25932 KB Output is correct
75 Correct 1526 ms 26064 KB Output is correct
76 Correct 1133 ms 25776 KB Output is correct
77 Correct 1125 ms 25712 KB Output is correct
78 Correct 1197 ms 25756 KB Output is correct
79 Correct 919 ms 24340 KB Output is correct
80 Correct 899 ms 24372 KB Output is correct
81 Correct 902 ms 24376 KB Output is correct
82 Correct 921 ms 26444 KB Output is correct
83 Correct 903 ms 26268 KB Output is correct
84 Correct 889 ms 26232 KB Output is correct
85 Correct 2153 ms 29268 KB Output is correct
86 Correct 223 ms 5880 KB Output is correct
87 Correct 142 ms 6980 KB Output is correct
88 Correct 1350 ms 29752 KB Output is correct
89 Correct 2164 ms 27996 KB Output is correct
90 Correct 1364 ms 29732 KB Output is correct
91 Correct 1581 ms 26920 KB Output is correct
92 Correct 1553 ms 26916 KB Output is correct
93 Correct 2251 ms 28576 KB Output is correct
94 Correct 1829 ms 28276 KB Output is correct
95 Correct 1816 ms 28044 KB Output is correct
96 Correct 2188 ms 29816 KB Output is correct
97 Correct 959 ms 26360 KB Output is correct
98 Correct 1056 ms 29476 KB Output is correct
99 Correct 2170 ms 28596 KB Output is correct
100 Correct 2161 ms 31208 KB Output is correct
101 Correct 2229 ms 31316 KB Output is correct
102 Correct 2200 ms 31320 KB Output is correct
103 Correct 2414 ms 32416 KB Output is correct
104 Correct 2304 ms 32596 KB Output is correct
105 Correct 1766 ms 31988 KB Output is correct
106 Correct 1423 ms 31608 KB Output is correct
107 Correct 1680 ms 28832 KB Output is correct
108 Correct 2275 ms 31144 KB Output is correct
109 Correct 1678 ms 28992 KB Output is correct