oj.uz

Submission #199239

# Submission time Handle Problem Language Result Execution time Memory
199239 2020-01-30T15:19:48 Z Alexa2001 Bridges (APIO19_bridges) C++17
100 / 100
 2824 ms 20376 KB 
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 2e5 + 5, B = 1044;

struct Edge
{
    int x, y, c;
};

struct Query
{
    int t, x, c;
};

int n, m, nq, lim;
int last[Nmax], nxt[Nmax], prv[Nmax];
Edge edge[Nmax];
Query q[Nmax];
int ans[Nmax];

vector<int> modif, query[Nmax], when[Nmax];


static void read()
{
    int i;
    cin >> n >> m;

    for(i=1; i<=m; ++i)
        cin >> edge[i].x >> edge[i].y >> edge[i].c;

    cin >> nq;
    for(i=1; i<=nq; ++i) cin >> q[i].t >> q[i].x >> q[i].c;

    for(i=1; i<=nq; ++i)
        if(q[i].t == 1)
        {
            prv[i] = last[q[i].x];
            last[q[i].x] = i;
        }

    for(i=1; i<=m; ++i) last[i] = 1e9;

    for(i=nq; i; --i)
        if(q[i].t == 1)
        {
            nxt[i] = last[q[i].x];
            last[q[i].x] = i;
        }

    for(i=1; i<=m; ++i) last[i] = 0;
}

static void normalize()
{
    vector<int> all;
    int i;

    for(i=1; i<=m; ++i) all.push_back(edge[i].c);

    for(i=1; i<=nq; ++i)
        if(q[i].t == 1)
            all.push_back(q[i].c);

    sort(all.begin(), all.end());
    all.erase( unique(all.begin(), all.end()), all.end() );

    lim = all.size();

    for(i=1; i<=m; ++i)
        edge[i].c = lower_bound(all.begin(), all.end(), edge[i].c) - all.begin();

    for(i=1; i<=nq; ++i)
        q[i].c = lower_bound(all.begin(), all.end(), q[i].c) - all.begin();
}



struct DisjDataSet
{
    int t[Nmax];
    int s[Nmax];
    int tip;

    vector<int> who, old_size;

    int boss(int x)
    {
        if(tip == 1)
        {
            while(x != t[x])
            {
                t[x] = t[t[x]];
                x = t[x];
            }
        }
        else
        {
            while(x != t[x]) x = t[x];
        }

        return x;
    }

    void reset()
    {
        int i; tip = -1;
        for(i=1; i<=n; ++i) t[i] = i, s[i] = 1;
    }

    void unite(int x, int y)
    {
        x = boss(x); y = boss(y);
        if(x == y) return;

        if(s[x] > s[y]) swap(x, y);

        if(tip == 2)
            who.push_back(x), old_size.push_back(s[x]);

        t[x] = y;
        s[y] += s[x];
    }

    void undo()
    {
        int i;
        for(i=who.size()-1; i>=0; --i)
            s[t[who[i]]] -= old_size[i], t[who[i]] = who[i];

        who.clear(); old_size.clear();
    }

    int get_size(int x)
    {
        x = boss(x);
        return s[x];
    }

} forest;



static void solve(int start)
{
    int i;

    ///
    modif.clear();
    for(i=0; i<=lim; ++i)
        when[i].clear(), query[i].clear();

    forest.reset();
    ///

    for(i=start; i<start+B && i<=nq; ++i)
        if(q[i].t == 1)
        {
            last[q[i].x] = i;
            modif.push_back(i);
        }
        else query[q[i].c].push_back(i);

    for(i=1; i<=m; ++i)
        if(last[i] < start)
            when[edge[i].c].push_back(i);

    for(i=lim; i>=0; --i)
    {
        ///
        forest.tip = 1;

        for(auto &it : when[i])
            forest.unite(edge[it].x, edge[it].y);
        ///

        forest.tip = 2;
        for(auto &it : query[i])
        {
            for(auto &j : modif)
                if( (j < it && nxt[j] > it && q[j].c >= i) || (prv[j] < start && j > it && edge[q[j].x].c >= i) )
                    forest.unite(edge[q[j].x].x, edge[q[j].x].y);

            ans[it] = forest.get_size(q[it].x);
            forest.undo();
        }
    }

    for(auto &j : modif)
        edge[q[j].x].c = q[j].c;
}

int main()
{
   // freopen("input", "r", stdin);
    cin.sync_with_stdio(false); cin.tie(0);


    read();
    normalize();

    int i;
    for(i=1; i<=nq; i+=B)
        solve(i);

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

    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9848 KB Output is correct
2 Correct 12 ms 9720 KB Output is correct
3 Correct 39 ms 10232 KB Output is correct
4 Correct 17 ms 9976 KB Output is correct
5 Correct 31 ms 10104 KB Output is correct
6 Correct 27 ms 10104 KB Output is correct
7 Correct 42 ms 10104 KB Output is correct
8 Correct 36 ms 10104 KB Output is correct
9 Correct 34 ms 10104 KB Output is correct
10 Correct 42 ms 10104 KB Output is correct
11 Correct 34 ms 10108 KB Output is correct
12 Correct 45 ms 10104 KB Output is correct
13 Correct 42 ms 10080 KB Output is correct
14 Correct 40 ms 10232 KB Output is correct
15 Correct 35 ms 10104 KB Output is correct
16 Correct 40 ms 10104 KB Output is correct
17 Correct 37 ms 10104 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1949 ms 17740 KB Output is correct
2 Correct 2045 ms 17460 KB Output is correct
3 Correct 1990 ms 17792 KB Output is correct
4 Correct 1960 ms 17560 KB Output is correct
5 Correct 2127 ms 17660 KB Output is correct
6 Correct 2782 ms 16876 KB Output is correct
7 Correct 2656 ms 16820 KB Output is correct
8 Correct 2634 ms 16868 KB Output is correct
9 Correct 47 ms 11640 KB Output is correct
10 Correct 1257 ms 14204 KB Output is correct
11 Correct 1127 ms 13828 KB Output is correct
12 Correct 1241 ms 15752 KB Output is correct
13 Correct 1739 ms 17724 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1422 ms 16568 KB Output is correct
2 Correct 1102 ms 14856 KB Output is correct
3 Correct 1673 ms 16468 KB Output is correct
4 Correct 1347 ms 16628 KB Output is correct
5 Correct 45 ms 11512 KB Output is correct
6 Correct 1559 ms 16556 KB Output is correct
7 Correct 1281 ms 16564 KB Output is correct
8 Correct 1073 ms 16288 KB Output is correct
9 Correct 722 ms 15328 KB Output is correct
10 Correct 609 ms 15300 KB Output is correct
11 Correct 1100 ms 17160 KB Output is correct
12 Correct 946 ms 17032 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1779 ms 18608 KB Output is correct
2 Correct 46 ms 11512 KB Output is correct
3 Correct 216 ms 14948 KB Output is correct
4 Correct 65 ms 12384 KB Output is correct
5 Correct 375 ms 14516 KB Output is correct
6 Correct 1703 ms 18528 KB Output is correct
7 Correct 373 ms 14428 KB Output is correct
8 Correct 654 ms 15464 KB Output is correct
9 Correct 659 ms 15528 KB Output is correct
10 Correct 639 ms 14704 KB Output is correct
11 Correct 1152 ms 16984 KB Output is correct
12 Correct 1134 ms 16964 KB Output is correct
13 Correct 1081 ms 15888 KB Output is correct
14 Correct 363 ms 14560 KB Output is correct
15 Correct 374 ms 14560 KB Output is correct
16 Correct 1696 ms 18660 KB Output is correct
17 Correct 1708 ms 18472 KB Output is correct
18 Correct 1739 ms 18524 KB Output is correct
19 Correct 1731 ms 18424 KB Output is correct
20 Correct 1263 ms 16288 KB Output is correct
21 Correct 1263 ms 16236 KB Output is correct
22 Correct 1596 ms 17680 KB Output is correct
23 Correct 425 ms 14160 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1949 ms 17740 KB Output is correct
2 Correct 2045 ms 17460 KB Output is correct
3 Correct 1990 ms 17792 KB Output is correct
4 Correct 1960 ms 17560 KB Output is correct
5 Correct 2127 ms 17660 KB Output is correct
6 Correct 2782 ms 16876 KB Output is correct
7 Correct 2656 ms 16820 KB Output is correct
8 Correct 2634 ms 16868 KB Output is correct
9 Correct 47 ms 11640 KB Output is correct
10 Correct 1257 ms 14204 KB Output is correct
11 Correct 1127 ms 13828 KB Output is correct
12 Correct 1241 ms 15752 KB Output is correct
13 Correct 1739 ms 17724 KB Output is correct
14 Correct 1422 ms 16568 KB Output is correct
15 Correct 1102 ms 14856 KB Output is correct
16 Correct 1673 ms 16468 KB Output is correct
17 Correct 1347 ms 16628 KB Output is correct
18 Correct 45 ms 11512 KB Output is correct
19 Correct 1559 ms 16556 KB Output is correct
20 Correct 1281 ms 16564 KB Output is correct
21 Correct 1073 ms 16288 KB Output is correct
22 Correct 722 ms 15328 KB Output is correct
23 Correct 609 ms 15300 KB Output is correct
24 Correct 1100 ms 17160 KB Output is correct
25 Correct 946 ms 17032 KB Output is correct
26 Correct 1879 ms 17708 KB Output is correct
27 Correct 2143 ms 17276 KB Output is correct
28 Correct 1812 ms 17716 KB Output is correct
29 Correct 1298 ms 17376 KB Output is correct
30 Correct 2131 ms 17532 KB Output is correct
31 Correct 2157 ms 17628 KB Output is correct
32 Correct 2172 ms 17516 KB Output is correct
33 Correct 1829 ms 17500 KB Output is correct
34 Correct 1812 ms 17476 KB Output is correct
35 Correct 1832 ms 17832 KB Output is correct
36 Correct 1449 ms 17420 KB Output is correct
37 Correct 1415 ms 17252 KB Output is correct
38 Correct 1370 ms 17260 KB Output is correct
39 Correct 875 ms 16384 KB Output is correct
40 Correct 875 ms 16284 KB Output is correct
41 Correct 843 ms 16256 KB Output is correct
42 Correct 1366 ms 17852 KB Output is correct
43 Correct 1321 ms 17852 KB Output is correct
44 Correct 1367 ms 18096 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9848 KB Output is correct
2 Correct 12 ms 9720 KB Output is correct
3 Correct 39 ms 10232 KB Output is correct
4 Correct 17 ms 9976 KB Output is correct
5 Correct 31 ms 10104 KB Output is correct
6 Correct 27 ms 10104 KB Output is correct
7 Correct 42 ms 10104 KB Output is correct
8 Correct 36 ms 10104 KB Output is correct
9 Correct 34 ms 10104 KB Output is correct
10 Correct 42 ms 10104 KB Output is correct
11 Correct 34 ms 10108 KB Output is correct
12 Correct 45 ms 10104 KB Output is correct
13 Correct 42 ms 10080 KB Output is correct
14 Correct 40 ms 10232 KB Output is correct
15 Correct 35 ms 10104 KB Output is correct
16 Correct 40 ms 10104 KB Output is correct
17 Correct 37 ms 10104 KB Output is correct
18 Correct 1949 ms 17740 KB Output is correct
19 Correct 2045 ms 17460 KB Output is correct
20 Correct 1990 ms 17792 KB Output is correct
21 Correct 1960 ms 17560 KB Output is correct
22 Correct 2127 ms 17660 KB Output is correct
23 Correct 2782 ms 16876 KB Output is correct
24 Correct 2656 ms 16820 KB Output is correct
25 Correct 2634 ms 16868 KB Output is correct
26 Correct 47 ms 11640 KB Output is correct
27 Correct 1257 ms 14204 KB Output is correct
28 Correct 1127 ms 13828 KB Output is correct
29 Correct 1241 ms 15752 KB Output is correct
30 Correct 1739 ms 17724 KB Output is correct
31 Correct 1422 ms 16568 KB Output is correct
32 Correct 1102 ms 14856 KB Output is correct
33 Correct 1673 ms 16468 KB Output is correct
34 Correct 1347 ms 16628 KB Output is correct
35 Correct 45 ms 11512 KB Output is correct
36 Correct 1559 ms 16556 KB Output is correct
37 Correct 1281 ms 16564 KB Output is correct
38 Correct 1073 ms 16288 KB Output is correct
39 Correct 722 ms 15328 KB Output is correct
40 Correct 609 ms 15300 KB Output is correct
41 Correct 1100 ms 17160 KB Output is correct
42 Correct 946 ms 17032 KB Output is correct
43 Correct 1779 ms 18608 KB Output is correct
44 Correct 46 ms 11512 KB Output is correct
45 Correct 216 ms 14948 KB Output is correct
46 Correct 65 ms 12384 KB Output is correct
47 Correct 375 ms 14516 KB Output is correct
48 Correct 1703 ms 18528 KB Output is correct
49 Correct 373 ms 14428 KB Output is correct
50 Correct 654 ms 15464 KB Output is correct
51 Correct 659 ms 15528 KB Output is correct
52 Correct 639 ms 14704 KB Output is correct
53 Correct 1152 ms 16984 KB Output is correct
54 Correct 1134 ms 16964 KB Output is correct
55 Correct 1081 ms 15888 KB Output is correct
56 Correct 363 ms 14560 KB Output is correct
57 Correct 374 ms 14560 KB Output is correct
58 Correct 1696 ms 18660 KB Output is correct
59 Correct 1708 ms 18472 KB Output is correct
60 Correct 1739 ms 18524 KB Output is correct
61 Correct 1731 ms 18424 KB Output is correct
62 Correct 1263 ms 16288 KB Output is correct
63 Correct 1263 ms 16236 KB Output is correct
64 Correct 1596 ms 17680 KB Output is correct
65 Correct 425 ms 14160 KB Output is correct
66 Correct 1879 ms 17708 KB Output is correct
67 Correct 2143 ms 17276 KB Output is correct
68 Correct 1812 ms 17716 KB Output is correct
69 Correct 1298 ms 17376 KB Output is correct
70 Correct 2131 ms 17532 KB Output is correct
71 Correct 2157 ms 17628 KB Output is correct
72 Correct 2172 ms 17516 KB Output is correct
73 Correct 1829 ms 17500 KB Output is correct
74 Correct 1812 ms 17476 KB Output is correct
75 Correct 1832 ms 17832 KB Output is correct
76 Correct 1449 ms 17420 KB Output is correct
77 Correct 1415 ms 17252 KB Output is correct
78 Correct 1370 ms 17260 KB Output is correct
79 Correct 875 ms 16384 KB Output is correct
80 Correct 875 ms 16284 KB Output is correct
81 Correct 843 ms 16256 KB Output is correct
82 Correct 1366 ms 17852 KB Output is correct
83 Correct 1321 ms 17852 KB Output is correct
84 Correct 1367 ms 18096 KB Output is correct
85 Correct 2788 ms 20092 KB Output is correct
86 Correct 267 ms 14924 KB Output is correct
87 Correct 91 ms 12496 KB Output is correct
88 Correct 742 ms 14996 KB Output is correct
89 Correct 2689 ms 20376 KB Output is correct
90 Correct 749 ms 14992 KB Output is correct
91 Correct 1951 ms 17628 KB Output is correct
92 Correct 1907 ms 17632 KB Output is correct
93 Correct 2770 ms 16676 KB Output is correct
94 Correct 2177 ms 18976 KB Output is correct
95 Correct 2239 ms 18940 KB Output is correct
96 Correct 2338 ms 18164 KB Output is correct
97 Correct 494 ms 15156 KB Output is correct
98 Correct 537 ms 14968 KB Output is correct
99 Correct 2822 ms 20272 KB Output is correct
100 Correct 2652 ms 20376 KB Output is correct
101 Correct 2824 ms 20288 KB Output is correct
102 Correct 2799 ms 20244 KB Output is correct
103 Correct 2406 ms 18544 KB Output is correct
104 Correct 2380 ms 18620 KB Output is correct
105 Correct 2330 ms 19456 KB Output is correct
106 Correct 2058 ms 19284 KB Output is correct
107 Correct 1532 ms 17528 KB Output is correct
108 Correct 2645 ms 19920 KB Output is correct
109 Correct 897 ms 14772 KB Output is correct