oj.uz

Submission #222851

# Submission time Handle Problem Language Result Execution time Memory
222851 2020-04-14T08:33:15 Z MKopchev Bridges (APIO19_bridges) C++14
100 / 100
 2922 ms 9592 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=1e5+42;

int n,m;

struct edge
{
    int u,v,d;
};

edge inp[nmax];

int q;

struct quer
{
    int type,u,w;
};
quer queries[nmax];

int output[nmax];

int parent[nmax],SZ[nmax];

int root(int node)
{
    while(node!=parent[node])node=parent[node];
    return node;
}

pair<int/*big*/,int/*small*/> done[nmax];
int pointer=0;

void my_merge(int u,int v)
{
    u=root(u);
    v=root(v);

    if(u==v)return;

    if(SZ[u]<SZ[v])swap(u,v);

    parent[v]=u;
    SZ[u]+=SZ[v];

    pointer++;

    done[pointer]={u,v};
}

void my_pop()
{
    parent[done[pointer].second]=done[pointer].second;
    SZ[done[pointer].first]=SZ[done[pointer].first]-SZ[done[pointer].second];
    pointer--;
}

edge not_changed[nmax];
int pointer_not_changed=0;

int changed[nmax],pointer_changed=0;
int additional[nmax];

quer active_queries[nmax];
int pointer_queries=0;

bool keep[nmax];

bool cmp(edge a,edge b)
{
    return a.d<b.d;
}

bool cmp_2(quer a,quer b)
{
    return a.w>b.w;
}
int main()
{
    scanf("%i%i",&n,&m);

    for(int i=1;i<=m;i++)scanf("%i%i%i",&inp[i].u,&inp[i].v,&inp[i].d);

    scanf("%i",&q);

    for(int i=1;i<=q;i++)
        scanf("%i%i%i",&queries[i].type,&queries[i].u,&queries[i].w);

    for(int i=1;i<=q;i++)
        output[i]=-1;

    int block_size=2*sqrt(q);

    int le=1;

    while(le<=q)
    {
        int ri=min(q,le+block_size-1);

        pointer=0;

        for(int i=1;i<=n;i++)parent[i]=i,SZ[i]=1;

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

        pointer_queries=0;

        for(int i=le;i<=ri;i++)
            if(queries[i].type==1)keep[queries[i].u]=0;
            else
            {
                pointer_queries++;

                active_queries[pointer_queries]=queries[i];
                active_queries[pointer_queries].type=i;//the query's id
            }

        pointer_not_changed=0;

        pointer_changed=0;

        for(int i=1;i<=m;i++)
            if(keep[i])
            {
                pointer_not_changed++;
                not_changed[pointer_not_changed]=inp[i];
            }
            else
            {
                pointer_changed++;
                changed[pointer_changed]=i;

                additional[i]=inp[i].d;
            }

        sort(not_changed+1,not_changed+pointer_not_changed+1,cmp);

        sort(active_queries+1,active_queries+pointer_queries+1,cmp_2);

        for(int i=1;i<=pointer_queries;i++)
        {
            //activate forced
            while(pointer_not_changed>=1&&not_changed[pointer_not_changed].d>=active_queries[i].w)
            {
                my_merge(not_changed[pointer_not_changed].u,not_changed[pointer_not_changed].v);
                pointer_not_changed--;
            }

            int mem_pointer=pointer;
            //go for the not forced
            for(int j=le;j<=active_queries[i].type;j++)
                if(queries[j].type==1)
                    additional[queries[j].u]=queries[j].w;

            for(int p=1;p<=pointer_changed;p++)
            {
                if(additional[changed[p]]>=active_queries[i].w)
                {
                    my_merge(inp[changed[p]].u,inp[changed[p]].v);
                }
            }

            output[active_queries[i].type]=SZ[root(active_queries[i].u)];

            //remove the changes
            for(int p=1;p<=pointer_changed;p++)
                additional[changed[p]]=inp[changed[p]].d;

            while(mem_pointer<pointer)my_pop();
        }


        for(int i=le;i<=ri;i++)
            if(queries[i].type==1)
            {
                inp[queries[i].u].d=queries[i].w;
            }

        le=ri+1;
    }


    for(int i=1;i<=q;i++)
        if(output[i]!=-1)printf("%i\n",output[i]);
    return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:81:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i%i",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
bridges.cpp:83:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=m;i++)scanf("%i%i%i",&inp[i].u,&inp[i].v,&inp[i].d);
                          ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:85:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&q);
     ~~~~~^~~~~~~~~
bridges.cpp:88:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i%i",&queries[i].type,&queries[i].u,&queries[i].w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 21 ms 640 KB Output is correct
4 Correct 10 ms 512 KB Output is correct
5 Correct 14 ms 512 KB Output is correct
6 Correct 13 ms 512 KB Output is correct
7 Correct 14 ms 512 KB Output is correct
8 Correct 15 ms 512 KB Output is correct
9 Correct 15 ms 512 KB Output is correct
10 Correct 16 ms 512 KB Output is correct
11 Correct 16 ms 512 KB Output is correct
12 Correct 16 ms 512 KB Output is correct
13 Correct 18 ms 640 KB Output is correct
14 Correct 20 ms 512 KB Output is correct
15 Correct 18 ms 640 KB Output is correct
16 Correct 15 ms 512 KB Output is correct
17 Correct 17 ms 512 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1574 ms 4216 KB Output is correct
2 Correct 1620 ms 4216 KB Output is correct
3 Correct 1632 ms 4216 KB Output is correct
4 Correct 1587 ms 4216 KB Output is correct
5 Correct 1579 ms 4216 KB Output is correct
6 Correct 1988 ms 4452 KB Output is correct
7 Correct 1982 ms 4432 KB Output is correct
8 Correct 2037 ms 4472 KB Output is correct
9 Correct 77 ms 2168 KB Output is correct
10 Correct 1140 ms 4344 KB Output is correct
11 Correct 1112 ms 4472 KB Output is correct
12 Correct 1531 ms 4728 KB Output is correct
13 Correct 1481 ms 4216 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1165 ms 3536 KB Output is correct
2 Correct 668 ms 2552 KB Output is correct
3 Correct 1292 ms 3576 KB Output is correct
4 Correct 1157 ms 3536 KB Output is correct
5 Correct 90 ms 2172 KB Output is correct
6 Correct 1244 ms 3576 KB Output is correct
7 Correct 1118 ms 3576 KB Output is correct
8 Correct 1056 ms 3580 KB Output is correct
9 Correct 953 ms 3668 KB Output is correct
10 Correct 928 ms 3704 KB Output is correct
11 Correct 930 ms 3408 KB Output is correct
12 Correct 871 ms 3404 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2498 ms 5572 KB Output is correct
2 Correct 78 ms 2168 KB Output is correct
3 Correct 724 ms 2936 KB Output is correct
4 Correct 347 ms 3064 KB Output is correct
5 Correct 1488 ms 5752 KB Output is correct
6 Correct 2464 ms 5596 KB Output is correct
7 Correct 1507 ms 5752 KB Output is correct
8 Correct 1248 ms 4112 KB Output is correct
9 Correct 1266 ms 4112 KB Output is correct
10 Correct 1254 ms 4376 KB Output is correct
11 Correct 1981 ms 4860 KB Output is correct
12 Correct 1934 ms 4856 KB Output is correct
13 Correct 1896 ms 4984 KB Output is correct
14 Correct 1395 ms 5700 KB Output is correct
15 Correct 1452 ms 5752 KB Output is correct
16 Correct 2519 ms 5556 KB Output is correct
17 Correct 2599 ms 5628 KB Output is correct
18 Correct 2554 ms 5568 KB Output is correct
19 Correct 2503 ms 5572 KB Output is correct
20 Correct 2120 ms 5368 KB Output is correct
21 Correct 2126 ms 5308 KB Output is correct
22 Correct 2435 ms 5624 KB Output is correct
23 Correct 1474 ms 5244 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1574 ms 4216 KB Output is correct
2 Correct 1620 ms 4216 KB Output is correct
3 Correct 1632 ms 4216 KB Output is correct
4 Correct 1587 ms 4216 KB Output is correct
5 Correct 1579 ms 4216 KB Output is correct
6 Correct 1988 ms 4452 KB Output is correct
7 Correct 1982 ms 4432 KB Output is correct
8 Correct 2037 ms 4472 KB Output is correct
9 Correct 77 ms 2168 KB Output is correct
10 Correct 1140 ms 4344 KB Output is correct
11 Correct 1112 ms 4472 KB Output is correct
12 Correct 1531 ms 4728 KB Output is correct
13 Correct 1481 ms 4216 KB Output is correct
14 Correct 1165 ms 3536 KB Output is correct
15 Correct 668 ms 2552 KB Output is correct
16 Correct 1292 ms 3576 KB Output is correct
17 Correct 1157 ms 3536 KB Output is correct
18 Correct 90 ms 2172 KB Output is correct
19 Correct 1244 ms 3576 KB Output is correct
20 Correct 1118 ms 3576 KB Output is correct
21 Correct 1056 ms 3580 KB Output is correct
22 Correct 953 ms 3668 KB Output is correct
23 Correct 928 ms 3704 KB Output is correct
24 Correct 930 ms 3408 KB Output is correct
25 Correct 871 ms 3404 KB Output is correct
26 Correct 1616 ms 4344 KB Output is correct
27 Correct 1809 ms 4312 KB Output is correct
28 Correct 1662 ms 4216 KB Output is correct
29 Correct 1428 ms 4472 KB Output is correct
30 Correct 1790 ms 4304 KB Output is correct
31 Correct 1803 ms 4308 KB Output is correct
32 Correct 1806 ms 4348 KB Output is correct
33 Correct 1650 ms 4216 KB Output is correct
34 Correct 1694 ms 4192 KB Output is correct
35 Correct 1677 ms 4344 KB Output is correct
36 Correct 1497 ms 4216 KB Output is correct
37 Correct 1494 ms 4216 KB Output is correct
38 Correct 1452 ms 4176 KB Output is correct
39 Correct 1322 ms 4304 KB Output is correct
40 Correct 1332 ms 4320 KB Output is correct
41 Correct 1325 ms 4344 KB Output is correct
42 Correct 1272 ms 4216 KB Output is correct
43 Correct 1275 ms 4216 KB Output is correct
44 Correct 1247 ms 4168 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 21 ms 640 KB Output is correct
4 Correct 10 ms 512 KB Output is correct
5 Correct 14 ms 512 KB Output is correct
6 Correct 13 ms 512 KB Output is correct
7 Correct 14 ms 512 KB Output is correct
8 Correct 15 ms 512 KB Output is correct
9 Correct 15 ms 512 KB Output is correct
10 Correct 16 ms 512 KB Output is correct
11 Correct 16 ms 512 KB Output is correct
12 Correct 16 ms 512 KB Output is correct
13 Correct 18 ms 640 KB Output is correct
14 Correct 20 ms 512 KB Output is correct
15 Correct 18 ms 640 KB Output is correct
16 Correct 15 ms 512 KB Output is correct
17 Correct 17 ms 512 KB Output is correct
18 Correct 1574 ms 4216 KB Output is correct
19 Correct 1620 ms 4216 KB Output is correct
20 Correct 1632 ms 4216 KB Output is correct
21 Correct 1587 ms 4216 KB Output is correct
22 Correct 1579 ms 4216 KB Output is correct
23 Correct 1988 ms 4452 KB Output is correct
24 Correct 1982 ms 4432 KB Output is correct
25 Correct 2037 ms 4472 KB Output is correct
26 Correct 77 ms 2168 KB Output is correct
27 Correct 1140 ms 4344 KB Output is correct
28 Correct 1112 ms 4472 KB Output is correct
29 Correct 1531 ms 4728 KB Output is correct
30 Correct 1481 ms 4216 KB Output is correct
31 Correct 1165 ms 3536 KB Output is correct
32 Correct 668 ms 2552 KB Output is correct
33 Correct 1292 ms 3576 KB Output is correct
34 Correct 1157 ms 3536 KB Output is correct
35 Correct 90 ms 2172 KB Output is correct
36 Correct 1244 ms 3576 KB Output is correct
37 Correct 1118 ms 3576 KB Output is correct
38 Correct 1056 ms 3580 KB Output is correct
39 Correct 953 ms 3668 KB Output is correct
40 Correct 928 ms 3704 KB Output is correct
41 Correct 930 ms 3408 KB Output is correct
42 Correct 871 ms 3404 KB Output is correct
43 Correct 2498 ms 5572 KB Output is correct
44 Correct 78 ms 2168 KB Output is correct
45 Correct 724 ms 2936 KB Output is correct
46 Correct 347 ms 3064 KB Output is correct
47 Correct 1488 ms 5752 KB Output is correct
48 Correct 2464 ms 5596 KB Output is correct
49 Correct 1507 ms 5752 KB Output is correct
50 Correct 1248 ms 4112 KB Output is correct
51 Correct 1266 ms 4112 KB Output is correct
52 Correct 1254 ms 4376 KB Output is correct
53 Correct 1981 ms 4860 KB Output is correct
54 Correct 1934 ms 4856 KB Output is correct
55 Correct 1896 ms 4984 KB Output is correct
56 Correct 1395 ms 5700 KB Output is correct
57 Correct 1452 ms 5752 KB Output is correct
58 Correct 2519 ms 5556 KB Output is correct
59 Correct 2599 ms 5628 KB Output is correct
60 Correct 2554 ms 5568 KB Output is correct
61 Correct 2503 ms 5572 KB Output is correct
62 Correct 2120 ms 5368 KB Output is correct
63 Correct 2126 ms 5308 KB Output is correct
64 Correct 2435 ms 5624 KB Output is correct
65 Correct 1474 ms 5244 KB Output is correct
66 Correct 1616 ms 4344 KB Output is correct
67 Correct 1809 ms 4312 KB Output is correct
68 Correct 1662 ms 4216 KB Output is correct
69 Correct 1428 ms 4472 KB Output is correct
70 Correct 1790 ms 4304 KB Output is correct
71 Correct 1803 ms 4308 KB Output is correct
72 Correct 1806 ms 4348 KB Output is correct
73 Correct 1650 ms 4216 KB Output is correct
74 Correct 1694 ms 4192 KB Output is correct
75 Correct 1677 ms 4344 KB Output is correct
76 Correct 1497 ms 4216 KB Output is correct
77 Correct 1494 ms 4216 KB Output is correct
78 Correct 1452 ms 4176 KB Output is correct
79 Correct 1322 ms 4304 KB Output is correct
80 Correct 1332 ms 4320 KB Output is correct
81 Correct 1325 ms 4344 KB Output is correct
82 Correct 1272 ms 4216 KB Output is correct
83 Correct 1275 ms 4216 KB Output is correct
84 Correct 1247 ms 4168 KB Output is correct
85 Correct 2859 ms 5732 KB Output is correct
86 Correct 745 ms 5368 KB Output is correct
87 Correct 358 ms 5496 KB Output is correct
88 Correct 1789 ms 8188 KB Output is correct
89 Correct 2815 ms 9592 KB Output is correct
90 Correct 1771 ms 7944 KB Output is correct
91 Correct 1695 ms 6988 KB Output is correct
92 Correct 1682 ms 7160 KB Output is correct
93 Correct 2020 ms 6920 KB Output is correct
94 Correct 2316 ms 8312 KB Output is correct
95 Correct 2275 ms 8440 KB Output is correct
96 Correct 2410 ms 8312 KB Output is correct
97 Correct 1584 ms 8184 KB Output is correct
98 Correct 1619 ms 7672 KB Output is correct
99 Correct 2877 ms 9592 KB Output is correct
100 Correct 2850 ms 9448 KB Output is correct
101 Correct 2922 ms 9548 KB Output is correct
102 Correct 2900 ms 9544 KB Output is correct
103 Correct 2674 ms 8568 KB Output is correct
104 Correct 2726 ms 8568 KB Output is correct
105 Correct 2332 ms 8312 KB Output is correct
106 Correct 1975 ms 8052 KB Output is correct
107 Correct 2288 ms 8624 KB Output is correct
108 Correct 2818 ms 9208 KB Output is correct
109 Correct 1830 ms 7288 KB Output is correct