oj.uz

Submission #887085

# Submission time Handle Problem Language Result Execution time Memory
887085 2023-12-13T16:47:23 Z andrei_boaca Bridges (APIO19_bridges) C++17
100 / 100
 1304 ms 6612 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")
using namespace std;
typedef pair<int,int> pii;
const int bucksize=1500;
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:38:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<date>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i=0;i<buff.size();i++)
      |                 ~^~~~~~~~~~~~
bridges.cpp:115:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<date>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |     for(int i=0;i<buff.size();i++)
      |                 ~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 33 ms 2608 KB Output is correct
4 Correct 7 ms 2396 KB Output is correct
5 Correct 35 ms 2584 KB Output is correct
6 Correct 24 ms 2396 KB Output is correct
7 Correct 26 ms 2592 KB Output is correct
8 Correct 39 ms 2396 KB Output is correct
9 Correct 25 ms 2396 KB Output is correct
10 Correct 38 ms 2396 KB Output is correct
11 Correct 39 ms 2396 KB Output is correct
12 Correct 49 ms 2396 KB Output is correct
13 Correct 45 ms 2392 KB Output is correct
14 Correct 41 ms 2392 KB Output is correct
15 Correct 48 ms 2392 KB Output is correct
16 Correct 29 ms 2396 KB Output is correct
17 Correct 32 ms 2396 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 798 ms 4600 KB Output is correct
2 Correct 813 ms 4456 KB Output is correct
3 Correct 819 ms 4512 KB Output is correct
4 Correct 842 ms 4540 KB Output is correct
5 Correct 848 ms 4476 KB Output is correct
6 Correct 1097 ms 4460 KB Output is correct
7 Correct 994 ms 4632 KB Output is correct
8 Correct 1000 ms 4808 KB Output is correct
9 Correct 76 ms 3224 KB Output is correct
10 Correct 637 ms 4364 KB Output is correct
11 Correct 621 ms 4412 KB Output is correct
12 Correct 663 ms 4804 KB Output is correct
13 Correct 649 ms 4384 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 625 ms 3956 KB Output is correct
2 Correct 449 ms 3020 KB Output is correct
3 Correct 700 ms 4524 KB Output is correct
4 Correct 614 ms 4088 KB Output is correct
5 Correct 63 ms 2760 KB Output is correct
6 Correct 713 ms 4216 KB Output is correct
7 Correct 603 ms 4020 KB Output is correct
8 Correct 549 ms 3796 KB Output is correct
9 Correct 422 ms 4196 KB Output is correct
10 Correct 394 ms 4056 KB Output is correct
11 Correct 447 ms 3688 KB Output is correct
12 Correct 391 ms 3468 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 934 ms 6416 KB Output is correct
2 Correct 68 ms 2644 KB Output is correct
3 Correct 109 ms 6028 KB Output is correct
4 Correct 71 ms 5952 KB Output is correct
5 Correct 660 ms 6480 KB Output is correct
6 Correct 931 ms 6424 KB Output is correct
7 Correct 642 ms 6424 KB Output is correct
8 Correct 457 ms 4372 KB Output is correct
9 Correct 461 ms 4476 KB Output is correct
10 Correct 472 ms 4716 KB Output is correct
11 Correct 726 ms 5736 KB Output is correct
12 Correct 710 ms 5716 KB Output is correct
13 Correct 723 ms 5964 KB Output is correct
14 Correct 587 ms 6572 KB Output is correct
15 Correct 632 ms 6556 KB Output is correct
16 Correct 955 ms 6428 KB Output is correct
17 Correct 958 ms 6412 KB Output is correct
18 Correct 951 ms 6344 KB Output is correct
19 Correct 948 ms 6548 KB Output is correct
20 Correct 811 ms 6248 KB Output is correct
21 Correct 810 ms 6408 KB Output is correct
22 Correct 918 ms 6428 KB Output is correct
23 Correct 638 ms 6168 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 798 ms 4600 KB Output is correct
2 Correct 813 ms 4456 KB Output is correct
3 Correct 819 ms 4512 KB Output is correct
4 Correct 842 ms 4540 KB Output is correct
5 Correct 848 ms 4476 KB Output is correct
6 Correct 1097 ms 4460 KB Output is correct
7 Correct 994 ms 4632 KB Output is correct
8 Correct 1000 ms 4808 KB Output is correct
9 Correct 76 ms 3224 KB Output is correct
10 Correct 637 ms 4364 KB Output is correct
11 Correct 621 ms 4412 KB Output is correct
12 Correct 663 ms 4804 KB Output is correct
13 Correct 649 ms 4384 KB Output is correct
14 Correct 625 ms 3956 KB Output is correct
15 Correct 449 ms 3020 KB Output is correct
16 Correct 700 ms 4524 KB Output is correct
17 Correct 614 ms 4088 KB Output is correct
18 Correct 63 ms 2760 KB Output is correct
19 Correct 713 ms 4216 KB Output is correct
20 Correct 603 ms 4020 KB Output is correct
21 Correct 549 ms 3796 KB Output is correct
22 Correct 422 ms 4196 KB Output is correct
23 Correct 394 ms 4056 KB Output is correct
24 Correct 447 ms 3688 KB Output is correct
25 Correct 391 ms 3468 KB Output is correct
26 Correct 779 ms 4292 KB Output is correct
27 Correct 911 ms 4640 KB Output is correct
28 Correct 903 ms 4444 KB Output is correct
29 Correct 658 ms 4276 KB Output is correct
30 Correct 911 ms 4400 KB Output is correct
31 Correct 899 ms 4428 KB Output is correct
32 Correct 986 ms 4480 KB Output is correct
33 Correct 818 ms 4400 KB Output is correct
34 Correct 840 ms 4464 KB Output is correct
35 Correct 883 ms 4384 KB Output is correct
36 Correct 685 ms 4380 KB Output is correct
37 Correct 686 ms 4508 KB Output is correct
38 Correct 699 ms 4308 KB Output is correct
39 Correct 536 ms 4340 KB Output is correct
40 Correct 528 ms 4464 KB Output is correct
41 Correct 532 ms 4336 KB Output is correct
42 Correct 520 ms 4172 KB Output is correct
43 Correct 517 ms 4372 KB Output is correct
44 Correct 514 ms 4196 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 33 ms 2608 KB Output is correct
4 Correct 7 ms 2396 KB Output is correct
5 Correct 35 ms 2584 KB Output is correct
6 Correct 24 ms 2396 KB Output is correct
7 Correct 26 ms 2592 KB Output is correct
8 Correct 39 ms 2396 KB Output is correct
9 Correct 25 ms 2396 KB Output is correct
10 Correct 38 ms 2396 KB Output is correct
11 Correct 39 ms 2396 KB Output is correct
12 Correct 49 ms 2396 KB Output is correct
13 Correct 45 ms 2392 KB Output is correct
14 Correct 41 ms 2392 KB Output is correct
15 Correct 48 ms 2392 KB Output is correct
16 Correct 29 ms 2396 KB Output is correct
17 Correct 32 ms 2396 KB Output is correct
18 Correct 798 ms 4600 KB Output is correct
19 Correct 813 ms 4456 KB Output is correct
20 Correct 819 ms 4512 KB Output is correct
21 Correct 842 ms 4540 KB Output is correct
22 Correct 848 ms 4476 KB Output is correct
23 Correct 1097 ms 4460 KB Output is correct
24 Correct 994 ms 4632 KB Output is correct
25 Correct 1000 ms 4808 KB Output is correct
26 Correct 76 ms 3224 KB Output is correct
27 Correct 637 ms 4364 KB Output is correct
28 Correct 621 ms 4412 KB Output is correct
29 Correct 663 ms 4804 KB Output is correct
30 Correct 649 ms 4384 KB Output is correct
31 Correct 625 ms 3956 KB Output is correct
32 Correct 449 ms 3020 KB Output is correct
33 Correct 700 ms 4524 KB Output is correct
34 Correct 614 ms 4088 KB Output is correct
35 Correct 63 ms 2760 KB Output is correct
36 Correct 713 ms 4216 KB Output is correct
37 Correct 603 ms 4020 KB Output is correct
38 Correct 549 ms 3796 KB Output is correct
39 Correct 422 ms 4196 KB Output is correct
40 Correct 394 ms 4056 KB Output is correct
41 Correct 447 ms 3688 KB Output is correct
42 Correct 391 ms 3468 KB Output is correct
43 Correct 934 ms 6416 KB Output is correct
44 Correct 68 ms 2644 KB Output is correct
45 Correct 109 ms 6028 KB Output is correct
46 Correct 71 ms 5952 KB Output is correct
47 Correct 660 ms 6480 KB Output is correct
48 Correct 931 ms 6424 KB Output is correct
49 Correct 642 ms 6424 KB Output is correct
50 Correct 457 ms 4372 KB Output is correct
51 Correct 461 ms 4476 KB Output is correct
52 Correct 472 ms 4716 KB Output is correct
53 Correct 726 ms 5736 KB Output is correct
54 Correct 710 ms 5716 KB Output is correct
55 Correct 723 ms 5964 KB Output is correct
56 Correct 587 ms 6572 KB Output is correct
57 Correct 632 ms 6556 KB Output is correct
58 Correct 955 ms 6428 KB Output is correct
59 Correct 958 ms 6412 KB Output is correct
60 Correct 951 ms 6344 KB Output is correct
61 Correct 948 ms 6548 KB Output is correct
62 Correct 811 ms 6248 KB Output is correct
63 Correct 810 ms 6408 KB Output is correct
64 Correct 918 ms 6428 KB Output is correct
65 Correct 638 ms 6168 KB Output is correct
66 Correct 779 ms 4292 KB Output is correct
67 Correct 911 ms 4640 KB Output is correct
68 Correct 903 ms 4444 KB Output is correct
69 Correct 658 ms 4276 KB Output is correct
70 Correct 911 ms 4400 KB Output is correct
71 Correct 899 ms 4428 KB Output is correct
72 Correct 986 ms 4480 KB Output is correct
73 Correct 818 ms 4400 KB Output is correct
74 Correct 840 ms 4464 KB Output is correct
75 Correct 883 ms 4384 KB Output is correct
76 Correct 685 ms 4380 KB Output is correct
77 Correct 686 ms 4508 KB Output is correct
78 Correct 699 ms 4308 KB Output is correct
79 Correct 536 ms 4340 KB Output is correct
80 Correct 528 ms 4464 KB Output is correct
81 Correct 532 ms 4336 KB Output is correct
82 Correct 520 ms 4172 KB Output is correct
83 Correct 517 ms 4372 KB Output is correct
84 Correct 514 ms 4196 KB Output is correct
85 Correct 1253 ms 6428 KB Output is correct
86 Correct 131 ms 5964 KB Output is correct
87 Correct 91 ms 5988 KB Output is correct
88 Correct 889 ms 6216 KB Output is correct
89 Correct 1249 ms 6252 KB Output is correct
90 Correct 890 ms 6612 KB Output is correct
91 Correct 913 ms 4488 KB Output is correct
92 Correct 850 ms 4424 KB Output is correct
93 Correct 1151 ms 4416 KB Output is correct
94 Correct 1147 ms 5564 KB Output is correct
95 Correct 1143 ms 5684 KB Output is correct
96 Correct 1112 ms 5824 KB Output is correct
97 Correct 731 ms 6520 KB Output is correct
98 Correct 718 ms 6276 KB Output is correct
99 Correct 1292 ms 6116 KB Output is correct
100 Correct 1284 ms 6184 KB Output is correct
101 Correct 1304 ms 6204 KB Output is correct
102 Correct 1289 ms 6432 KB Output is correct
103 Correct 1210 ms 6164 KB Output is correct
104 Correct 1210 ms 6272 KB Output is correct
105 Correct 971 ms 5948 KB Output is correct
106 Correct 791 ms 5724 KB Output is correct
107 Correct 962 ms 6404 KB Output is correct
108 Correct 1224 ms 6472 KB Output is correct
109 Correct 927 ms 5880 KB Output is correct