oj.uz

Submission #645995

# Submission time Handle Problem Language Result Execution time Memory
645995 2022-09-28T12:28:07 Z Tenis0206 Bridges (APIO19_bridges) C++11
100 / 100
 2123 ms 11288 KB 
#include <bits/stdc++.h>

using namespace std;

const int bsize = 1000;

struct eveniment
{
    int tip,poz,val;
};

int n,m,q;

pair<int,int> e[100005];
int c[100005];
int new_c[100005];

bool ch[100005];

int rez[100005];

int t[100005];
int rang[100005];

stack<pair<int,int>> st;

int reprezentant(int nod)
{
    if(nod==t[nod])
    {
        return nod;
    }
    return reprezentant(t[nod]);
}

void uneste(int x, int y)
{
    x = reprezentant(x);
    y = reprezentant(y);
    st.push({x,y});
    if(x==y)
    {
        return;
    }
    if(rang[x] > rang[y])
    {
        t[y] = x;
        rang[x] += rang[y];
    }
    else
    {
        t[x] = y;
        rang[y] += rang[x];
    }
}

void remove_last()
{
    int x = st.top().first;
    int y = st.top().second;
    st.pop();
    if(x==y)
    {
        return;
    }
    if(x==t[y])
    {
        t[y] = y;
        rang[x] -= rang[y];
    }
    else
    {
        t[x] = x;
        rang[y] -= rang[x];
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y>>c[i];
        e[i] = {x,y};
    }
    for(int i=1;i<=n;i++)
    {
        t[i] = i;
        rang[i] = 1;
    }
    cin>>q;
    vector<eveniment> eves;
    eves.push_back(eveniment{0,0,0});
    for(int i=1;i<=q;i++)
    {
        eveniment x;
        cin>>x.tip>>x.poz>>x.val;
        eves.push_back(x);
    }
    for(int l=1;l<=q;l+=bsize)
    {
        int r = min(q,l + bsize - 1);
        vector<pair<pair<int,int>,int>> queries;
        vector<pair<pair<int,int>,int>> sp_upd;
        vector<pair<int,pair<int,int>>> upd;
        for(int i=l;i<=r;i++)
        {
            if(eves[i].tip==2)
            {
                queries.push_back({{eves[i].val,eves[i].poz},i});
            }
            else
            {
                ch[eves[i].poz] = true;
                sp_upd.push_back({{eves[i].poz, eves[i].val},i});
            }
        }
        for(int i=1;i<=m;i++)
        {
            if(!ch[i])
            {
                upd.push_back({c[i],{e[i].first,e[i].second}});
            }
            ch[i] = false;
        }
        sort(upd.begin(),upd.end(),greater<pair<int,pair<int,int>>>());
        sort(queries.begin(),queries.end(),greater<pair<pair<int,int>,int>>());
        int poz = 0;
        for(auto it : queries)
        {
            while(poz<upd.size() && upd[poz].first >= it.first.first)
            {
                uneste(upd[poz].second.first,upd[poz].second.second);
                ++poz;
            }
            int cnt = 0;
            for(auto edge : sp_upd)
            {
                if(edge.second <= it.second)
                {
                    new_c[edge.first.first] = edge.first.second;
                }
            }
            for(auto edge : sp_upd)
            {
                if(new_c[edge.first.first]==0)
                {
                    if(c[edge.first.first] >= it.first.first)
                    {
                        uneste(e[edge.first.first].first,e[edge.first.first].second);
                        ++cnt;
                    }
                    continue;
                }
                if(new_c[edge.first.first] >= it.first.first)
                {
                    uneste(e[edge.first.first].first,e[edge.first.first].second);
                    ++cnt;
                }
            }
            for(auto edge : sp_upd)
            {
                new_c[edge.first.first] = 0;
            }
            rez[it.second] = rang[reprezentant(it.first.second)];
            while(cnt)
            {
                remove_last();
                --cnt;
            }
        }
        while(!st.empty())
        {
            remove_last();
        }
        for(int i=l;i<=r;i++)
        {
            if(eves[i].tip==1)
            {
                c[eves[i].poz] = eves[i].val;
            }
        }
    }
    for(int i=1;i<=q;i++)
    {
        if(eves[i].tip==2)
        {
            cout<<rez[i]<<'\n';
        }
    }
    return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:134:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |             while(poz<upd.size() && upd[poz].first >= it.first.first)
      |                   ~~~^~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 45 ms 664 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 48 ms 628 KB Output is correct
6 Correct 39 ms 636 KB Output is correct
7 Correct 46 ms 596 KB Output is correct
8 Correct 49 ms 632 KB Output is correct
9 Correct 57 ms 636 KB Output is correct
10 Correct 50 ms 684 KB Output is correct
11 Correct 49 ms 628 KB Output is correct
12 Correct 58 ms 628 KB Output is correct
13 Correct 60 ms 640 KB Output is correct
14 Correct 50 ms 596 KB Output is correct
15 Correct 54 ms 644 KB Output is correct
16 Correct 54 ms 636 KB Output is correct
17 Correct 53 ms 624 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1242 ms 4800 KB Output is correct
2 Correct 1258 ms 7532 KB Output is correct
3 Correct 1277 ms 7568 KB Output is correct
4 Correct 1292 ms 7788 KB Output is correct
5 Correct 1325 ms 7752 KB Output is correct
6 Correct 1823 ms 7628 KB Output is correct
7 Correct 1826 ms 7492 KB Output is correct
8 Correct 1844 ms 7500 KB Output is correct
9 Correct 32 ms 3576 KB Output is correct
10 Correct 1250 ms 6476 KB Output is correct
11 Correct 1237 ms 6516 KB Output is correct
12 Correct 1028 ms 7500 KB Output is correct
13 Correct 1074 ms 7556 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 995 ms 3888 KB Output is correct
2 Correct 792 ms 4168 KB Output is correct
3 Correct 1172 ms 6128 KB Output is correct
4 Correct 997 ms 6296 KB Output is correct
5 Correct 33 ms 3536 KB Output is correct
6 Correct 1110 ms 6220 KB Output is correct
7 Correct 918 ms 5992 KB Output is correct
8 Correct 808 ms 5912 KB Output is correct
9 Correct 612 ms 6180 KB Output is correct
10 Correct 561 ms 6088 KB Output is correct
11 Correct 673 ms 6012 KB Output is correct
12 Correct 602 ms 5832 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1342 ms 7360 KB Output is correct
2 Correct 39 ms 3556 KB Output is correct
3 Correct 146 ms 7188 KB Output is correct
4 Correct 151 ms 7284 KB Output is correct
5 Correct 1517 ms 9436 KB Output is correct
6 Correct 1291 ms 11056 KB Output is correct
7 Correct 1525 ms 9552 KB Output is correct
8 Correct 640 ms 7388 KB Output is correct
9 Correct 634 ms 7600 KB Output is correct
10 Correct 635 ms 7264 KB Output is correct
11 Correct 991 ms 9580 KB Output is correct
12 Correct 952 ms 9776 KB Output is correct
13 Correct 1028 ms 9688 KB Output is correct
14 Correct 1449 ms 9908 KB Output is correct
15 Correct 1526 ms 9448 KB Output is correct
16 Correct 1351 ms 10928 KB Output is correct
17 Correct 1363 ms 10948 KB Output is correct
18 Correct 1335 ms 11032 KB Output is correct
19 Correct 1350 ms 10980 KB Output is correct
20 Correct 1161 ms 9952 KB Output is correct
21 Correct 1178 ms 10052 KB Output is correct
22 Correct 1311 ms 10880 KB Output is correct
23 Correct 1190 ms 8924 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1242 ms 4800 KB Output is correct
2 Correct 1258 ms 7532 KB Output is correct
3 Correct 1277 ms 7568 KB Output is correct
4 Correct 1292 ms 7788 KB Output is correct
5 Correct 1325 ms 7752 KB Output is correct
6 Correct 1823 ms 7628 KB Output is correct
7 Correct 1826 ms 7492 KB Output is correct
8 Correct 1844 ms 7500 KB Output is correct
9 Correct 32 ms 3576 KB Output is correct
10 Correct 1250 ms 6476 KB Output is correct
11 Correct 1237 ms 6516 KB Output is correct
12 Correct 1028 ms 7500 KB Output is correct
13 Correct 1074 ms 7556 KB Output is correct
14 Correct 995 ms 3888 KB Output is correct
15 Correct 792 ms 4168 KB Output is correct
16 Correct 1172 ms 6128 KB Output is correct
17 Correct 997 ms 6296 KB Output is correct
18 Correct 33 ms 3536 KB Output is correct
19 Correct 1110 ms 6220 KB Output is correct
20 Correct 918 ms 5992 KB Output is correct
21 Correct 808 ms 5912 KB Output is correct
22 Correct 612 ms 6180 KB Output is correct
23 Correct 561 ms 6088 KB Output is correct
24 Correct 673 ms 6012 KB Output is correct
25 Correct 602 ms 5832 KB Output is correct
26 Correct 1266 ms 7480 KB Output is correct
27 Correct 1582 ms 7408 KB Output is correct
28 Correct 1293 ms 7592 KB Output is correct
29 Correct 977 ms 7620 KB Output is correct
30 Correct 1459 ms 7516 KB Output is correct
31 Correct 1546 ms 7724 KB Output is correct
32 Correct 1523 ms 7380 KB Output is correct
33 Correct 1254 ms 7648 KB Output is correct
34 Correct 1271 ms 7648 KB Output is correct
35 Correct 1285 ms 7892 KB Output is correct
36 Correct 1002 ms 7616 KB Output is correct
37 Correct 1008 ms 7652 KB Output is correct
38 Correct 979 ms 7560 KB Output is correct
39 Correct 782 ms 7768 KB Output is correct
40 Correct 762 ms 7804 KB Output is correct
41 Correct 776 ms 7708 KB Output is correct
42 Correct 754 ms 7428 KB Output is correct
43 Correct 755 ms 7684 KB Output is correct
44 Correct 743 ms 7616 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 45 ms 664 KB Output is correct
4 Correct 4 ms 596 KB Output is correct
5 Correct 48 ms 628 KB Output is correct
6 Correct 39 ms 636 KB Output is correct
7 Correct 46 ms 596 KB Output is correct
8 Correct 49 ms 632 KB Output is correct
9 Correct 57 ms 636 KB Output is correct
10 Correct 50 ms 684 KB Output is correct
11 Correct 49 ms 628 KB Output is correct
12 Correct 58 ms 628 KB Output is correct
13 Correct 60 ms 640 KB Output is correct
14 Correct 50 ms 596 KB Output is correct
15 Correct 54 ms 644 KB Output is correct
16 Correct 54 ms 636 KB Output is correct
17 Correct 53 ms 624 KB Output is correct
18 Correct 1242 ms 4800 KB Output is correct
19 Correct 1258 ms 7532 KB Output is correct
20 Correct 1277 ms 7568 KB Output is correct
21 Correct 1292 ms 7788 KB Output is correct
22 Correct 1325 ms 7752 KB Output is correct
23 Correct 1823 ms 7628 KB Output is correct
24 Correct 1826 ms 7492 KB Output is correct
25 Correct 1844 ms 7500 KB Output is correct
26 Correct 32 ms 3576 KB Output is correct
27 Correct 1250 ms 6476 KB Output is correct
28 Correct 1237 ms 6516 KB Output is correct
29 Correct 1028 ms 7500 KB Output is correct
30 Correct 1074 ms 7556 KB Output is correct
31 Correct 995 ms 3888 KB Output is correct
32 Correct 792 ms 4168 KB Output is correct
33 Correct 1172 ms 6128 KB Output is correct
34 Correct 997 ms 6296 KB Output is correct
35 Correct 33 ms 3536 KB Output is correct
36 Correct 1110 ms 6220 KB Output is correct
37 Correct 918 ms 5992 KB Output is correct
38 Correct 808 ms 5912 KB Output is correct
39 Correct 612 ms 6180 KB Output is correct
40 Correct 561 ms 6088 KB Output is correct
41 Correct 673 ms 6012 KB Output is correct
42 Correct 602 ms 5832 KB Output is correct
43 Correct 1342 ms 7360 KB Output is correct
44 Correct 39 ms 3556 KB Output is correct
45 Correct 146 ms 7188 KB Output is correct
46 Correct 151 ms 7284 KB Output is correct
47 Correct 1517 ms 9436 KB Output is correct
48 Correct 1291 ms 11056 KB Output is correct
49 Correct 1525 ms 9552 KB Output is correct
50 Correct 640 ms 7388 KB Output is correct
51 Correct 634 ms 7600 KB Output is correct
52 Correct 635 ms 7264 KB Output is correct
53 Correct 991 ms 9580 KB Output is correct
54 Correct 952 ms 9776 KB Output is correct
55 Correct 1028 ms 9688 KB Output is correct
56 Correct 1449 ms 9908 KB Output is correct
57 Correct 1526 ms 9448 KB Output is correct
58 Correct 1351 ms 10928 KB Output is correct
59 Correct 1363 ms 10948 KB Output is correct
60 Correct 1335 ms 11032 KB Output is correct
61 Correct 1350 ms 10980 KB Output is correct
62 Correct 1161 ms 9952 KB Output is correct
63 Correct 1178 ms 10052 KB Output is correct
64 Correct 1311 ms 10880 KB Output is correct
65 Correct 1190 ms 8924 KB Output is correct
66 Correct 1266 ms 7480 KB Output is correct
67 Correct 1582 ms 7408 KB Output is correct
68 Correct 1293 ms 7592 KB Output is correct
69 Correct 977 ms 7620 KB Output is correct
70 Correct 1459 ms 7516 KB Output is correct
71 Correct 1546 ms 7724 KB Output is correct
72 Correct 1523 ms 7380 KB Output is correct
73 Correct 1254 ms 7648 KB Output is correct
74 Correct 1271 ms 7648 KB Output is correct
75 Correct 1285 ms 7892 KB Output is correct
76 Correct 1002 ms 7616 KB Output is correct
77 Correct 1008 ms 7652 KB Output is correct
78 Correct 979 ms 7560 KB Output is correct
79 Correct 782 ms 7768 KB Output is correct
80 Correct 762 ms 7804 KB Output is correct
81 Correct 776 ms 7708 KB Output is correct
82 Correct 754 ms 7428 KB Output is correct
83 Correct 755 ms 7684 KB Output is correct
84 Correct 743 ms 7616 KB Output is correct
85 Correct 1834 ms 11288 KB Output is correct
86 Correct 183 ms 7244 KB Output is correct
87 Correct 184 ms 7588 KB Output is correct
88 Correct 2008 ms 9708 KB Output is correct
89 Correct 1843 ms 11076 KB Output is correct
90 Correct 2011 ms 9572 KB Output is correct
91 Correct 1298 ms 7600 KB Output is correct
92 Correct 1285 ms 7640 KB Output is correct
93 Correct 1868 ms 7464 KB Output is correct
94 Correct 1615 ms 9608 KB Output is correct
95 Correct 1584 ms 9728 KB Output is correct
96 Correct 1936 ms 9528 KB Output is correct
97 Correct 1626 ms 9796 KB Output is correct
98 Correct 1693 ms 9520 KB Output is correct
99 Correct 1886 ms 11124 KB Output is correct
100 Correct 1896 ms 11052 KB Output is correct
101 Correct 1910 ms 11192 KB Output is correct
102 Correct 1906 ms 11072 KB Output is correct
103 Correct 2103 ms 9876 KB Output is correct
104 Correct 2123 ms 9904 KB Output is correct
105 Correct 1487 ms 10196 KB Output is correct
106 Correct 1182 ms 9400 KB Output is correct
107 Correct 1411 ms 10548 KB Output is correct
108 Correct 1964 ms 10700 KB Output is correct
109 Correct 1956 ms 8896 KB Output is correct