oj.uz

답안 #684492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684492 2023-01-21T10:54:54 Z noedit 다리 (APIO19_bridges) C++17
100 / 100
 2231 ms 8328 KB 
#include <bits/stdc++.h>
//#include <quadmath.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#define sz(x) (int)x.size()
//#define sqr(x) x*x
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
using namespace std;
//using namespace __gnu_pbds;
//
//#define int long long
////#define ld long double
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;

const int MAXN = 5e4 + 5;
const int B = 1200;
const int MAXQ = 1e5 + 5;

int sz[MAXN], p[MAXN];
array<int, 4> rb[MAXQ];
int rb_pt = 0;

void init(int n)
{
    rb_pt = 0;
    fill(sz, sz + n, 1);
    iota(p, p + n, 0);
}
int get_par(int a)
{
    if (p[a] == a)
        return a;
    return get_par(p[a]);
}
void mrg(int a, int b)
{
    a = get_par(a);
    b = get_par(b);
    if (a != b)
    {
        if (sz[a] < sz[b])
            swap(a, b);
        rb[rb_pt++] = {b, a, p[b], sz[a]};
        sz[a] += sz[b];
        p[b] = a;
    }
}
void rollback(int x)
{
    while (rb_pt > x)
    {
        auto&[b, a, pb, sza] = rb[rb_pt - 1];
        rb_pt--;
        p[b] = pb;
        sz[a] = sza;
    }
}

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<array<int, 3> > es(m);
    for (int i = 0; i < m; i++)
    {
        int u, v, w;
        cin >> u >> v >> w;
        u--;
        v--;
        es[i] = {w, u, v};
    }
    int q;
    cin >> q;
    vector<array<int, 3> > qs(q);
    for (int i = 0; i < q; i++)
    {
        int t, u, w;
        cin >> t >> u >> w;
        u--;
        qs[i] = {t, u, w};
    }
    vector<int> ans(q, -1);
    for (int i = 0; i < q; i += B)
    {
        vector<bool> active(m);
        vector<int> edges;
        auto ess = es;
        edges.reserve(B);
        vector<array<int, 4> > act;
        act.reserve(B + m);
        for (int j = i; j < min(q, i + B); j++)
        {
            auto& [t, u, w] = qs[j];
            if (t == 1)
            {
                active[u] = 1;
                ess[u][0] = w;
                edges.push_back(j);
            }
            else
            {
                act.push_back({w, 0, u, j});
            }
        }
        sort(edges.begin(), edges.end(), [&](int a, int b)
        {
            return qs[a][1] < qs[b][1] || (qs[a][1] == qs[b][1] && a < b);
        });
        for (int j = 0; j < m; j++)
        {
            auto& [w, u, v] = es[j];
            if (!active[j])
            {
                act.push_back({w, 1, u, v});
            }
        }
        sort(act.rbegin(), act.rend());
        init(n);
        for (auto& [w, t, u, v] : act)
        {
            if (t == 0)
            {
                int kek = rb_pt;
                for (int k  = 0; k < (int)edges.size();)
                {
                    int bebra = k;
                    int wei = -1;
                    while (bebra < (int)edges.size() && qs[edges[bebra]][1] == qs[edges[k]][1])
                    {
                        if (edges[bebra] < v)
                        {
                            wei = qs[edges[bebra]][2];
                        }
                        ++bebra;
                    }
                    int numb = qs[edges[k]][1];
                    if (wei == -1)
                    {
                        wei = es[numb][0];
                    }
                    if (w <= wei)
                    {
                        mrg(es[numb][1], es[numb][2]);
                    }
                    k = bebra;

                }
                ans[v] = sz[get_par(u)];
                rollback(kek);
            }
            else
            {
                mrg(u, v);
            }
        }
        es = ess;
    }
    for (auto& i : ans)
    {
        if (i != -1)
            cout << i << '\n';
    }
}
//
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    t = 1;
    while (t--)
    {
        solve();
    }
    cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
    return 0;
}
//
//
///*
//4 4
//1 2 1 3
//1 1
//1 2
//1 3
//1 4
//*/

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 40 ms 708 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 19 ms 652 KB Output is correct
6 Correct 16 ms 672 KB Output is correct
7 Correct 19 ms 596 KB Output is correct
8 Correct 19 ms 656 KB Output is correct
9 Correct 21 ms 580 KB Output is correct
10 Correct 19 ms 656 KB Output is correct
11 Correct 19 ms 740 KB Output is correct
12 Correct 22 ms 660 KB Output is correct
13 Correct 26 ms 648 KB Output is correct
14 Correct 25 ms 664 KB Output is correct
15 Correct 21 ms 648 KB Output is correct
16 Correct 22 ms 580 KB Output is correct
17 Correct 20 ms 580 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1282 ms 5548 KB Output is correct
2 Correct 1226 ms 5552 KB Output is correct
3 Correct 1252 ms 5548 KB Output is correct
4 Correct 1233 ms 5552 KB Output is correct
5 Correct 1249 ms 5548 KB Output is correct
6 Correct 1793 ms 5800 KB Output is correct
7 Correct 1819 ms 5716 KB Output is correct
8 Correct 1813 ms 5800 KB Output is correct
9 Correct 40 ms 2528 KB Output is correct
10 Correct 1400 ms 5676 KB Output is correct
11 Correct 1363 ms 5668 KB Output is correct
12 Correct 1031 ms 5944 KB Output is correct
13 Correct 1014 ms 5528 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1037 ms 4480 KB Output is correct
2 Correct 839 ms 3160 KB Output is correct
3 Correct 1227 ms 4688 KB Output is correct
4 Correct 999 ms 4604 KB Output is correct
5 Correct 35 ms 2520 KB Output is correct
6 Correct 1127 ms 4600 KB Output is correct
7 Correct 919 ms 4608 KB Output is correct
8 Correct 819 ms 4480 KB Output is correct
9 Correct 639 ms 4748 KB Output is correct
10 Correct 558 ms 4616 KB Output is correct
11 Correct 643 ms 4564 KB Output is correct
12 Correct 567 ms 4456 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1163 ms 8244 KB Output is correct
2 Correct 33 ms 2560 KB Output is correct
3 Correct 155 ms 4968 KB Output is correct
4 Correct 174 ms 4952 KB Output is correct
5 Correct 1522 ms 7892 KB Output is correct
6 Correct 1174 ms 8328 KB Output is correct
7 Correct 1521 ms 7884 KB Output is correct
8 Correct 574 ms 5656 KB Output is correct
9 Correct 575 ms 5688 KB Output is correct
10 Correct 572 ms 5812 KB Output is correct
11 Correct 942 ms 6796 KB Output is correct
12 Correct 926 ms 6796 KB Output is correct
13 Correct 903 ms 6928 KB Output is correct
14 Correct 1529 ms 8016 KB Output is correct
15 Correct 1507 ms 8020 KB Output is correct
16 Correct 1191 ms 8124 KB Output is correct
17 Correct 1193 ms 8088 KB Output is correct
18 Correct 1191 ms 8180 KB Output is correct
19 Correct 1231 ms 8212 KB Output is correct
20 Correct 1008 ms 7316 KB Output is correct
21 Correct 1029 ms 7380 KB Output is correct
22 Correct 1139 ms 7900 KB Output is correct
23 Correct 1201 ms 7144 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1282 ms 5548 KB Output is correct
2 Correct 1226 ms 5552 KB Output is correct
3 Correct 1252 ms 5548 KB Output is correct
4 Correct 1233 ms 5552 KB Output is correct
5 Correct 1249 ms 5548 KB Output is correct
6 Correct 1793 ms 5800 KB Output is correct
7 Correct 1819 ms 5716 KB Output is correct
8 Correct 1813 ms 5800 KB Output is correct
9 Correct 40 ms 2528 KB Output is correct
10 Correct 1400 ms 5676 KB Output is correct
11 Correct 1363 ms 5668 KB Output is correct
12 Correct 1031 ms 5944 KB Output is correct
13 Correct 1014 ms 5528 KB Output is correct
14 Correct 1037 ms 4480 KB Output is correct
15 Correct 839 ms 3160 KB Output is correct
16 Correct 1227 ms 4688 KB Output is correct
17 Correct 999 ms 4604 KB Output is correct
18 Correct 35 ms 2520 KB Output is correct
19 Correct 1127 ms 4600 KB Output is correct
20 Correct 919 ms 4608 KB Output is correct
21 Correct 819 ms 4480 KB Output is correct
22 Correct 639 ms 4748 KB Output is correct
23 Correct 558 ms 4616 KB Output is correct
24 Correct 643 ms 4564 KB Output is correct
25 Correct 567 ms 4456 KB Output is correct
26 Correct 1259 ms 5564 KB Output is correct
27 Correct 1650 ms 5676 KB Output is correct
28 Correct 1365 ms 5672 KB Output is correct
29 Correct 976 ms 5548 KB Output is correct
30 Correct 1574 ms 5700 KB Output is correct
31 Correct 1649 ms 5728 KB Output is correct
32 Correct 1590 ms 5676 KB Output is correct
33 Correct 1327 ms 5540 KB Output is correct
34 Correct 1340 ms 5580 KB Output is correct
35 Correct 1319 ms 5548 KB Output is correct
36 Correct 994 ms 5608 KB Output is correct
37 Correct 1008 ms 5548 KB Output is correct
38 Correct 970 ms 5544 KB Output is correct
39 Correct 723 ms 5684 KB Output is correct
40 Correct 697 ms 5688 KB Output is correct
41 Correct 719 ms 5688 KB Output is correct
42 Correct 772 ms 5680 KB Output is correct
43 Correct 736 ms 5532 KB Output is correct
44 Correct 735 ms 5532 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 40 ms 708 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 19 ms 652 KB Output is correct
6 Correct 16 ms 672 KB Output is correct
7 Correct 19 ms 596 KB Output is correct
8 Correct 19 ms 656 KB Output is correct
9 Correct 21 ms 580 KB Output is correct
10 Correct 19 ms 656 KB Output is correct
11 Correct 19 ms 740 KB Output is correct
12 Correct 22 ms 660 KB Output is correct
13 Correct 26 ms 648 KB Output is correct
14 Correct 25 ms 664 KB Output is correct
15 Correct 21 ms 648 KB Output is correct
16 Correct 22 ms 580 KB Output is correct
17 Correct 20 ms 580 KB Output is correct
18 Correct 1282 ms 5548 KB Output is correct
19 Correct 1226 ms 5552 KB Output is correct
20 Correct 1252 ms 5548 KB Output is correct
21 Correct 1233 ms 5552 KB Output is correct
22 Correct 1249 ms 5548 KB Output is correct
23 Correct 1793 ms 5800 KB Output is correct
24 Correct 1819 ms 5716 KB Output is correct
25 Correct 1813 ms 5800 KB Output is correct
26 Correct 40 ms 2528 KB Output is correct
27 Correct 1400 ms 5676 KB Output is correct
28 Correct 1363 ms 5668 KB Output is correct
29 Correct 1031 ms 5944 KB Output is correct
30 Correct 1014 ms 5528 KB Output is correct
31 Correct 1037 ms 4480 KB Output is correct
32 Correct 839 ms 3160 KB Output is correct
33 Correct 1227 ms 4688 KB Output is correct
34 Correct 999 ms 4604 KB Output is correct
35 Correct 35 ms 2520 KB Output is correct
36 Correct 1127 ms 4600 KB Output is correct
37 Correct 919 ms 4608 KB Output is correct
38 Correct 819 ms 4480 KB Output is correct
39 Correct 639 ms 4748 KB Output is correct
40 Correct 558 ms 4616 KB Output is correct
41 Correct 643 ms 4564 KB Output is correct
42 Correct 567 ms 4456 KB Output is correct
43 Correct 1163 ms 8244 KB Output is correct
44 Correct 33 ms 2560 KB Output is correct
45 Correct 155 ms 4968 KB Output is correct
46 Correct 174 ms 4952 KB Output is correct
47 Correct 1522 ms 7892 KB Output is correct
48 Correct 1174 ms 8328 KB Output is correct
49 Correct 1521 ms 7884 KB Output is correct
50 Correct 574 ms 5656 KB Output is correct
51 Correct 575 ms 5688 KB Output is correct
52 Correct 572 ms 5812 KB Output is correct
53 Correct 942 ms 6796 KB Output is correct
54 Correct 926 ms 6796 KB Output is correct
55 Correct 903 ms 6928 KB Output is correct
56 Correct 1529 ms 8016 KB Output is correct
57 Correct 1507 ms 8020 KB Output is correct
58 Correct 1191 ms 8124 KB Output is correct
59 Correct 1193 ms 8088 KB Output is correct
60 Correct 1191 ms 8180 KB Output is correct
61 Correct 1231 ms 8212 KB Output is correct
62 Correct 1008 ms 7316 KB Output is correct
63 Correct 1029 ms 7380 KB Output is correct
64 Correct 1139 ms 7900 KB Output is correct
65 Correct 1201 ms 7144 KB Output is correct
66 Correct 1259 ms 5564 KB Output is correct
67 Correct 1650 ms 5676 KB Output is correct
68 Correct 1365 ms 5672 KB Output is correct
69 Correct 976 ms 5548 KB Output is correct
70 Correct 1574 ms 5700 KB Output is correct
71 Correct 1649 ms 5728 KB Output is correct
72 Correct 1590 ms 5676 KB Output is correct
73 Correct 1327 ms 5540 KB Output is correct
74 Correct 1340 ms 5580 KB Output is correct
75 Correct 1319 ms 5548 KB Output is correct
76 Correct 994 ms 5608 KB Output is correct
77 Correct 1008 ms 5548 KB Output is correct
78 Correct 970 ms 5544 KB Output is correct
79 Correct 723 ms 5684 KB Output is correct
80 Correct 697 ms 5688 KB Output is correct
81 Correct 719 ms 5688 KB Output is correct
82 Correct 772 ms 5680 KB Output is correct
83 Correct 736 ms 5532 KB Output is correct
84 Correct 735 ms 5532 KB Output is correct
85 Correct 1874 ms 7968 KB Output is correct
86 Correct 186 ms 4956 KB Output is correct
87 Correct 205 ms 5036 KB Output is correct
88 Correct 2231 ms 7616 KB Output is correct
89 Correct 1903 ms 7968 KB Output is correct
90 Correct 2177 ms 7744 KB Output is correct
91 Correct 1413 ms 5612 KB Output is correct
92 Correct 1382 ms 5552 KB Output is correct
93 Correct 2031 ms 5672 KB Output is correct
94 Correct 1653 ms 6784 KB Output is correct
95 Correct 1626 ms 6652 KB Output is correct
96 Correct 1957 ms 6780 KB Output is correct
97 Correct 1664 ms 7764 KB Output is correct
98 Correct 1811 ms 7348 KB Output is correct
99 Correct 1874 ms 7468 KB Output is correct
100 Correct 1897 ms 7460 KB Output is correct
101 Correct 1891 ms 7488 KB Output is correct
102 Correct 1869 ms 7480 KB Output is correct
103 Correct 2077 ms 7040 KB Output is correct
104 Correct 2070 ms 7004 KB Output is correct
105 Correct 1419 ms 6716 KB Output is correct
106 Correct 1106 ms 6380 KB Output is correct
107 Correct 1237 ms 7132 KB Output is correct
108 Correct 1938 ms 7416 KB Output is correct
109 Correct 2053 ms 6624 KB Output is correct