Submission #623436

# Submission time Handle Problem Language Result Execution time Memory
623436 2022-08-05T15:29:17 Z messiuuuuu Bridges (APIO19_bridges) C++17
100 / 100
2327 ms 141552 KB
///
#include<bits/stdc++.h>
#define task "C"
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 1e5 + 5;
const ll INF = 1e18 + 5;
const int BS = 600;

int n, m;
pair<int, int> edge[MAXN];
int w[MAXN];

void Input()
{
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        cin >> u >> v >> w[i];
        edge[i] = {u, v};
    }
}

pair<int, int> qu[MAXN];
vector<int> thaydoi[MAXN];
bool isc[MAXN];
int ans[MAXN];
int lab[MAXN];

struct TRb
{
    int u, v, labu, labv;
};

vector<TRb> rb;

void rollback(int sz)
{
    while (rb.size() > sz)
    {
        auto last = rb.back();
        rb.pop_back();
        lab[last.u] = last.labu;
        lab[last.v] = last.labv;
    }
}

int FindSet(int u)
{
    return lab[u] < 0 ? u : FindSet(lab[u]);
}

void Unite(int u, int v)
{
    u = FindSet(u);
    v = FindSet(v);
    if (u == v)
        return;
    if (lab[u] > lab[v])
        swap(u, v);
    rb.pb({u, v, lab[u], lab[v]});
    lab[u] += lab[v];
    lab[v] = u;
}

void Solve()
{
    int q;
    cin >> q;
    vector<int> cse(m);
    iota(cse.begin(), cse.end(), 1);
    for (int bl = 1; bl <= (q + BS - 1) / BS; bl++)
    {
        fill(lab, lab + 1 + n, -1);
        sort(cse.begin(), cse.end(), [](int i, int j)
        {
            return w[i] > w[j];
        });
        vector<int> t1, t2;
        int lf = (bl - 1) * BS + 1, rf = min(q, bl * BS);
        for (int i = lf; i <= rf; i++)
        {
            int t;
            cin >> t >> qu[i].fi >> qu[i].se;
            if (t == 1)
            {
                if (thaydoi[qu[i].fi].empty())
                {
                    t1.pb(qu[i].fi);
                }
                thaydoi[qu[i].fi].pb(i);
            }
            else
            {
                t2.pb(i);
            }
        }
        sort(t2.begin(), t2.end(), [](int i, int j)
             {
                 return qu[i].se > qu[j].se;
             });
        int i = 0;
        for (int id : t2)
        {
            while (i < m && w[cse[i]] >= qu[id].se)
            {
                if (!thaydoi[cse[i]].empty())
                {
                    i++;
                    continue;
                }
                Unite(edge[cse[i]].fi, edge[cse[i]].se);
                i++;
            }

            int sz = rb.size();
            for (int j : t1)
            {
                int p = lower_bound(thaydoi[j].begin(), thaydoi[j].end(), id) - thaydoi[j].begin() - 1;
                int w1 = p < 0 ? w[j] : qu[thaydoi[j][p]].se;
                if (w1 >= qu[id].se)
                    Unite(edge[j].fi, edge[j].se);
            }

            ans[id] = -lab[FindSet(qu[id].fi)];
            //assert(1 < 0);
            rollback(sz);
        }
        for (int id : t1)
        {
            w[id] = qu[thaydoi[id].back()].se;
            thaydoi[id].clear();
        }
    }
    for (int i = 1; i <= q; i++)
    {
        if (ans[i])
            cout << ans[i] << '\n';
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(task".INP","r"))
    {
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    Input();
    Solve();
}

Compilation message

bridges.cpp: In function 'void rollback(int)':
bridges.cpp:44:22: warning: comparison of integer expressions of different signedness: 'std::vector<TRb>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |     while (rb.size() > sz)
      |            ~~~~~~~~~~^~~~
bridges.cpp: In function 'int main()':
bridges.cpp:153:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  153 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 24 ms 2824 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 13 ms 2772 KB Output is correct
6 Correct 11 ms 2832 KB Output is correct
7 Correct 12 ms 2772 KB Output is correct
8 Correct 14 ms 2772 KB Output is correct
9 Correct 12 ms 2772 KB Output is correct
10 Correct 18 ms 2772 KB Output is correct
11 Correct 16 ms 2772 KB Output is correct
12 Correct 17 ms 2732 KB Output is correct
13 Correct 18 ms 2788 KB Output is correct
14 Correct 18 ms 2824 KB Output is correct
15 Correct 16 ms 2836 KB Output is correct
16 Correct 13 ms 2740 KB Output is correct
17 Correct 13 ms 2772 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1181 ms 136256 KB Output is correct
2 Correct 1191 ms 136264 KB Output is correct
3 Correct 1201 ms 136216 KB Output is correct
4 Correct 1228 ms 136124 KB Output is correct
5 Correct 1282 ms 136148 KB Output is correct
6 Correct 1494 ms 136204 KB Output is correct
7 Correct 1511 ms 136224 KB Output is correct
8 Correct 1506 ms 136240 KB Output is correct
9 Correct 30 ms 4044 KB Output is correct
10 Correct 980 ms 136348 KB Output is correct
11 Correct 893 ms 136224 KB Output is correct
12 Correct 1101 ms 136108 KB Output is correct
13 Correct 1140 ms 136540 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 870 ms 136356 KB Output is correct
2 Correct 488 ms 36768 KB Output is correct
3 Correct 1004 ms 136312 KB Output is correct
4 Correct 848 ms 136304 KB Output is correct
5 Correct 35 ms 4040 KB Output is correct
6 Correct 958 ms 136312 KB Output is correct
7 Correct 860 ms 136256 KB Output is correct
8 Correct 806 ms 136432 KB Output is correct
9 Correct 691 ms 135780 KB Output is correct
10 Correct 691 ms 135808 KB Output is correct
11 Correct 756 ms 136500 KB Output is correct
12 Correct 770 ms 136516 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1648 ms 136500 KB Output is correct
2 Correct 52 ms 3988 KB Output is correct
3 Correct 147 ms 4628 KB Output is correct
4 Correct 126 ms 4576 KB Output is correct
5 Correct 1514 ms 136508 KB Output is correct
6 Correct 1656 ms 136504 KB Output is correct
7 Correct 1368 ms 136428 KB Output is correct
8 Correct 813 ms 135752 KB Output is correct
9 Correct 708 ms 135736 KB Output is correct
10 Correct 709 ms 136080 KB Output is correct
11 Correct 1114 ms 136240 KB Output is correct
12 Correct 1038 ms 136308 KB Output is correct
13 Correct 1103 ms 136536 KB Output is correct
14 Correct 1145 ms 136504 KB Output is correct
15 Correct 1260 ms 136488 KB Output is correct
16 Correct 1537 ms 136480 KB Output is correct
17 Correct 1505 ms 136372 KB Output is correct
18 Correct 1620 ms 136792 KB Output is correct
19 Correct 1421 ms 136716 KB Output is correct
20 Correct 1298 ms 136744 KB Output is correct
21 Correct 1231 ms 136716 KB Output is correct
22 Correct 1286 ms 136396 KB Output is correct
23 Correct 940 ms 136288 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1181 ms 136256 KB Output is correct
2 Correct 1191 ms 136264 KB Output is correct
3 Correct 1201 ms 136216 KB Output is correct
4 Correct 1228 ms 136124 KB Output is correct
5 Correct 1282 ms 136148 KB Output is correct
6 Correct 1494 ms 136204 KB Output is correct
7 Correct 1511 ms 136224 KB Output is correct
8 Correct 1506 ms 136240 KB Output is correct
9 Correct 30 ms 4044 KB Output is correct
10 Correct 980 ms 136348 KB Output is correct
11 Correct 893 ms 136224 KB Output is correct
12 Correct 1101 ms 136108 KB Output is correct
13 Correct 1140 ms 136540 KB Output is correct
14 Correct 870 ms 136356 KB Output is correct
15 Correct 488 ms 36768 KB Output is correct
16 Correct 1004 ms 136312 KB Output is correct
17 Correct 848 ms 136304 KB Output is correct
18 Correct 35 ms 4040 KB Output is correct
19 Correct 958 ms 136312 KB Output is correct
20 Correct 860 ms 136256 KB Output is correct
21 Correct 806 ms 136432 KB Output is correct
22 Correct 691 ms 135780 KB Output is correct
23 Correct 691 ms 135808 KB Output is correct
24 Correct 756 ms 136500 KB Output is correct
25 Correct 770 ms 136516 KB Output is correct
26 Correct 1229 ms 136248 KB Output is correct
27 Correct 1374 ms 136236 KB Output is correct
28 Correct 1326 ms 136120 KB Output is correct
29 Correct 1068 ms 136148 KB Output is correct
30 Correct 1348 ms 136216 KB Output is correct
31 Correct 1372 ms 136344 KB Output is correct
32 Correct 1390 ms 136276 KB Output is correct
33 Correct 1256 ms 136252 KB Output is correct
34 Correct 1272 ms 136132 KB Output is correct
35 Correct 1330 ms 136288 KB Output is correct
36 Correct 1115 ms 136272 KB Output is correct
37 Correct 1094 ms 136312 KB Output is correct
38 Correct 1068 ms 136168 KB Output is correct
39 Correct 1018 ms 135768 KB Output is correct
40 Correct 982 ms 135704 KB Output is correct
41 Correct 1040 ms 135800 KB Output is correct
42 Correct 902 ms 136540 KB Output is correct
43 Correct 943 ms 136548 KB Output is correct
44 Correct 958 ms 136584 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 24 ms 2824 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 13 ms 2772 KB Output is correct
6 Correct 11 ms 2832 KB Output is correct
7 Correct 12 ms 2772 KB Output is correct
8 Correct 14 ms 2772 KB Output is correct
9 Correct 12 ms 2772 KB Output is correct
10 Correct 18 ms 2772 KB Output is correct
11 Correct 16 ms 2772 KB Output is correct
12 Correct 17 ms 2732 KB Output is correct
13 Correct 18 ms 2788 KB Output is correct
14 Correct 18 ms 2824 KB Output is correct
15 Correct 16 ms 2836 KB Output is correct
16 Correct 13 ms 2740 KB Output is correct
17 Correct 13 ms 2772 KB Output is correct
18 Correct 1181 ms 136256 KB Output is correct
19 Correct 1191 ms 136264 KB Output is correct
20 Correct 1201 ms 136216 KB Output is correct
21 Correct 1228 ms 136124 KB Output is correct
22 Correct 1282 ms 136148 KB Output is correct
23 Correct 1494 ms 136204 KB Output is correct
24 Correct 1511 ms 136224 KB Output is correct
25 Correct 1506 ms 136240 KB Output is correct
26 Correct 30 ms 4044 KB Output is correct
27 Correct 980 ms 136348 KB Output is correct
28 Correct 893 ms 136224 KB Output is correct
29 Correct 1101 ms 136108 KB Output is correct
30 Correct 1140 ms 136540 KB Output is correct
31 Correct 870 ms 136356 KB Output is correct
32 Correct 488 ms 36768 KB Output is correct
33 Correct 1004 ms 136312 KB Output is correct
34 Correct 848 ms 136304 KB Output is correct
35 Correct 35 ms 4040 KB Output is correct
36 Correct 958 ms 136312 KB Output is correct
37 Correct 860 ms 136256 KB Output is correct
38 Correct 806 ms 136432 KB Output is correct
39 Correct 691 ms 135780 KB Output is correct
40 Correct 691 ms 135808 KB Output is correct
41 Correct 756 ms 136500 KB Output is correct
42 Correct 770 ms 136516 KB Output is correct
43 Correct 1648 ms 136500 KB Output is correct
44 Correct 52 ms 3988 KB Output is correct
45 Correct 147 ms 4628 KB Output is correct
46 Correct 126 ms 4576 KB Output is correct
47 Correct 1514 ms 136508 KB Output is correct
48 Correct 1656 ms 136504 KB Output is correct
49 Correct 1368 ms 136428 KB Output is correct
50 Correct 813 ms 135752 KB Output is correct
51 Correct 708 ms 135736 KB Output is correct
52 Correct 709 ms 136080 KB Output is correct
53 Correct 1114 ms 136240 KB Output is correct
54 Correct 1038 ms 136308 KB Output is correct
55 Correct 1103 ms 136536 KB Output is correct
56 Correct 1145 ms 136504 KB Output is correct
57 Correct 1260 ms 136488 KB Output is correct
58 Correct 1537 ms 136480 KB Output is correct
59 Correct 1505 ms 136372 KB Output is correct
60 Correct 1620 ms 136792 KB Output is correct
61 Correct 1421 ms 136716 KB Output is correct
62 Correct 1298 ms 136744 KB Output is correct
63 Correct 1231 ms 136716 KB Output is correct
64 Correct 1286 ms 136396 KB Output is correct
65 Correct 940 ms 136288 KB Output is correct
66 Correct 1229 ms 136248 KB Output is correct
67 Correct 1374 ms 136236 KB Output is correct
68 Correct 1326 ms 136120 KB Output is correct
69 Correct 1068 ms 136148 KB Output is correct
70 Correct 1348 ms 136216 KB Output is correct
71 Correct 1372 ms 136344 KB Output is correct
72 Correct 1390 ms 136276 KB Output is correct
73 Correct 1256 ms 136252 KB Output is correct
74 Correct 1272 ms 136132 KB Output is correct
75 Correct 1330 ms 136288 KB Output is correct
76 Correct 1115 ms 136272 KB Output is correct
77 Correct 1094 ms 136312 KB Output is correct
78 Correct 1068 ms 136168 KB Output is correct
79 Correct 1018 ms 135768 KB Output is correct
80 Correct 982 ms 135704 KB Output is correct
81 Correct 1040 ms 135800 KB Output is correct
82 Correct 902 ms 136540 KB Output is correct
83 Correct 943 ms 136548 KB Output is correct
84 Correct 958 ms 136584 KB Output is correct
85 Correct 2226 ms 137128 KB Output is correct
86 Correct 189 ms 6448 KB Output is correct
87 Correct 129 ms 6608 KB Output is correct
88 Correct 1494 ms 139160 KB Output is correct
89 Correct 2327 ms 140284 KB Output is correct
90 Correct 1385 ms 139004 KB Output is correct
91 Correct 1222 ms 138232 KB Output is correct
92 Correct 1198 ms 138380 KB Output is correct
93 Correct 1522 ms 138600 KB Output is correct
94 Correct 1765 ms 140408 KB Output is correct
95 Correct 1747 ms 140460 KB Output is correct
96 Correct 1935 ms 140420 KB Output is correct
97 Correct 1162 ms 138484 KB Output is correct
98 Correct 1231 ms 139424 KB Output is correct
99 Correct 2277 ms 141060 KB Output is correct
100 Correct 2230 ms 140796 KB Output is correct
101 Correct 2286 ms 141552 KB Output is correct
102 Correct 2259 ms 141460 KB Output is correct
103 Correct 2126 ms 140564 KB Output is correct
104 Correct 2207 ms 140660 KB Output is correct
105 Correct 1811 ms 140840 KB Output is correct
106 Correct 1435 ms 140480 KB Output is correct
107 Correct 1833 ms 140112 KB Output is correct
108 Correct 2248 ms 140116 KB Output is correct
109 Correct 1464 ms 138676 KB Output is correct