oj.uz

Submission #256005

# Submission time Handle Problem Language Result Execution time Memory
256005 2020-08-02T07:52:48 Z AM1648 Bridges (APIO19_bridges) C++17
100 / 100
 2263 ms 4984 KB 
/* be name khoda */

// #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <fstream>
#include <set>
#include <map>
using namespace std;

#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

#define forifrom(i, s, n) for (ll i = s; i < n; ++i)
#define forirto(i, n, e) for (ll i = (n) - 1; i >= e; --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl

const ll MOD = 1000000007;
const ll INF = 2000000000;
const long long BIG = 1446803456761533460LL;

#define XL (x << 1)
#define XR (XL | 1)
#define MD ((l + r) >> 1)
#define Add(a, b) a = ((a) + (b)) % MOD
#define Mul(a, b) a = (1LL * (a) * (b)) % MOD

// -----------------------------------------------------------------------

const ll maxn = 50010;
const ll maxm = 100010;
const ll SQ = 400;

ll n, m, qn, qm, cm;
pip es[maxm];
ppi qs[maxm], cs[maxm];
ll rt[maxn], sz[maxn], hist[SQ], hn, qt[maxm], es_sort[maxm], lst[maxm];
bool chg[maxm];
ll res[maxm];

ll root(ll x) {
    return rt[x] == x ? x : rt[x] = root(rt[x]);
}

ll roottmp(ll x) {
    return rt[x] == x ? x : roottmp(rt[x]);
}

void merge(ll a, ll b) {
    if (root(a) != root(b)) {
        if (sz[rt[a]] > sz[rt[b]]) swap(a, b);
        sz[rt[b]] += sz[rt[a]];
        rt[rt[a]] = rt[b];
    }
}

void mergetmp(ll a, ll b) {
    ll ra = roottmp(a), rb = roottmp(b);
    if (ra == rb) hist[hn++] = -1;
    else {
        if (sz[ra] > sz[rb]) swap(ra, rb);
        hist[hn++] = ra;
        sz[rb] += sz[ra];
        rt[ra] = rb;
    }
}

void undo() {
    ll x = hist[--hn];
    if (x != -1) {
        sz[rt[x]] -= sz[x];
        rt[x] = x;
    }
}

ll search(ll s, ll w, ll t) {
    forir (i, cm) if (cs[i].S < t && lst[cs[i].F.F] != t + 1) {
        if (cs[i].F.S >= w) {
            auto [a, b] = es[cs[i].F.F].S;
            mergetmp(a, b);
        }
        lst[cs[i].F.F] = t + 1;
    }
    fori (i, cm) if (lst[cs[i].F.F] != t + 1 && es[cs[i].F.F].F >= w) {
        auto [a, b] = es[cs[i].F.F].S;
        mergetmp(a, b);
    }
    ll r = sz[roottmp(s)];
    while (hn) undo();
    return r;
}

void calc() {
    sort(es_sort, es_sort + m, [](const ll a, const ll b) { return es[a].F > es[b].F; });
    sort(qs, qs + qm, greater<ppi>());
    iota(rt, rt + n, 0);
    fill(sz, sz + n, 1);
    fori (i, cm) chg[cs[i].F.F] = 1;
    ll ptr = 0;
    fori (i, m) {
        if (chg[es_sort[i]]) continue;
        while (ptr < qm && qs[ptr].F.F > es[es_sort[i]].F) {
            res[qs[ptr].S] = search(qs[ptr].F.S, qs[ptr].F.F, qs[ptr].S);
            ++ptr;
        }
        auto [a, b] = es[es_sort[i]].S;
        merge(a, b);
    }
    while (ptr < qm) {
        res[qs[ptr].S] = search(qs[ptr].F.S, qs[ptr].F.F, qs[ptr].S);
        ++ptr;
    }
    fori (i, cm) {
        chg[cs[i].F.F] = 0;
        es[cs[i].F.F].F = cs[i].F.S;
    }
    qm = cm = 0;
}

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    cin >> n >> m;
    fori (i, m) {
        ll a, b, w; cin >> a >> b >> w; --a, --b;
        es[i] = {w, {a, b}};
    }
    iota(es_sort, es_sort + m, 0);
    cin >> qn;
    fori (i, qn) {
        ll t, a, b; cin >> t >> a >> b; --a;
        qt[i] = t;
        if (t == 1) {
            cs[cm++] = {{a, b}, i};
        } else {
            qs[qm++] = {{b, a}, i};
        }
        if ((cm + 1) % SQ == 0) calc();
    }
    calc();
    fori (i, qn) if (qt[i] == 2) cout << res[i] << '\n';

}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 23 ms 512 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 23 ms 512 KB Output is correct
6 Correct 24 ms 632 KB Output is correct
7 Correct 24 ms 504 KB Output is correct
8 Correct 22 ms 512 KB Output is correct
9 Correct 29 ms 512 KB Output is correct
10 Correct 23 ms 512 KB Output is correct
11 Correct 23 ms 512 KB Output is correct
12 Correct 24 ms 512 KB Output is correct
13 Correct 30 ms 504 KB Output is correct
14 Correct 29 ms 632 KB Output is correct
15 Correct 26 ms 512 KB Output is correct
16 Correct 26 ms 504 KB Output is correct
17 Correct 25 ms 512 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1208 ms 2708 KB Output is correct
2 Correct 1238 ms 2712 KB Output is correct
3 Correct 1160 ms 2808 KB Output is correct
4 Correct 1305 ms 3008 KB Output is correct
5 Correct 1239 ms 3108 KB Output is correct
6 Correct 1801 ms 2952 KB Output is correct
7 Correct 1820 ms 3176 KB Output is correct
8 Correct 1839 ms 3052 KB Output is correct
9 Correct 42 ms 2552 KB Output is correct
10 Correct 1186 ms 2968 KB Output is correct
11 Correct 1073 ms 2824 KB Output is correct
12 Correct 2263 ms 3404 KB Output is correct
13 Correct 1318 ms 2648 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 920 ms 2168 KB Output is correct
2 Correct 692 ms 1656 KB Output is correct
3 Correct 1089 ms 2296 KB Output is correct
4 Correct 912 ms 2296 KB Output is correct
5 Correct 44 ms 2552 KB Output is correct
6 Correct 1012 ms 2296 KB Output is correct
7 Correct 840 ms 2296 KB Output is correct
8 Correct 731 ms 2428 KB Output is correct
9 Correct 1139 ms 2424 KB Output is correct
10 Correct 831 ms 2680 KB Output is correct
11 Correct 799 ms 2180 KB Output is correct
12 Correct 766 ms 2168 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 4728 KB Output is correct
2 Correct 45 ms 2552 KB Output is correct
3 Correct 48 ms 2120 KB Output is correct
4 Correct 38 ms 2168 KB Output is correct
5 Correct 79 ms 4984 KB Output is correct
6 Correct 96 ms 4728 KB Output is correct
7 Correct 76 ms 4728 KB Output is correct
8 Correct 71 ms 3704 KB Output is correct
9 Correct 71 ms 3704 KB Output is correct
10 Correct 74 ms 3832 KB Output is correct
11 Correct 91 ms 4088 KB Output is correct
12 Correct 86 ms 4088 KB Output is correct
13 Correct 89 ms 4344 KB Output is correct
14 Correct 78 ms 4856 KB Output is correct
15 Correct 81 ms 4808 KB Output is correct
16 Correct 102 ms 4728 KB Output is correct
17 Correct 104 ms 4640 KB Output is correct
18 Correct 101 ms 4612 KB Output is correct
19 Correct 104 ms 4728 KB Output is correct
20 Correct 91 ms 4600 KB Output is correct
21 Correct 90 ms 4600 KB Output is correct
22 Correct 99 ms 4728 KB Output is correct
23 Correct 78 ms 4472 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1208 ms 2708 KB Output is correct
2 Correct 1238 ms 2712 KB Output is correct
3 Correct 1160 ms 2808 KB Output is correct
4 Correct 1305 ms 3008 KB Output is correct
5 Correct 1239 ms 3108 KB Output is correct
6 Correct 1801 ms 2952 KB Output is correct
7 Correct 1820 ms 3176 KB Output is correct
8 Correct 1839 ms 3052 KB Output is correct
9 Correct 42 ms 2552 KB Output is correct
10 Correct 1186 ms 2968 KB Output is correct
11 Correct 1073 ms 2824 KB Output is correct
12 Correct 2263 ms 3404 KB Output is correct
13 Correct 1318 ms 2648 KB Output is correct
14 Correct 920 ms 2168 KB Output is correct
15 Correct 692 ms 1656 KB Output is correct
16 Correct 1089 ms 2296 KB Output is correct
17 Correct 912 ms 2296 KB Output is correct
18 Correct 44 ms 2552 KB Output is correct
19 Correct 1012 ms 2296 KB Output is correct
20 Correct 840 ms 2296 KB Output is correct
21 Correct 731 ms 2428 KB Output is correct
22 Correct 1139 ms 2424 KB Output is correct
23 Correct 831 ms 2680 KB Output is correct
24 Correct 799 ms 2180 KB Output is correct
25 Correct 766 ms 2168 KB Output is correct
26 Correct 1216 ms 2808 KB Output is correct
27 Correct 1439 ms 3064 KB Output is correct
28 Correct 1218 ms 2912 KB Output is correct
29 Correct 925 ms 2936 KB Output is correct
30 Correct 1404 ms 2936 KB Output is correct
31 Correct 1446 ms 2936 KB Output is correct
32 Correct 1443 ms 2936 KB Output is correct
33 Correct 1211 ms 2796 KB Output is correct
34 Correct 1232 ms 2808 KB Output is correct
35 Correct 1216 ms 3064 KB Output is correct
36 Correct 976 ms 3068 KB Output is correct
37 Correct 961 ms 2680 KB Output is correct
38 Correct 944 ms 2808 KB Output is correct
39 Correct 663 ms 2840 KB Output is correct
40 Correct 654 ms 2808 KB Output is correct
41 Correct 628 ms 2808 KB Output is correct
42 Correct 1234 ms 2664 KB Output is correct
43 Correct 1268 ms 2528 KB Output is correct
44 Correct 1232 ms 2544 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 0 ms 384 KB Output is correct
3 Correct 23 ms 512 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 23 ms 512 KB Output is correct
6 Correct 24 ms 632 KB Output is correct
7 Correct 24 ms 504 KB Output is correct
8 Correct 22 ms 512 KB Output is correct
9 Correct 29 ms 512 KB Output is correct
10 Correct 23 ms 512 KB Output is correct
11 Correct 23 ms 512 KB Output is correct
12 Correct 24 ms 512 KB Output is correct
13 Correct 30 ms 504 KB Output is correct
14 Correct 29 ms 632 KB Output is correct
15 Correct 26 ms 512 KB Output is correct
16 Correct 26 ms 504 KB Output is correct
17 Correct 25 ms 512 KB Output is correct
18 Correct 1208 ms 2708 KB Output is correct
19 Correct 1238 ms 2712 KB Output is correct
20 Correct 1160 ms 2808 KB Output is correct
21 Correct 1305 ms 3008 KB Output is correct
22 Correct 1239 ms 3108 KB Output is correct
23 Correct 1801 ms 2952 KB Output is correct
24 Correct 1820 ms 3176 KB Output is correct
25 Correct 1839 ms 3052 KB Output is correct
26 Correct 42 ms 2552 KB Output is correct
27 Correct 1186 ms 2968 KB Output is correct
28 Correct 1073 ms 2824 KB Output is correct
29 Correct 2263 ms 3404 KB Output is correct
30 Correct 1318 ms 2648 KB Output is correct
31 Correct 920 ms 2168 KB Output is correct
32 Correct 692 ms 1656 KB Output is correct
33 Correct 1089 ms 2296 KB Output is correct
34 Correct 912 ms 2296 KB Output is correct
35 Correct 44 ms 2552 KB Output is correct
36 Correct 1012 ms 2296 KB Output is correct
37 Correct 840 ms 2296 KB Output is correct
38 Correct 731 ms 2428 KB Output is correct
39 Correct 1139 ms 2424 KB Output is correct
40 Correct 831 ms 2680 KB Output is correct
41 Correct 799 ms 2180 KB Output is correct
42 Correct 766 ms 2168 KB Output is correct
43 Correct 106 ms 4728 KB Output is correct
44 Correct 45 ms 2552 KB Output is correct
45 Correct 48 ms 2120 KB Output is correct
46 Correct 38 ms 2168 KB Output is correct
47 Correct 79 ms 4984 KB Output is correct
48 Correct 96 ms 4728 KB Output is correct
49 Correct 76 ms 4728 KB Output is correct
50 Correct 71 ms 3704 KB Output is correct
51 Correct 71 ms 3704 KB Output is correct
52 Correct 74 ms 3832 KB Output is correct
53 Correct 91 ms 4088 KB Output is correct
54 Correct 86 ms 4088 KB Output is correct
55 Correct 89 ms 4344 KB Output is correct
56 Correct 78 ms 4856 KB Output is correct
57 Correct 81 ms 4808 KB Output is correct
58 Correct 102 ms 4728 KB Output is correct
59 Correct 104 ms 4640 KB Output is correct
60 Correct 101 ms 4612 KB Output is correct
61 Correct 104 ms 4728 KB Output is correct
62 Correct 91 ms 4600 KB Output is correct
63 Correct 90 ms 4600 KB Output is correct
64 Correct 99 ms 4728 KB Output is correct
65 Correct 78 ms 4472 KB Output is correct
66 Correct 1216 ms 2808 KB Output is correct
67 Correct 1439 ms 3064 KB Output is correct
68 Correct 1218 ms 2912 KB Output is correct
69 Correct 925 ms 2936 KB Output is correct
70 Correct 1404 ms 2936 KB Output is correct
71 Correct 1446 ms 2936 KB Output is correct
72 Correct 1443 ms 2936 KB Output is correct
73 Correct 1211 ms 2796 KB Output is correct
74 Correct 1232 ms 2808 KB Output is correct
75 Correct 1216 ms 3064 KB Output is correct
76 Correct 976 ms 3068 KB Output is correct
77 Correct 961 ms 2680 KB Output is correct
78 Correct 944 ms 2808 KB Output is correct
79 Correct 663 ms 2840 KB Output is correct
80 Correct 654 ms 2808 KB Output is correct
81 Correct 628 ms 2808 KB Output is correct
82 Correct 1234 ms 2664 KB Output is correct
83 Correct 1268 ms 2528 KB Output is correct
84 Correct 1232 ms 2544 KB Output is correct
85 Correct 1697 ms 3896 KB Output is correct
86 Correct 160 ms 2552 KB Output is correct
87 Correct 89 ms 2696 KB Output is correct
88 Correct 1050 ms 4004 KB Output is correct
89 Correct 1692 ms 3940 KB Output is correct
90 Correct 1087 ms 3960 KB Output is correct
91 Correct 1248 ms 2936 KB Output is correct
92 Correct 1275 ms 3192 KB Output is correct
93 Correct 1826 ms 3000 KB Output is correct
94 Correct 1528 ms 3484 KB Output is correct
95 Correct 1565 ms 3648 KB Output is correct
96 Correct 1647 ms 3576 KB Output is correct
97 Correct 694 ms 4216 KB Output is correct
98 Correct 1418 ms 3724 KB Output is correct
99 Correct 1760 ms 3960 KB Output is correct
100 Correct 1745 ms 4028 KB Output is correct
101 Correct 1861 ms 3724 KB Output is correct
102 Correct 1837 ms 3960 KB Output is correct
103 Correct 1666 ms 3684 KB Output is correct
104 Correct 1781 ms 3576 KB Output is correct
105 Correct 2244 ms 3408 KB Output is correct
106 Correct 2068 ms 3032 KB Output is correct
107 Correct 1133 ms 3812 KB Output is correct
108 Correct 1669 ms 3516 KB Output is correct
109 Correct 1134 ms 3420 KB Output is correct