oj.uz

답안 #391397

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
391397 2021-04-18T16:52:35 Z phathnv 다리 (APIO19_bridges) C++11
100 / 100
 2594 ms 4576 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 5e4 + 7;
const int M = 1e5 + 7;
const int BLOCK_SIZE = 1200;

struct Edge{
    int u, v, c;
};

struct Query{
    int type, a, b;
};

struct Dsu{
    int root[N], sz[N];
    stack<int> his;
    void init(int n){
        for(int i = 1; i <= n; i++){
            root[i] = i;
            sz[i] = 1;
        }
        while (!his.empty())
            his.pop();
    }
    int findRoot(int u){
        if (u == root[u])
            return u;
        return findRoot(root[u]);
    }
    int getSz(int u){
        return sz[findRoot(u)];
    }
    void unite(int u, int v){
        u = findRoot(u);
        v = findRoot(v);
        if (u == v)
            return;
        if (sz[u] < sz[v])
            swap(u, v);
        root[v] = u;
        sz[u] += sz[v];
        his.push(v);
    }
    int backup(){
        return his.size();
    }
    void rollback(int ver){
        while ((int) his.size() > ver){
            int v = his.top();
            int u = root[v];
            root[v] = v;
            while (true){
                sz[u] -= sz[v];
                if (u == root[u])
                    break;
                u = root[u];
            }
            his.pop();
        }
    }
} dsu;

int n, m, q, ordEdge[M];
Edge eds[M];
bool changed[M];

void Process(const vector<Query> &queries){
    vector<int> ordType2;
    vector<pair<int, int>> changedEdges;
    for(int i = 1; i <= m; i++){
        changed[i] = 0;
        ordEdge[i] = i;
    }
    for(int i = 0; i < (int) queries.size(); i++)
        if (queries[i].type == 2){
            ordType2.push_back(i);
        } else {
            changed[queries[i].a] = 1;
            changedEdges.push_back({queries[i].a, eds[queries[i].a].c});
        }

    sort(ordType2.begin(), ordType2.end(), [&](const int &a, const int &b){
            return queries[a].b > queries[b].b;
        });
    sort(ordEdge + 1, ordEdge + 1 + m, [&](const int &a, const int &b){
            return eds[a].c > eds[b].c;
        });

    dsu.init(n);
    vector<pair<int, int>> answer;
    int ptr = 1;
    for(int ind : ordType2){
        int u = queries[ind].a;
        int c = queries[ind].b;
        while (ptr <= m && eds[ordEdge[ptr]].c >= c){
            if (!changed[ordEdge[ptr]])
                dsu.unite(eds[ordEdge[ptr]].u, eds[ordEdge[ptr]].v);
            ptr++;
        }
        int ver = dsu.backup();
        for(int i = 0; i < ind; i++)
            if (queries[i].type == 1)
                eds[queries[i].a].c = queries[i].b;
        for(auto p : changedEdges){
            if (eds[p.first].c >= c)
                dsu.unite(eds[p.first].u, eds[p.first].v);
        }
        answer.push_back({ind, dsu.getSz(u)});
        for(auto p : changedEdges)
            eds[p.first].c = p.second;
        dsu.rollback(ver);
    }
    sort(answer.begin(), answer.end());
    for(auto p : answer)
        cout << p.second << '\n';
    for(Query q : queries)
        if (q.type == 1)
            eds[q.a].c = q.b;
}

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

    cin >> n >> m;
    for(int i = 1; i <= m; i++)
        cin >> eds[i].u >> eds[i].v >> eds[i].c;
    cin >> q;

    vector<Query> queries;
    for(int i = 1; i <= q; i++){
        Query query;
        cin >> query.type >> query.a >> query.b;
        queries.push_back(query);
        if (queries.size() == BLOCK_SIZE){
            Process(queries);
            queries.clear();
        }
    }
    Process(queries);
    queries.clear();

    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 49 ms 452 KB Output is correct
4 Correct 11 ms 460 KB Output is correct
5 Correct 50 ms 428 KB Output is correct
6 Correct 40 ms 432 KB Output is correct
7 Correct 46 ms 336 KB Output is correct
8 Correct 56 ms 428 KB Output is correct
9 Correct 49 ms 416 KB Output is correct
10 Correct 56 ms 332 KB Output is correct
11 Correct 56 ms 432 KB Output is correct
12 Correct 67 ms 424 KB Output is correct
13 Correct 63 ms 424 KB Output is correct
14 Correct 59 ms 340 KB Output is correct
15 Correct 65 ms 452 KB Output is correct
16 Correct 51 ms 416 KB Output is correct
17 Correct 53 ms 416 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1643 ms 2000 KB Output is correct
2 Correct 1654 ms 1952 KB Output is correct
3 Correct 1665 ms 2048 KB Output is correct
4 Correct 1707 ms 2040 KB Output is correct
5 Correct 1712 ms 2000 KB Output is correct
6 Correct 2539 ms 2112 KB Output is correct
7 Correct 2558 ms 2328 KB Output is correct
8 Correct 2563 ms 2272 KB Output is correct
9 Correct 118 ms 544 KB Output is correct
10 Correct 1570 ms 2100 KB Output is correct
11 Correct 1444 ms 2072 KB Output is correct
12 Correct 1424 ms 2424 KB Output is correct
13 Correct 1374 ms 1972 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1400 ms 1496 KB Output is correct
2 Correct 1192 ms 884 KB Output is correct
3 Correct 1673 ms 1896 KB Output is correct
4 Correct 1368 ms 1584 KB Output is correct
5 Correct 104 ms 576 KB Output is correct
6 Correct 1591 ms 1548 KB Output is correct
7 Correct 1283 ms 1496 KB Output is correct
8 Correct 1101 ms 1452 KB Output is correct
9 Correct 899 ms 1568 KB Output is correct
10 Correct 807 ms 1648 KB Output is correct
11 Correct 851 ms 1488 KB Output is correct
12 Correct 728 ms 1492 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1550 ms 3092 KB Output is correct
2 Correct 114 ms 628 KB Output is correct
3 Correct 168 ms 2024 KB Output is correct
4 Correct 80 ms 1964 KB Output is correct
5 Correct 807 ms 3060 KB Output is correct
6 Correct 1499 ms 3076 KB Output is correct
7 Correct 781 ms 3180 KB Output is correct
8 Correct 779 ms 2012 KB Output is correct
9 Correct 764 ms 1996 KB Output is correct
10 Correct 821 ms 2332 KB Output is correct
11 Correct 1155 ms 2520 KB Output is correct
12 Correct 1147 ms 2592 KB Output is correct
13 Correct 1191 ms 2760 KB Output is correct
14 Correct 686 ms 3248 KB Output is correct
15 Correct 722 ms 3092 KB Output is correct
16 Correct 1506 ms 2964 KB Output is correct
17 Correct 1489 ms 3220 KB Output is correct
18 Correct 1532 ms 3044 KB Output is correct
19 Correct 1548 ms 3256 KB Output is correct
20 Correct 1283 ms 2956 KB Output is correct
21 Correct 1264 ms 3052 KB Output is correct
22 Correct 1443 ms 3212 KB Output is correct
23 Correct 845 ms 3016 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1643 ms 2000 KB Output is correct
2 Correct 1654 ms 1952 KB Output is correct
3 Correct 1665 ms 2048 KB Output is correct
4 Correct 1707 ms 2040 KB Output is correct
5 Correct 1712 ms 2000 KB Output is correct
6 Correct 2539 ms 2112 KB Output is correct
7 Correct 2558 ms 2328 KB Output is correct
8 Correct 2563 ms 2272 KB Output is correct
9 Correct 118 ms 544 KB Output is correct
10 Correct 1570 ms 2100 KB Output is correct
11 Correct 1444 ms 2072 KB Output is correct
12 Correct 1424 ms 2424 KB Output is correct
13 Correct 1374 ms 1972 KB Output is correct
14 Correct 1400 ms 1496 KB Output is correct
15 Correct 1192 ms 884 KB Output is correct
16 Correct 1673 ms 1896 KB Output is correct
17 Correct 1368 ms 1584 KB Output is correct
18 Correct 104 ms 576 KB Output is correct
19 Correct 1591 ms 1548 KB Output is correct
20 Correct 1283 ms 1496 KB Output is correct
21 Correct 1101 ms 1452 KB Output is correct
22 Correct 899 ms 1568 KB Output is correct
23 Correct 807 ms 1648 KB Output is correct
24 Correct 851 ms 1488 KB Output is correct
25 Correct 728 ms 1492 KB Output is correct
26 Correct 1657 ms 2140 KB Output is correct
27 Correct 2121 ms 2108 KB Output is correct
28 Correct 1714 ms 2040 KB Output is correct
29 Correct 1238 ms 2024 KB Output is correct
30 Correct 1994 ms 2028 KB Output is correct
31 Correct 2071 ms 1920 KB Output is correct
32 Correct 2041 ms 2072 KB Output is correct
33 Correct 1713 ms 2076 KB Output is correct
34 Correct 1739 ms 2164 KB Output is correct
35 Correct 1717 ms 2268 KB Output is correct
36 Correct 1296 ms 2168 KB Output is correct
37 Correct 1337 ms 1988 KB Output is correct
38 Correct 1282 ms 2028 KB Output is correct
39 Correct 986 ms 2116 KB Output is correct
40 Correct 993 ms 2160 KB Output is correct
41 Correct 1002 ms 2232 KB Output is correct
42 Correct 947 ms 1992 KB Output is correct
43 Correct 929 ms 1972 KB Output is correct
44 Correct 904 ms 1868 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 49 ms 452 KB Output is correct
4 Correct 11 ms 460 KB Output is correct
5 Correct 50 ms 428 KB Output is correct
6 Correct 40 ms 432 KB Output is correct
7 Correct 46 ms 336 KB Output is correct
8 Correct 56 ms 428 KB Output is correct
9 Correct 49 ms 416 KB Output is correct
10 Correct 56 ms 332 KB Output is correct
11 Correct 56 ms 432 KB Output is correct
12 Correct 67 ms 424 KB Output is correct
13 Correct 63 ms 424 KB Output is correct
14 Correct 59 ms 340 KB Output is correct
15 Correct 65 ms 452 KB Output is correct
16 Correct 51 ms 416 KB Output is correct
17 Correct 53 ms 416 KB Output is correct
18 Correct 1643 ms 2000 KB Output is correct
19 Correct 1654 ms 1952 KB Output is correct
20 Correct 1665 ms 2048 KB Output is correct
21 Correct 1707 ms 2040 KB Output is correct
22 Correct 1712 ms 2000 KB Output is correct
23 Correct 2539 ms 2112 KB Output is correct
24 Correct 2558 ms 2328 KB Output is correct
25 Correct 2563 ms 2272 KB Output is correct
26 Correct 118 ms 544 KB Output is correct
27 Correct 1570 ms 2100 KB Output is correct
28 Correct 1444 ms 2072 KB Output is correct
29 Correct 1424 ms 2424 KB Output is correct
30 Correct 1374 ms 1972 KB Output is correct
31 Correct 1400 ms 1496 KB Output is correct
32 Correct 1192 ms 884 KB Output is correct
33 Correct 1673 ms 1896 KB Output is correct
34 Correct 1368 ms 1584 KB Output is correct
35 Correct 104 ms 576 KB Output is correct
36 Correct 1591 ms 1548 KB Output is correct
37 Correct 1283 ms 1496 KB Output is correct
38 Correct 1101 ms 1452 KB Output is correct
39 Correct 899 ms 1568 KB Output is correct
40 Correct 807 ms 1648 KB Output is correct
41 Correct 851 ms 1488 KB Output is correct
42 Correct 728 ms 1492 KB Output is correct
43 Correct 1550 ms 3092 KB Output is correct
44 Correct 114 ms 628 KB Output is correct
45 Correct 168 ms 2024 KB Output is correct
46 Correct 80 ms 1964 KB Output is correct
47 Correct 807 ms 3060 KB Output is correct
48 Correct 1499 ms 3076 KB Output is correct
49 Correct 781 ms 3180 KB Output is correct
50 Correct 779 ms 2012 KB Output is correct
51 Correct 764 ms 1996 KB Output is correct
52 Correct 821 ms 2332 KB Output is correct
53 Correct 1155 ms 2520 KB Output is correct
54 Correct 1147 ms 2592 KB Output is correct
55 Correct 1191 ms 2760 KB Output is correct
56 Correct 686 ms 3248 KB Output is correct
57 Correct 722 ms 3092 KB Output is correct
58 Correct 1506 ms 2964 KB Output is correct
59 Correct 1489 ms 3220 KB Output is correct
60 Correct 1532 ms 3044 KB Output is correct
61 Correct 1548 ms 3256 KB Output is correct
62 Correct 1283 ms 2956 KB Output is correct
63 Correct 1264 ms 3052 KB Output is correct
64 Correct 1443 ms 3212 KB Output is correct
65 Correct 845 ms 3016 KB Output is correct
66 Correct 1657 ms 2140 KB Output is correct
67 Correct 2121 ms 2108 KB Output is correct
68 Correct 1714 ms 2040 KB Output is correct
69 Correct 1238 ms 2024 KB Output is correct
70 Correct 1994 ms 2028 KB Output is correct
71 Correct 2071 ms 1920 KB Output is correct
72 Correct 2041 ms 2072 KB Output is correct
73 Correct 1713 ms 2076 KB Output is correct
74 Correct 1739 ms 2164 KB Output is correct
75 Correct 1717 ms 2268 KB Output is correct
76 Correct 1296 ms 2168 KB Output is correct
77 Correct 1337 ms 1988 KB Output is correct
78 Correct 1282 ms 2028 KB Output is correct
79 Correct 986 ms 2116 KB Output is correct
80 Correct 993 ms 2160 KB Output is correct
81 Correct 1002 ms 2232 KB Output is correct
82 Correct 947 ms 1992 KB Output is correct
83 Correct 929 ms 1972 KB Output is correct
84 Correct 904 ms 1868 KB Output is correct
85 Correct 2106 ms 4576 KB Output is correct
86 Correct 237 ms 3524 KB Output is correct
87 Correct 125 ms 3544 KB Output is correct
88 Correct 1326 ms 4484 KB Output is correct
89 Correct 2141 ms 4520 KB Output is correct
90 Correct 1395 ms 4452 KB Output is correct
91 Correct 1796 ms 3720 KB Output is correct
92 Correct 1749 ms 3596 KB Output is correct
93 Correct 2594 ms 3532 KB Output is correct
94 Correct 1897 ms 4056 KB Output is correct
95 Correct 1914 ms 3916 KB Output is correct
96 Correct 2205 ms 3944 KB Output is correct
97 Correct 991 ms 4552 KB Output is correct
98 Correct 962 ms 4252 KB Output is correct
99 Correct 2167 ms 4536 KB Output is correct
100 Correct 2124 ms 4448 KB Output is correct
101 Correct 2215 ms 4424 KB Output is correct
102 Correct 2234 ms 4280 KB Output is correct
103 Correct 2309 ms 4104 KB Output is correct
104 Correct 2313 ms 4392 KB Output is correct
105 Correct 1652 ms 4000 KB Output is correct
106 Correct 1317 ms 3748 KB Output is correct
107 Correct 1601 ms 4416 KB Output is correct
108 Correct 2153 ms 4292 KB Output is correct
109 Correct 1625 ms 3860 KB Output is correct