oj.uz

Submission #196905

# Submission time Handle Problem Language Result Execution time Memory
196905 2020-01-17T15:14:38 Z Andrei_Cotor Bridges (APIO19_bridges) C++14
100 / 100
 2820 ms 9644 KB 
#include<iostream>
#include<algorithm>
#define BUCK 700

using namespace std;

typedef struct edge
{
    int x,y,c;
} EDGE;

typedef struct qry
{
    int t,x,y,ind;
} QRY;

bool cmp(EDGE a, EDGE b)
{
    return a.c>b.c;
}

bool cmp2(QRY a, QRY b)
{
    return a.y>b.y;
}

EDGE Edges[100005],EdgeLeft[100005];
QRY Q[100005],Updates[BUCK+5],Queries[BUCK+5];
int Sz[50005],P[50005],top,Rez[100005];
bool Updated[100005],Viz[100005];
pair<int,int> S[BUCK+5];

int parent(int x)
{
    while(P[x]!=0)
        x=P[x];
    return x;
}

void unite(int x, int y, bool reversable)
{
    x=parent(x);
    y=parent(y);

    if(x==y)
        return;

    if(Sz[x]>Sz[y])
    {
        if(reversable)
            S[++top]={y,x};

        Sz[x]+=Sz[y];
        P[y]=x;
    }
    else
    {
        if(reversable)
            S[++top]={x,y};

        Sz[y]+=Sz[x];
        P[x]=y;
    }
}

void revDSU()
{
    while(top)
    {
        P[S[top].first]=0;
        Sz[S[top].second]-=Sz[S[top].first];
        top--;
    }
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

    int n,m;
    cin>>n>>m;
    for(int i=1; i<=m; i++)
        cin>>Edges[i].x>>Edges[i].y>>Edges[i].c;

    int q;
    cin>>q;
    for(int i=1; i<=q; i++)
    {
        cin>>Q[i].t>>Q[i].x>>Q[i].y;
        Q[i].ind=i;
    }

    for(int st=1, dr=BUCK; st<=q; st+=BUCK, dr+=BUCK)
    {
        dr=min(dr,q);

        for(int i=1; i<=m; i++)
            Viz[i]=0;

        for(int i=1; i<=n; i++)
        {
            Sz[i]=1;
            P[i]=0;
        }

        int nru=0,nrq=0;
        for(int i=st; i<=dr; i++)
        {
            if(Q[i].t==1)
            {
                Updates[++nru]=Q[i];
                Viz[Q[i].x]=1;
            }
            else
                Queries[++nrq]=Q[i];
        }

        int nrel=0;
        for(int i=1; i<=m; i++)
        {
            if(!Viz[i])
                EdgeLeft[++nrel]=Edges[i];
        }

        sort(EdgeLeft+1,EdgeLeft+nrel+1,cmp);
        sort(Queries+1,Queries+nrq+1,cmp2);

        int ie=1;
        for(int iq=1; iq<=nrq; iq++)
        {
            while(ie<=nrel && Queries[iq].y<=EdgeLeft[ie].c)
            {
                unite(EdgeLeft[ie].x,EdgeLeft[ie].y,0);
                ie++;
            }

            for(int i=1; i<=nru; i++)
                Updated[Updates[i].x]=0;

            int start=1;
            while(start<=nru && Updates[start].ind<Queries[iq].ind)
                start++;

            for(int iu=start-1; iu>=1; iu--)
            {
                if(Updated[Updates[iu].x])
                    continue;

                Updated[Updates[iu].x]=1;
                if(Updates[iu].y>=Queries[iq].y)
                    unite(Edges[Updates[iu].x].x,Edges[Updates[iu].x].y,1);
            }

            for(int iu=start; iu<=nru; iu++)
            {
                if(Updated[Updates[iu].x])
                    continue;

                if(Edges[Updates[iu].x].c>=Queries[iq].y)
                    unite(Edges[Updates[iu].x].x,Edges[Updates[iu].x].y,1);
            }

            Rez[Queries[iq].ind]=Sz[parent(Queries[iq].x)];

            revDSU();
        }

        for(int i=1; i<=nru; i++)
            Edges[Updates[i].x].c=Updates[i].y;
    }

    for(int i=1; i<=q; i++)
    {
        if(Q[i].t==2)
            cout<<Rez[i]<<"\n";
    }

    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 27 ms 760 KB Output is correct
4 Correct 6 ms 760 KB Output is correct
5 Correct 26 ms 760 KB Output is correct
6 Correct 23 ms 888 KB Output is correct
7 Correct 20 ms 628 KB Output is correct
8 Correct 26 ms 760 KB Output is correct
9 Correct 24 ms 632 KB Output is correct
10 Correct 27 ms 760 KB Output is correct
11 Correct 27 ms 760 KB Output is correct
12 Correct 28 ms 760 KB Output is correct
13 Correct 31 ms 764 KB Output is correct
14 Correct 30 ms 888 KB Output is correct
15 Correct 28 ms 764 KB Output is correct
16 Correct 24 ms 760 KB Output is correct
17 Correct 25 ms 760 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1550 ms 5088 KB Output is correct
2 Correct 1626 ms 4940 KB Output is correct
3 Correct 1602 ms 5136 KB Output is correct
4 Correct 1625 ms 5152 KB Output is correct
5 Correct 1611 ms 5148 KB Output is correct
6 Correct 2115 ms 5160 KB Output is correct
7 Correct 2171 ms 5028 KB Output is correct
8 Correct 2133 ms 5320 KB Output is correct
9 Correct 45 ms 3504 KB Output is correct
10 Correct 1094 ms 5084 KB Output is correct
11 Correct 1063 ms 5208 KB Output is correct
12 Correct 1400 ms 5640 KB Output is correct
13 Correct 1647 ms 5084 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1131 ms 4424 KB Output is correct
2 Correct 611 ms 3848 KB Output is correct
3 Correct 1263 ms 4760 KB Output is correct
4 Correct 1056 ms 4560 KB Output is correct
5 Correct 46 ms 3448 KB Output is correct
6 Correct 1169 ms 4612 KB Output is correct
7 Correct 1055 ms 4584 KB Output is correct
8 Correct 980 ms 4552 KB Output is correct
9 Correct 820 ms 4924 KB Output is correct
10 Correct 793 ms 4840 KB Output is correct
11 Correct 918 ms 4788 KB Output is correct
12 Correct 841 ms 4656 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2355 ms 7680 KB Output is correct
2 Correct 50 ms 3960 KB Output is correct
3 Correct 261 ms 5096 KB Output is correct
4 Correct 138 ms 5112 KB Output is correct
5 Correct 1382 ms 8100 KB Output is correct
6 Correct 2341 ms 9544 KB Output is correct
7 Correct 1402 ms 8208 KB Output is correct
8 Correct 1094 ms 6936 KB Output is correct
9 Correct 1086 ms 7052 KB Output is correct
10 Correct 1109 ms 7040 KB Output is correct
11 Correct 1754 ms 8024 KB Output is correct
12 Correct 1742 ms 8196 KB Output is correct
13 Correct 1747 ms 8132 KB Output is correct
14 Correct 1281 ms 8348 KB Output is correct
15 Correct 1341 ms 8044 KB Output is correct
16 Correct 2359 ms 9344 KB Output is correct
17 Correct 2455 ms 9344 KB Output is correct
18 Correct 2384 ms 9556 KB Output is correct
19 Correct 2344 ms 9464 KB Output is correct
20 Correct 1967 ms 8592 KB Output is correct
21 Correct 1977 ms 8528 KB Output is correct
22 Correct 2256 ms 9336 KB Output is correct
23 Correct 1343 ms 7336 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1550 ms 5088 KB Output is correct
2 Correct 1626 ms 4940 KB Output is correct
3 Correct 1602 ms 5136 KB Output is correct
4 Correct 1625 ms 5152 KB Output is correct
5 Correct 1611 ms 5148 KB Output is correct
6 Correct 2115 ms 5160 KB Output is correct
7 Correct 2171 ms 5028 KB Output is correct
8 Correct 2133 ms 5320 KB Output is correct
9 Correct 45 ms 3504 KB Output is correct
10 Correct 1094 ms 5084 KB Output is correct
11 Correct 1063 ms 5208 KB Output is correct
12 Correct 1400 ms 5640 KB Output is correct
13 Correct 1647 ms 5084 KB Output is correct
14 Correct 1131 ms 4424 KB Output is correct
15 Correct 611 ms 3848 KB Output is correct
16 Correct 1263 ms 4760 KB Output is correct
17 Correct 1056 ms 4560 KB Output is correct
18 Correct 46 ms 3448 KB Output is correct
19 Correct 1169 ms 4612 KB Output is correct
20 Correct 1055 ms 4584 KB Output is correct
21 Correct 980 ms 4552 KB Output is correct
22 Correct 820 ms 4924 KB Output is correct
23 Correct 793 ms 4840 KB Output is correct
24 Correct 918 ms 4788 KB Output is correct
25 Correct 841 ms 4656 KB Output is correct
26 Correct 1621 ms 6252 KB Output is correct
27 Correct 1840 ms 6728 KB Output is correct
28 Correct 1630 ms 6664 KB Output is correct
29 Correct 1349 ms 6736 KB Output is correct
30 Correct 1753 ms 6560 KB Output is correct
31 Correct 1783 ms 6316 KB Output is correct
32 Correct 1814 ms 6452 KB Output is correct
33 Correct 1575 ms 6540 KB Output is correct
34 Correct 1581 ms 6520 KB Output is correct
35 Correct 1609 ms 6600 KB Output is correct
36 Correct 1369 ms 6420 KB Output is correct
37 Correct 1369 ms 6764 KB Output is correct
38 Correct 1361 ms 6432 KB Output is correct
39 Correct 1238 ms 6516 KB Output is correct
40 Correct 1191 ms 6492 KB Output is correct
41 Correct 1236 ms 6516 KB Output is correct
42 Correct 1220 ms 6268 KB Output is correct
43 Correct 1265 ms 6392 KB Output is correct
44 Correct 1216 ms 6304 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 27 ms 760 KB Output is correct
4 Correct 6 ms 760 KB Output is correct
5 Correct 26 ms 760 KB Output is correct
6 Correct 23 ms 888 KB Output is correct
7 Correct 20 ms 628 KB Output is correct
8 Correct 26 ms 760 KB Output is correct
9 Correct 24 ms 632 KB Output is correct
10 Correct 27 ms 760 KB Output is correct
11 Correct 27 ms 760 KB Output is correct
12 Correct 28 ms 760 KB Output is correct
13 Correct 31 ms 764 KB Output is correct
14 Correct 30 ms 888 KB Output is correct
15 Correct 28 ms 764 KB Output is correct
16 Correct 24 ms 760 KB Output is correct
17 Correct 25 ms 760 KB Output is correct
18 Correct 1550 ms 5088 KB Output is correct
19 Correct 1626 ms 4940 KB Output is correct
20 Correct 1602 ms 5136 KB Output is correct
21 Correct 1625 ms 5152 KB Output is correct
22 Correct 1611 ms 5148 KB Output is correct
23 Correct 2115 ms 5160 KB Output is correct
24 Correct 2171 ms 5028 KB Output is correct
25 Correct 2133 ms 5320 KB Output is correct
26 Correct 45 ms 3504 KB Output is correct
27 Correct 1094 ms 5084 KB Output is correct
28 Correct 1063 ms 5208 KB Output is correct
29 Correct 1400 ms 5640 KB Output is correct
30 Correct 1647 ms 5084 KB Output is correct
31 Correct 1131 ms 4424 KB Output is correct
32 Correct 611 ms 3848 KB Output is correct
33 Correct 1263 ms 4760 KB Output is correct
34 Correct 1056 ms 4560 KB Output is correct
35 Correct 46 ms 3448 KB Output is correct
36 Correct 1169 ms 4612 KB Output is correct
37 Correct 1055 ms 4584 KB Output is correct
38 Correct 980 ms 4552 KB Output is correct
39 Correct 820 ms 4924 KB Output is correct
40 Correct 793 ms 4840 KB Output is correct
41 Correct 918 ms 4788 KB Output is correct
42 Correct 841 ms 4656 KB Output is correct
43 Correct 2355 ms 7680 KB Output is correct
44 Correct 50 ms 3960 KB Output is correct
45 Correct 261 ms 5096 KB Output is correct
46 Correct 138 ms 5112 KB Output is correct
47 Correct 1382 ms 8100 KB Output is correct
48 Correct 2341 ms 9544 KB Output is correct
49 Correct 1402 ms 8208 KB Output is correct
50 Correct 1094 ms 6936 KB Output is correct
51 Correct 1086 ms 7052 KB Output is correct
52 Correct 1109 ms 7040 KB Output is correct
53 Correct 1754 ms 8024 KB Output is correct
54 Correct 1742 ms 8196 KB Output is correct
55 Correct 1747 ms 8132 KB Output is correct
56 Correct 1281 ms 8348 KB Output is correct
57 Correct 1341 ms 8044 KB Output is correct
58 Correct 2359 ms 9344 KB Output is correct
59 Correct 2455 ms 9344 KB Output is correct
60 Correct 2384 ms 9556 KB Output is correct
61 Correct 2344 ms 9464 KB Output is correct
62 Correct 1967 ms 8592 KB Output is correct
63 Correct 1977 ms 8528 KB Output is correct
64 Correct 2256 ms 9336 KB Output is correct
65 Correct 1343 ms 7336 KB Output is correct
66 Correct 1621 ms 6252 KB Output is correct
67 Correct 1840 ms 6728 KB Output is correct
68 Correct 1630 ms 6664 KB Output is correct
69 Correct 1349 ms 6736 KB Output is correct
70 Correct 1753 ms 6560 KB Output is correct
71 Correct 1783 ms 6316 KB Output is correct
72 Correct 1814 ms 6452 KB Output is correct
73 Correct 1575 ms 6540 KB Output is correct
74 Correct 1581 ms 6520 KB Output is correct
75 Correct 1609 ms 6600 KB Output is correct
76 Correct 1369 ms 6420 KB Output is correct
77 Correct 1369 ms 6764 KB Output is correct
78 Correct 1361 ms 6432 KB Output is correct
79 Correct 1238 ms 6516 KB Output is correct
80 Correct 1191 ms 6492 KB Output is correct
81 Correct 1236 ms 6516 KB Output is correct
82 Correct 1220 ms 6268 KB Output is correct
83 Correct 1265 ms 6392 KB Output is correct
84 Correct 1216 ms 6304 KB Output is correct
85 Correct 2739 ms 9484 KB Output is correct
86 Correct 250 ms 5240 KB Output is correct
87 Correct 163 ms 5240 KB Output is correct
88 Correct 1797 ms 7960 KB Output is correct
89 Correct 2723 ms 9644 KB Output is correct
90 Correct 1727 ms 7920 KB Output is correct
91 Correct 1733 ms 6924 KB Output is correct
92 Correct 1702 ms 7100 KB Output is correct
93 Correct 2294 ms 6912 KB Output is correct
94 Correct 2234 ms 8176 KB Output is correct
95 Correct 2314 ms 8436 KB Output is correct
96 Correct 2258 ms 8176 KB Output is correct
97 Correct 1508 ms 8252 KB Output is correct
98 Correct 1554 ms 7652 KB Output is correct
99 Correct 2780 ms 9440 KB Output is correct
100 Correct 2820 ms 9260 KB Output is correct
101 Correct 2806 ms 9464 KB Output is correct
102 Correct 2753 ms 9416 KB Output is correct
103 Correct 2512 ms 8556 KB Output is correct
104 Correct 2478 ms 8472 KB Output is correct
105 Correct 2230 ms 8384 KB Output is correct
106 Correct 1907 ms 8032 KB Output is correct
107 Correct 2098 ms 8648 KB Output is correct
108 Correct 2582 ms 9012 KB Output is correct
109 Correct 1654 ms 7220 KB Output is correct