oj.uz

답안 #900256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
900256 2024-01-08T02:48:57 Z 12345678 다리 (APIO19_bridges) C++17
100 / 100
 1898 ms 14860 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=5e4+5, mx=1e5+5, qx=1e5+5, kx=320;

struct edge
{
    int u, v, w;
    edge(): u(0), v(0), w(0){}
    edge(int u, int v, int w): u(u), v(v), w(v){}
    bool operator< (const edge &o) const
    {
        if(w!=o.w)return w>o.w;
        if(u!=o.u)return u<o.u;
        return v<o.v;
    }
} ed[mx];

struct query
{
    int t, s, w;
} qr[qx];

struct dsu
{
    int dsu[nx], sz[nx];
    stack<pair<int, int>> s;
    void init()
    {
        for (int i=1; i<nx; i++) dsu[i]=i, sz[i]=1;
        while (!s.empty()) s.pop();
    }
    int find(int u)
    {
        if (u==dsu[u]) return u;
        return find(dsu[u]);
    }
    int size(int u)
    {
        return sz[find(u)];
    }
    void merge(int u, int v)
    {
        int pu=find(u), pv=find(v);
        if (pu==pv) return;
        if (sz[pu]<sz[pv]) swap(pu, pv);
        sz[pu]+=sz[pv];
        dsu[pv]=pu;
        s.push({pu, pv});
    }
    void undo(int x)
    {
        while (s.size()>x)
        {
            auto [u, v]=s.top();
            s.pop();
            sz[u]-=sz[v];
            dsu[v]=v;
        }
    }
} d;

int n, m, q, res[qx], used[mx];
multiset<edge> ms;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1; i<=m; i++) cin>>ed[i].u>>ed[i].v>>ed[i].w, ms.insert(ed[i]);
    cin>>q;
    for (int i=1; i<=q; i++) cin>>qr[i].t>>qr[i].s>>qr[i].w;
    for (int l=1, r=kx; l<=q; l+=kx, r+=kx)
    {
        r=min(r, q);
        d.init();
        vector<int> upd;
        for (int i=l; i<=r; i++)
        {
            int id=qr[i].s;
            if (qr[i].t==1&&!used[id])
            {
                used[id]=1;
                upd.push_back(id);
                ms.erase(ms.find(ed[id]));
            }
        }
        vector<tuple<int, int, vector<int>>> c;
        for (int i=l; i<=r; i++)
        {
            if (qr[i].t==1) ed[qr[i].s].w=qr[i].w;
            else
            {
                vector<int> tmp;
                for (auto vl:upd) if (ed[vl].w>=qr[i].w) tmp.push_back(vl);
                c.push_back(make_tuple(qr[i].w, i, tmp));
            }
        }
        sort(c.begin(), c.end());
        reverse(c.begin(), c.end());
        //for (auto x:ms) cout<<"multiset "<<x.u<<' '<<x.v<<' '<<x.w<<'\n';
        auto itr=ms.begin();
        for (auto [cw, idx, up]:c)
        {
            while (itr!=ms.end()&&itr->w>=cw) d.merge(itr->u, itr->v), itr++;
            int st=d.s.size();
            for (auto tmp:up) d.merge(ed[tmp].u, ed[tmp].v);
            //if (idx==8) cout<<qr[idx].s<<' '<<d.find(qr[idx].s)<<' '<<d.sz[d.find(qr[idx].s)]<<'\n';
            res[idx]=d.size(qr[idx].s);
            d.undo(st);
        }
        for (auto x:upd) used[x]=0, ms.insert(ed[x]);
    }
    for (int i=1; i<=q; i++) if (qr[i].t==2) cout<<res[i]<<'\n';
}

Compilation message

bridges.cpp: In member function 'void dsu::undo(int)':
bridges.cpp:54:24: warning: comparison of integer expressions of different signedness: 'std::stack<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |         while (s.size()>x)
      |                ~~~~~~~~^~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3672 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 12 ms 3848 KB Output is correct
4 Correct 5 ms 3676 KB Output is correct
5 Correct 9 ms 3676 KB Output is correct
6 Correct 8 ms 3676 KB Output is correct
7 Correct 9 ms 3676 KB Output is correct
8 Correct 10 ms 3888 KB Output is correct
9 Correct 10 ms 3676 KB Output is correct
10 Correct 10 ms 3892 KB Output is correct
11 Correct 10 ms 3676 KB Output is correct
12 Correct 11 ms 3676 KB Output is correct
13 Correct 12 ms 3932 KB Output is correct
14 Correct 11 ms 3932 KB Output is correct
15 Correct 11 ms 3908 KB Output is correct
16 Correct 9 ms 3676 KB Output is correct
17 Correct 10 ms 3672 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 807 ms 7768 KB Output is correct
2 Correct 808 ms 10584 KB Output is correct
3 Correct 828 ms 10396 KB Output is correct
4 Correct 835 ms 10460 KB Output is correct
5 Correct 826 ms 10576 KB Output is correct
6 Correct 846 ms 10720 KB Output is correct
7 Correct 845 ms 10580 KB Output is correct
8 Correct 845 ms 10732 KB Output is correct
9 Correct 35 ms 5212 KB Output is correct
10 Correct 630 ms 9564 KB Output is correct
11 Correct 627 ms 9344 KB Output is correct
12 Correct 723 ms 10328 KB Output is correct
13 Correct 765 ms 10376 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 554 ms 6488 KB Output is correct
2 Correct 251 ms 6240 KB Output is correct
3 Correct 559 ms 8784 KB Output is correct
4 Correct 536 ms 9080 KB Output is correct
5 Correct 36 ms 5188 KB Output is correct
6 Correct 584 ms 8900 KB Output is correct
7 Correct 559 ms 8668 KB Output is correct
8 Correct 512 ms 8696 KB Output is correct
9 Correct 478 ms 9084 KB Output is correct
10 Correct 469 ms 8784 KB Output is correct
11 Correct 488 ms 8532 KB Output is correct
12 Correct 461 ms 8784 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1416 ms 10760 KB Output is correct
2 Correct 35 ms 3920 KB Output is correct
3 Correct 156 ms 9940 KB Output is correct
4 Correct 106 ms 9936 KB Output is correct
5 Correct 1418 ms 10804 KB Output is correct
6 Correct 1406 ms 10908 KB Output is correct
7 Correct 1429 ms 10936 KB Output is correct
8 Correct 677 ms 7700 KB Output is correct
9 Correct 650 ms 7348 KB Output is correct
10 Correct 667 ms 7616 KB Output is correct
11 Correct 1106 ms 9092 KB Output is correct
12 Correct 1042 ms 9348 KB Output is correct
13 Correct 1117 ms 9164 KB Output is correct
14 Correct 1373 ms 11216 KB Output is correct
15 Correct 1442 ms 10968 KB Output is correct
16 Correct 1554 ms 10952 KB Output is correct
17 Correct 1898 ms 10676 KB Output is correct
18 Correct 1579 ms 10772 KB Output is correct
19 Correct 1521 ms 10928 KB Output is correct
20 Correct 1269 ms 10256 KB Output is correct
21 Correct 1357 ms 10096 KB Output is correct
22 Correct 1449 ms 10580 KB Output is correct
23 Correct 1190 ms 9576 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 807 ms 7768 KB Output is correct
2 Correct 808 ms 10584 KB Output is correct
3 Correct 828 ms 10396 KB Output is correct
4 Correct 835 ms 10460 KB Output is correct
5 Correct 826 ms 10576 KB Output is correct
6 Correct 846 ms 10720 KB Output is correct
7 Correct 845 ms 10580 KB Output is correct
8 Correct 845 ms 10732 KB Output is correct
9 Correct 35 ms 5212 KB Output is correct
10 Correct 630 ms 9564 KB Output is correct
11 Correct 627 ms 9344 KB Output is correct
12 Correct 723 ms 10328 KB Output is correct
13 Correct 765 ms 10376 KB Output is correct
14 Correct 554 ms 6488 KB Output is correct
15 Correct 251 ms 6240 KB Output is correct
16 Correct 559 ms 8784 KB Output is correct
17 Correct 536 ms 9080 KB Output is correct
18 Correct 36 ms 5188 KB Output is correct
19 Correct 584 ms 8900 KB Output is correct
20 Correct 559 ms 8668 KB Output is correct
21 Correct 512 ms 8696 KB Output is correct
22 Correct 478 ms 9084 KB Output is correct
23 Correct 469 ms 8784 KB Output is correct
24 Correct 488 ms 8532 KB Output is correct
25 Correct 461 ms 8784 KB Output is correct
26 Correct 747 ms 10840 KB Output is correct
27 Correct 845 ms 10580 KB Output is correct
28 Correct 850 ms 10596 KB Output is correct
29 Correct 756 ms 10580 KB Output is correct
30 Correct 839 ms 10340 KB Output is correct
31 Correct 850 ms 10292 KB Output is correct
32 Correct 841 ms 10548 KB Output is correct
33 Correct 810 ms 10592 KB Output is correct
34 Correct 814 ms 10596 KB Output is correct
35 Correct 820 ms 10528 KB Output is correct
36 Correct 744 ms 10560 KB Output is correct
37 Correct 747 ms 10520 KB Output is correct
38 Correct 738 ms 10576 KB Output is correct
39 Correct 695 ms 10488 KB Output is correct
40 Correct 697 ms 10284 KB Output is correct
41 Correct 738 ms 10320 KB Output is correct
42 Correct 647 ms 10376 KB Output is correct
43 Correct 650 ms 10644 KB Output is correct
44 Correct 650 ms 10352 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3672 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 12 ms 3848 KB Output is correct
4 Correct 5 ms 3676 KB Output is correct
5 Correct 9 ms 3676 KB Output is correct
6 Correct 8 ms 3676 KB Output is correct
7 Correct 9 ms 3676 KB Output is correct
8 Correct 10 ms 3888 KB Output is correct
9 Correct 10 ms 3676 KB Output is correct
10 Correct 10 ms 3892 KB Output is correct
11 Correct 10 ms 3676 KB Output is correct
12 Correct 11 ms 3676 KB Output is correct
13 Correct 12 ms 3932 KB Output is correct
14 Correct 11 ms 3932 KB Output is correct
15 Correct 11 ms 3908 KB Output is correct
16 Correct 9 ms 3676 KB Output is correct
17 Correct 10 ms 3672 KB Output is correct
18 Correct 807 ms 7768 KB Output is correct
19 Correct 808 ms 10584 KB Output is correct
20 Correct 828 ms 10396 KB Output is correct
21 Correct 835 ms 10460 KB Output is correct
22 Correct 826 ms 10576 KB Output is correct
23 Correct 846 ms 10720 KB Output is correct
24 Correct 845 ms 10580 KB Output is correct
25 Correct 845 ms 10732 KB Output is correct
26 Correct 35 ms 5212 KB Output is correct
27 Correct 630 ms 9564 KB Output is correct
28 Correct 627 ms 9344 KB Output is correct
29 Correct 723 ms 10328 KB Output is correct
30 Correct 765 ms 10376 KB Output is correct
31 Correct 554 ms 6488 KB Output is correct
32 Correct 251 ms 6240 KB Output is correct
33 Correct 559 ms 8784 KB Output is correct
34 Correct 536 ms 9080 KB Output is correct
35 Correct 36 ms 5188 KB Output is correct
36 Correct 584 ms 8900 KB Output is correct
37 Correct 559 ms 8668 KB Output is correct
38 Correct 512 ms 8696 KB Output is correct
39 Correct 478 ms 9084 KB Output is correct
40 Correct 469 ms 8784 KB Output is correct
41 Correct 488 ms 8532 KB Output is correct
42 Correct 461 ms 8784 KB Output is correct
43 Correct 1416 ms 10760 KB Output is correct
44 Correct 35 ms 3920 KB Output is correct
45 Correct 156 ms 9940 KB Output is correct
46 Correct 106 ms 9936 KB Output is correct
47 Correct 1418 ms 10804 KB Output is correct
48 Correct 1406 ms 10908 KB Output is correct
49 Correct 1429 ms 10936 KB Output is correct
50 Correct 677 ms 7700 KB Output is correct
51 Correct 650 ms 7348 KB Output is correct
52 Correct 667 ms 7616 KB Output is correct
53 Correct 1106 ms 9092 KB Output is correct
54 Correct 1042 ms 9348 KB Output is correct
55 Correct 1117 ms 9164 KB Output is correct
56 Correct 1373 ms 11216 KB Output is correct
57 Correct 1442 ms 10968 KB Output is correct
58 Correct 1554 ms 10952 KB Output is correct
59 Correct 1898 ms 10676 KB Output is correct
60 Correct 1579 ms 10772 KB Output is correct
61 Correct 1521 ms 10928 KB Output is correct
62 Correct 1269 ms 10256 KB Output is correct
63 Correct 1357 ms 10096 KB Output is correct
64 Correct 1449 ms 10580 KB Output is correct
65 Correct 1190 ms 9576 KB Output is correct
66 Correct 747 ms 10840 KB Output is correct
67 Correct 845 ms 10580 KB Output is correct
68 Correct 850 ms 10596 KB Output is correct
69 Correct 756 ms 10580 KB Output is correct
70 Correct 839 ms 10340 KB Output is correct
71 Correct 850 ms 10292 KB Output is correct
72 Correct 841 ms 10548 KB Output is correct
73 Correct 810 ms 10592 KB Output is correct
74 Correct 814 ms 10596 KB Output is correct
75 Correct 820 ms 10528 KB Output is correct
76 Correct 744 ms 10560 KB Output is correct
77 Correct 747 ms 10520 KB Output is correct
78 Correct 738 ms 10576 KB Output is correct
79 Correct 695 ms 10488 KB Output is correct
80 Correct 697 ms 10284 KB Output is correct
81 Correct 738 ms 10320 KB Output is correct
82 Correct 647 ms 10376 KB Output is correct
83 Correct 650 ms 10644 KB Output is correct
84 Correct 650 ms 10352 KB Output is correct
85 Correct 1562 ms 14672 KB Output is correct
86 Correct 168 ms 12076 KB Output is correct
87 Correct 115 ms 12196 KB Output is correct
88 Correct 1483 ms 13408 KB Output is correct
89 Correct 1667 ms 14860 KB Output is correct
90 Correct 1441 ms 13396 KB Output is correct
91 Correct 831 ms 10580 KB Output is correct
92 Correct 840 ms 10580 KB Output is correct
93 Correct 903 ms 10324 KB Output is correct
94 Correct 1308 ms 12660 KB Output is correct
95 Correct 1235 ms 12564 KB Output is correct
96 Correct 1280 ms 12884 KB Output is correct
97 Correct 1460 ms 13232 KB Output is correct
98 Correct 1488 ms 13332 KB Output is correct
99 Correct 1736 ms 14472 KB Output is correct
100 Correct 1800 ms 14444 KB Output is correct
101 Correct 1770 ms 14676 KB Output is correct
102 Correct 1760 ms 14680 KB Output is correct
103 Correct 1480 ms 13556 KB Output is correct
104 Correct 1485 ms 13540 KB Output is correct
105 Correct 1418 ms 13044 KB Output is correct
106 Correct 1226 ms 12540 KB Output is correct
107 Correct 1374 ms 13400 KB Output is correct
108 Correct 1679 ms 14472 KB Output is correct
109 Correct 1281 ms 11860 KB Output is correct