oj.uz

Submission #887083

# Submission time Handle Problem Language Result Execution time Memory
887083 2023-12-13T16:40:16 Z andrei_boaca Bridges (APIO19_bridges) C++17
100 / 100
 1637 ms 10524 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int,int> pii;
const int bucksize=1000;
int n,m,q;
pii g[100005];
int cost[100005],aux[100005],par[100005],sz[100005],sol[100005];
bool changed[100005];
struct date
{
    int tip,a,b;
};
vector<date> buff;
int getpar(int nod)
{
    while(par[nod]!=nod)
        nod=par[nod];
    return nod;
}
bool comp(date a, date b)
{
    if(a.b!=b.b)
        return a.b>b.b;
    return a.tip<b.tip;
}
void solve()
{
    for(int i=1;i<=m;i++)
    {
        changed[i]=0;
        aux[i]=cost[i];
    }
    vector<int> modif;
    vector<date> ev;
    for(int i=0;i<buff.size();i++)
    {
        sol[i]=0;
        int tip=buff[i].tip;
        if(tip==1)
        {
            modif.push_back(buff[i].a);
            changed[buff[i].a]=1;
        }
        else
            ev.push_back({2,i,buff[i].b});
    }
    for(int i=1;i<=m;i++)
        if(!changed[i])
            ev.push_back({1,i,cost[i]});
    sort(ev.begin(),ev.end(),comp);
    for(int i=1;i<=n;i++)
    {
        sz[i]=1;
        par[i]=i;
    }
    for(date z:ev)
    {
        int tip=z.tip;
        if(tip==1)
        {
            int ind=z.a;
            int a=getpar(g[ind].first);
            int b=getpar(g[ind].second);
            if(a!=b)
            {
                if(sz[a]<sz[b])
                    swap(a,b);
                par[b]=a;
                sz[a]+=sz[b];
            }
        }
        else
        {
            int p=z.a;
            for(int i:modif)
                cost[i]=aux[i];
            for(int i=0;i<=p;i++)
                if(buff[i].tip==1)
                {
                    int ind=buff[i].a;
                    int c=buff[i].b;
                    cost[ind]=c;
                }
            int nod=buff[p].a;
            int c=buff[p].b;
            stack<pii> stiva;
            for(int i:modif)
                if(cost[i]>=c)
                {
                    int a=getpar(g[i].first);
                    int b=getpar(g[i].second);
                    if(a!=b)
                    {
                        if(sz[a]<sz[b])
                            swap(a,b);
                        par[b]=a;
                        sz[a]+=sz[b];
                        stiva.push({a,b});
                    }
                }
            sol[p]=sz[getpar(nod)];
            while(!stiva.empty())
            {
                int a=stiva.top().first;
                int b=stiva.top().second;
                stiva.pop();
                sz[a]-=sz[b];
                par[b]=b;
            }
        }
    }
    for(int i=0;i<buff.size();i++)
        if(sol[i]!=0)
            cout<<sol[i]<<'\n';
    for(int i=1;i<=m;i++)
        cost[i]=aux[i];
    for(date z:buff)
        if(z.tip==1)
            cost[z.a]=z.b;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        g[i]={a,b};
        cost[i]=c;
    }
    cin>>q;
    while(q--)
    {
        int tip,a,b;
        cin>>tip>>a>>b;
        buff.push_back({tip,a,b});
        if(buff.size()==bucksize)
        {
            solve();
            buff.clear();
        }
    }
    if(!buff.empty())
        solve();
    buff.clear();
    return 0;
}

Compilation message

bridges.cpp: In function 'void solve()':
bridges.cpp:36:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<date>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for(int i=0;i<buff.size();i++)
      |                 ~^~~~~~~~~~~~
bridges.cpp:113:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<date>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for(int i=0;i<buff.size();i++)
      |                 ~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 20 ms 2648 KB Output is correct
4 Correct 10 ms 2652 KB Output is correct
5 Correct 24 ms 2652 KB Output is correct
6 Correct 18 ms 2652 KB Output is correct
7 Correct 19 ms 2396 KB Output is correct
8 Correct 26 ms 2652 KB Output is correct
9 Correct 21 ms 2652 KB Output is correct
10 Correct 25 ms 2692 KB Output is correct
11 Correct 25 ms 2652 KB Output is correct
12 Correct 30 ms 2652 KB Output is correct
13 Correct 29 ms 2696 KB Output is correct
14 Correct 27 ms 2652 KB Output is correct
15 Correct 31 ms 2652 KB Output is correct
16 Correct 21 ms 2648 KB Output is correct
17 Correct 22 ms 2652 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 861 ms 6012 KB Output is correct
2 Correct 874 ms 5936 KB Output is correct
3 Correct 875 ms 6056 KB Output is correct
4 Correct 927 ms 5920 KB Output is correct
5 Correct 928 ms 5964 KB Output is correct
6 Correct 1055 ms 6228 KB Output is correct
7 Correct 1055 ms 6032 KB Output is correct
8 Correct 1068 ms 6136 KB Output is correct
9 Correct 77 ms 3668 KB Output is correct
10 Correct 613 ms 5576 KB Output is correct
11 Correct 609 ms 5412 KB Output is correct
12 Correct 806 ms 6216 KB Output is correct
13 Correct 774 ms 5708 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 623 ms 5440 KB Output is correct
2 Correct 355 ms 4072 KB Output is correct
3 Correct 660 ms 5212 KB Output is correct
4 Correct 615 ms 5328 KB Output is correct
5 Correct 83 ms 3668 KB Output is correct
6 Correct 643 ms 5036 KB Output is correct
7 Correct 600 ms 5312 KB Output is correct
8 Correct 577 ms 5188 KB Output is correct
9 Correct 516 ms 5432 KB Output is correct
10 Correct 511 ms 5308 KB Output is correct
11 Correct 489 ms 4732 KB Output is correct
12 Correct 465 ms 4708 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1421 ms 8888 KB Output is correct
2 Correct 75 ms 3976 KB Output is correct
3 Correct 154 ms 8044 KB Output is correct
4 Correct 95 ms 7932 KB Output is correct
5 Correct 937 ms 9132 KB Output is correct
6 Correct 1372 ms 10516 KB Output is correct
7 Correct 936 ms 8896 KB Output is correct
8 Correct 668 ms 7044 KB Output is correct
9 Correct 667 ms 7180 KB Output is correct
10 Correct 672 ms 7208 KB Output is correct
11 Correct 1059 ms 8744 KB Output is correct
12 Correct 1045 ms 9380 KB Output is correct
13 Correct 1064 ms 8908 KB Output is correct
14 Correct 859 ms 8924 KB Output is correct
15 Correct 907 ms 8772 KB Output is correct
16 Correct 1408 ms 10288 KB Output is correct
17 Correct 1417 ms 10272 KB Output is correct
18 Correct 1407 ms 10524 KB Output is correct
19 Correct 1419 ms 10216 KB Output is correct
20 Correct 1209 ms 9576 KB Output is correct
21 Correct 1204 ms 9556 KB Output is correct
22 Correct 1353 ms 10196 KB Output is correct
23 Correct 905 ms 8364 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 861 ms 6012 KB Output is correct
2 Correct 874 ms 5936 KB Output is correct
3 Correct 875 ms 6056 KB Output is correct
4 Correct 927 ms 5920 KB Output is correct
5 Correct 928 ms 5964 KB Output is correct
6 Correct 1055 ms 6228 KB Output is correct
7 Correct 1055 ms 6032 KB Output is correct
8 Correct 1068 ms 6136 KB Output is correct
9 Correct 77 ms 3668 KB Output is correct
10 Correct 613 ms 5576 KB Output is correct
11 Correct 609 ms 5412 KB Output is correct
12 Correct 806 ms 6216 KB Output is correct
13 Correct 774 ms 5708 KB Output is correct
14 Correct 623 ms 5440 KB Output is correct
15 Correct 355 ms 4072 KB Output is correct
16 Correct 660 ms 5212 KB Output is correct
17 Correct 615 ms 5328 KB Output is correct
18 Correct 83 ms 3668 KB Output is correct
19 Correct 643 ms 5036 KB Output is correct
20 Correct 600 ms 5312 KB Output is correct
21 Correct 577 ms 5188 KB Output is correct
22 Correct 516 ms 5432 KB Output is correct
23 Correct 511 ms 5308 KB Output is correct
24 Correct 489 ms 4732 KB Output is correct
25 Correct 465 ms 4708 KB Output is correct
26 Correct 870 ms 5928 KB Output is correct
27 Correct 948 ms 4652 KB Output is correct
28 Correct 910 ms 4300 KB Output is correct
29 Correct 777 ms 4260 KB Output is correct
30 Correct 938 ms 4292 KB Output is correct
31 Correct 941 ms 4312 KB Output is correct
32 Correct 951 ms 4508 KB Output is correct
33 Correct 890 ms 4412 KB Output is correct
34 Correct 887 ms 4412 KB Output is correct
35 Correct 914 ms 4532 KB Output is correct
36 Correct 803 ms 4528 KB Output is correct
37 Correct 793 ms 4332 KB Output is correct
38 Correct 790 ms 4264 KB Output is correct
39 Correct 724 ms 4308 KB Output is correct
40 Correct 719 ms 4332 KB Output is correct
41 Correct 731 ms 4352 KB Output is correct
42 Correct 674 ms 4356 KB Output is correct
43 Correct 674 ms 4180 KB Output is correct
44 Correct 677 ms 4168 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 20 ms 2648 KB Output is correct
4 Correct 10 ms 2652 KB Output is correct
5 Correct 24 ms 2652 KB Output is correct
6 Correct 18 ms 2652 KB Output is correct
7 Correct 19 ms 2396 KB Output is correct
8 Correct 26 ms 2652 KB Output is correct
9 Correct 21 ms 2652 KB Output is correct
10 Correct 25 ms 2692 KB Output is correct
11 Correct 25 ms 2652 KB Output is correct
12 Correct 30 ms 2652 KB Output is correct
13 Correct 29 ms 2696 KB Output is correct
14 Correct 27 ms 2652 KB Output is correct
15 Correct 31 ms 2652 KB Output is correct
16 Correct 21 ms 2648 KB Output is correct
17 Correct 22 ms 2652 KB Output is correct
18 Correct 861 ms 6012 KB Output is correct
19 Correct 874 ms 5936 KB Output is correct
20 Correct 875 ms 6056 KB Output is correct
21 Correct 927 ms 5920 KB Output is correct
22 Correct 928 ms 5964 KB Output is correct
23 Correct 1055 ms 6228 KB Output is correct
24 Correct 1055 ms 6032 KB Output is correct
25 Correct 1068 ms 6136 KB Output is correct
26 Correct 77 ms 3668 KB Output is correct
27 Correct 613 ms 5576 KB Output is correct
28 Correct 609 ms 5412 KB Output is correct
29 Correct 806 ms 6216 KB Output is correct
30 Correct 774 ms 5708 KB Output is correct
31 Correct 623 ms 5440 KB Output is correct
32 Correct 355 ms 4072 KB Output is correct
33 Correct 660 ms 5212 KB Output is correct
34 Correct 615 ms 5328 KB Output is correct
35 Correct 83 ms 3668 KB Output is correct
36 Correct 643 ms 5036 KB Output is correct
37 Correct 600 ms 5312 KB Output is correct
38 Correct 577 ms 5188 KB Output is correct
39 Correct 516 ms 5432 KB Output is correct
40 Correct 511 ms 5308 KB Output is correct
41 Correct 489 ms 4732 KB Output is correct
42 Correct 465 ms 4708 KB Output is correct
43 Correct 1421 ms 8888 KB Output is correct
44 Correct 75 ms 3976 KB Output is correct
45 Correct 154 ms 8044 KB Output is correct
46 Correct 95 ms 7932 KB Output is correct
47 Correct 937 ms 9132 KB Output is correct
48 Correct 1372 ms 10516 KB Output is correct
49 Correct 936 ms 8896 KB Output is correct
50 Correct 668 ms 7044 KB Output is correct
51 Correct 667 ms 7180 KB Output is correct
52 Correct 672 ms 7208 KB Output is correct
53 Correct 1059 ms 8744 KB Output is correct
54 Correct 1045 ms 9380 KB Output is correct
55 Correct 1064 ms 8908 KB Output is correct
56 Correct 859 ms 8924 KB Output is correct
57 Correct 907 ms 8772 KB Output is correct
58 Correct 1408 ms 10288 KB Output is correct
59 Correct 1417 ms 10272 KB Output is correct
60 Correct 1407 ms 10524 KB Output is correct
61 Correct 1419 ms 10216 KB Output is correct
62 Correct 1209 ms 9576 KB Output is correct
63 Correct 1204 ms 9556 KB Output is correct
64 Correct 1353 ms 10196 KB Output is correct
65 Correct 905 ms 8364 KB Output is correct
66 Correct 870 ms 5928 KB Output is correct
67 Correct 948 ms 4652 KB Output is correct
68 Correct 910 ms 4300 KB Output is correct
69 Correct 777 ms 4260 KB Output is correct
70 Correct 938 ms 4292 KB Output is correct
71 Correct 941 ms 4312 KB Output is correct
72 Correct 951 ms 4508 KB Output is correct
73 Correct 890 ms 4412 KB Output is correct
74 Correct 887 ms 4412 KB Output is correct
75 Correct 914 ms 4532 KB Output is correct
76 Correct 803 ms 4528 KB Output is correct
77 Correct 793 ms 4332 KB Output is correct
78 Correct 790 ms 4264 KB Output is correct
79 Correct 724 ms 4308 KB Output is correct
80 Correct 719 ms 4332 KB Output is correct
81 Correct 731 ms 4352 KB Output is correct
82 Correct 674 ms 4356 KB Output is correct
83 Correct 674 ms 4180 KB Output is correct
84 Correct 677 ms 4168 KB Output is correct
85 Correct 1576 ms 9964 KB Output is correct
86 Correct 168 ms 7912 KB Output is correct
87 Correct 106 ms 7916 KB Output is correct
88 Correct 1074 ms 8640 KB Output is correct
89 Correct 1568 ms 10120 KB Output is correct
90 Correct 1071 ms 8476 KB Output is correct
91 Correct 907 ms 7020 KB Output is correct
92 Correct 896 ms 7092 KB Output is correct
93 Correct 1018 ms 7040 KB Output is correct
94 Correct 1297 ms 8920 KB Output is correct
95 Correct 1274 ms 8936 KB Output is correct
96 Correct 1343 ms 9100 KB Output is correct
97 Correct 986 ms 8808 KB Output is correct
98 Correct 944 ms 8416 KB Output is correct
99 Correct 1637 ms 9944 KB Output is correct
100 Correct 1610 ms 9864 KB Output is correct
101 Correct 1621 ms 10060 KB Output is correct
102 Correct 1608 ms 10288 KB Output is correct
103 Correct 1443 ms 9572 KB Output is correct
104 Correct 1478 ms 9508 KB Output is correct
105 Correct 1270 ms 9456 KB Output is correct
106 Correct 1079 ms 8656 KB Output is correct
107 Correct 1267 ms 9480 KB Output is correct
108 Correct 1570 ms 9728 KB Output is correct
109 Correct 1088 ms 7952 KB Output is correct