oj.uz

Submission #170109

# Submission time Handle Problem Language Result Execution time Memory
170109 2019-12-24T03:00:37 Z arnold518 Bridges (APIO19_bridges) C++14
100 / 100
 2766 ms 12360 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

struct Edge
{
    int u, v, w, idx;
    bool operator < (const Edge &p) const { return w>p.w; }
};

struct Query
{
    int t, u, w, idx;
    bool operator < (const Query &p) const { return w>p.w; }
};

int N, M, Q, SQ=1000;
int t[MAXN+10];
Edge edge[MAXN+10];
Query query[MAXN+10];

vector<int> S;
int Par[MAXN+10], Rank[MAXN+10];
vector<pii> ans;

void init()
{
    S.clear();
    for(int i=1; i<=N; i++) Par[i]=i, Rank[i]=1;
}

int cnt=0;

int Find(int x) { return x==Par[x] ? x : Find(Par[x]); }

void Union(int x, int y)
{
    x=Find(x); y=Find(y);
    if(x==y) return;
    if(Rank[x]<Rank[y]) swap(x, y);
    Rank[x]+=Rank[y];
    Par[y]=x;
    S.push_back(y);
    cnt++;
    //printf("UNION %d %d\n", x, y);
}

void Restore()
{
    if(S.empty()) return;
    //printf("RESTORE %d %d\n", S.back(), Par[S.back()]);
    Rank[Par[S.back()]]-=Rank[S.back()];
    Par[S.back()]=S.back();
    S.pop_back();
}

int main()
{
    int i, j, k, p;

    scanf("%d%d", &N, &M);
    for(i=1; i<=M; i++)
    {
        scanf("%d%d%d", &edge[i].u, &edge[i].v, &edge[i].w); edge[i].idx=i;
        if(edge[i].u>edge[i].v) swap(edge[i].u, edge[i].v);
    }
    scanf("%d", &Q);
    for(i=1; i<=Q; i++) scanf("%d%d%d", &query[i].t, &query[i].u, &query[i].w), query[i].idx=i;

    vector<Edge> E;
    for(i=1; i<=M; i++) E.push_back(edge[i]);
    sort(E.begin(), E.end());

    for(i=0; i<=Q/SQ; i++)
    {
        int s=max(1, i*SQ), e=min(Q, i*SQ+SQ-1);
        init();

        //printf("============\n");
        //for(auto it : E) printf("%d %d %d\n", it.u, it.v, it.w);
        //printf("============\n");

        vector<Edge> E1, E2;

        vector<Query> up, qu;
        vector<int> up2;
        for(j=s; j<=e; j++)
        {
            if(query[j].t==1) up.push_back(query[j]), up2.push_back(query[j].u);
            else qu.push_back(query[j]);
        }

        sort(up2.begin(), up2.end());
        up2.erase(unique(up2.begin(), up2.end()), up2.end());
        sort(qu.begin(), qu.end());

        for(j=0; j<E.size(); j++) if(!binary_search(up2.begin(), up2.end(), E[j].idx)) E1.push_back(E[j]);

        for(j=0, k=0; j<qu.size(); j++)
        {
            //printf("!!!!!!!!!!QUERY SOLVING %d %d!!!!!!!\n", qu[j].u, qu[j].w);
            for(; k<E.size() && E[k].w>=qu[j].w; k++)
            {
                if(binary_search(up2.begin(), up2.end(), E[k].idx)) continue;
                //printf("!%d %d\n", E[k].u, E[k].v);
                Union(E[k].u, E[k].v);
            }

            cnt=0;

            for(p=0; p<up2.size(); p++) t[up2[p]]=edge[up2[p]].w;
            for(p=0; p<up.size() && up[p].idx<qu[j].idx; p++) t[up[p].u]=up[p].w;
            for(p=0; p<up2.size(); p++) if(t[up2[p]]>=qu[j].w) Union(edge[up2[p]].u, edge[up2[p]].v);
            ans.push_back({qu[j].idx, Rank[Find(qu[j].u)]});
            while(cnt--) Restore();
        }

        //printf("!%d %d %d\n", E.size(), E1.size(), E2.size());

        for(p=0; p<up.size(); p++) edge[up[p].u].w=up[p].w;
        for(p=0; p<up2.size(); p++) E2.push_back(edge[up2[p]]);

        if(E1.size()+E2.size()!=M) while(1);

        sort(E2.begin(), E2.end());
        E.clear(); E.resize(M);
        merge(E1.begin(), E1.end(), E2.begin(), E2.end(), E.begin());
    }

    sort(ans.begin(), ans.end());
    for(auto it : ans) printf("%d\n", it.second);
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:102:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(j=0; j<E.size(); j++) if(!binary_search(up2.begin(), up2.end(), E[j].idx)) E1.push_back(E[j]);
                  ~^~~~~~~~~
bridges.cpp:104:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(j=0, k=0; j<qu.size(); j++)
                       ~^~~~~~~~~~
bridges.cpp:107:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(; k<E.size() && E[k].w>=qu[j].w; k++)
                   ~^~~~~~~~~
bridges.cpp:116:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(p=0; p<up2.size(); p++) t[up2[p]]=edge[up2[p]].w;
                      ~^~~~~~~~~~~
bridges.cpp:117:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(p=0; p<up.size() && up[p].idx<qu[j].idx; p++) t[up[p].u]=up[p].w;
                      ~^~~~~~~~~~
bridges.cpp:118:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(p=0; p<up2.size(); p++) if(t[up2[p]]>=qu[j].w) Union(edge[up2[p]].u, edge[up2[p]].v);
                      ~^~~~~~~~~~~
bridges.cpp:125:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(p=0; p<up.size(); p++) edge[up[p].u].w=up[p].w;
                  ~^~~~~~~~~~
bridges.cpp:126:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(p=0; p<up2.size(); p++) E2.push_back(edge[up2[p]]);
                  ~^~~~~~~~~~~
bridges.cpp:128:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(E1.size()+E2.size()!=M) while(1);
            ~~~~~~~~~~~~~~~~~~~^~~
bridges.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &M);
     ~~~~~^~~~~~~~~~~~~~~~
bridges.cpp:69:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &edge[i].u, &edge[i].v, &edge[i].w); edge[i].idx=i;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &Q);
     ~~~~~^~~~~~~~~~
bridges.cpp:73:79: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=Q; i++) scanf("%d%d%d", &query[i].t, &query[i].u, &query[i].w), query[i].idx=i;
                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

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 38 ms 632 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 18 ms 632 KB Output is correct
6 Correct 16 ms 632 KB Output is correct
7 Correct 20 ms 632 KB Output is correct
8 Correct 21 ms 632 KB Output is correct
9 Correct 23 ms 632 KB Output is correct
10 Correct 22 ms 632 KB Output is correct
11 Correct 22 ms 632 KB Output is correct
12 Correct 22 ms 632 KB Output is correct
13 Correct 26 ms 632 KB Output is correct
14 Correct 25 ms 632 KB Output is correct
15 Correct 22 ms 760 KB Output is correct
16 Correct 21 ms 636 KB Output is correct
17 Correct 20 ms 632 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1834 ms 7080 KB Output is correct
2 Correct 1727 ms 7204 KB Output is correct
3 Correct 1752 ms 7092 KB Output is correct
4 Correct 1710 ms 7296 KB Output is correct
5 Correct 1720 ms 7100 KB Output is correct
6 Correct 2479 ms 7148 KB Output is correct
7 Correct 2427 ms 7328 KB Output is correct
8 Correct 2471 ms 7300 KB Output is correct
9 Correct 58 ms 3040 KB Output is correct
10 Correct 1799 ms 7160 KB Output is correct
11 Correct 1681 ms 6936 KB Output is correct
12 Correct 1158 ms 8324 KB Output is correct
13 Correct 1563 ms 6644 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1425 ms 5736 KB Output is correct
2 Correct 1018 ms 3288 KB Output is correct
3 Correct 1626 ms 5796 KB Output is correct
4 Correct 1388 ms 5756 KB Output is correct
5 Correct 56 ms 3172 KB Output is correct
6 Correct 1539 ms 5616 KB Output is correct
7 Correct 1292 ms 5844 KB Output is correct
8 Correct 1136 ms 5520 KB Output is correct
9 Correct 714 ms 6200 KB Output is correct
10 Correct 640 ms 6048 KB Output is correct
11 Correct 1022 ms 4860 KB Output is correct
12 Correct 939 ms 4968 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 681 ms 11052 KB Output is correct
2 Correct 56 ms 3044 KB Output is correct
3 Correct 119 ms 7504 KB Output is correct
4 Correct 105 ms 7504 KB Output is correct
5 Correct 646 ms 11088 KB Output is correct
6 Correct 658 ms 10960 KB Output is correct
7 Correct 628 ms 11088 KB Output is correct
8 Correct 348 ms 7784 KB Output is correct
9 Correct 345 ms 7656 KB Output is correct
10 Correct 352 ms 7876 KB Output is correct
11 Correct 525 ms 9688 KB Output is correct
12 Correct 527 ms 9736 KB Output is correct
13 Correct 549 ms 9944 KB Output is correct
14 Correct 643 ms 11088 KB Output is correct
15 Correct 642 ms 11352 KB Output is correct
16 Correct 688 ms 11104 KB Output is correct
17 Correct 685 ms 11020 KB Output is correct
18 Correct 695 ms 11124 KB Output is correct
19 Correct 696 ms 11228 KB Output is correct
20 Correct 597 ms 10524 KB Output is correct
21 Correct 600 ms 10424 KB Output is correct
22 Correct 656 ms 10916 KB Output is correct
23 Correct 544 ms 10128 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1834 ms 7080 KB Output is correct
2 Correct 1727 ms 7204 KB Output is correct
3 Correct 1752 ms 7092 KB Output is correct
4 Correct 1710 ms 7296 KB Output is correct
5 Correct 1720 ms 7100 KB Output is correct
6 Correct 2479 ms 7148 KB Output is correct
7 Correct 2427 ms 7328 KB Output is correct
8 Correct 2471 ms 7300 KB Output is correct
9 Correct 58 ms 3040 KB Output is correct
10 Correct 1799 ms 7160 KB Output is correct
11 Correct 1681 ms 6936 KB Output is correct
12 Correct 1158 ms 8324 KB Output is correct
13 Correct 1563 ms 6644 KB Output is correct
14 Correct 1425 ms 5736 KB Output is correct
15 Correct 1018 ms 3288 KB Output is correct
16 Correct 1626 ms 5796 KB Output is correct
17 Correct 1388 ms 5756 KB Output is correct
18 Correct 56 ms 3172 KB Output is correct
19 Correct 1539 ms 5616 KB Output is correct
20 Correct 1292 ms 5844 KB Output is correct
21 Correct 1136 ms 5520 KB Output is correct
22 Correct 714 ms 6200 KB Output is correct
23 Correct 640 ms 6048 KB Output is correct
24 Correct 1022 ms 4860 KB Output is correct
25 Correct 939 ms 4968 KB Output is correct
26 Correct 1850 ms 7024 KB Output is correct
27 Correct 2303 ms 7260 KB Output is correct
28 Correct 1951 ms 6940 KB Output is correct
29 Correct 1455 ms 7020 KB Output is correct
30 Correct 2203 ms 7024 KB Output is correct
31 Correct 2272 ms 6984 KB Output is correct
32 Correct 2279 ms 6936 KB Output is correct
33 Correct 1957 ms 6860 KB Output is correct
34 Correct 1976 ms 6816 KB Output is correct
35 Correct 1966 ms 7100 KB Output is correct
36 Correct 1540 ms 7352 KB Output is correct
37 Correct 1558 ms 7084 KB Output is correct
38 Correct 1492 ms 7148 KB Output is correct
39 Correct 921 ms 7908 KB Output is correct
40 Correct 919 ms 7912 KB Output is correct
41 Correct 938 ms 8040 KB Output is correct
42 Correct 1267 ms 6772 KB Output is correct
43 Correct 1266 ms 6640 KB Output is correct
44 Correct 1284 ms 6560 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 38 ms 632 KB Output is correct
4 Correct 7 ms 760 KB Output is correct
5 Correct 18 ms 632 KB Output is correct
6 Correct 16 ms 632 KB Output is correct
7 Correct 20 ms 632 KB Output is correct
8 Correct 21 ms 632 KB Output is correct
9 Correct 23 ms 632 KB Output is correct
10 Correct 22 ms 632 KB Output is correct
11 Correct 22 ms 632 KB Output is correct
12 Correct 22 ms 632 KB Output is correct
13 Correct 26 ms 632 KB Output is correct
14 Correct 25 ms 632 KB Output is correct
15 Correct 22 ms 760 KB Output is correct
16 Correct 21 ms 636 KB Output is correct
17 Correct 20 ms 632 KB Output is correct
18 Correct 1834 ms 7080 KB Output is correct
19 Correct 1727 ms 7204 KB Output is correct
20 Correct 1752 ms 7092 KB Output is correct
21 Correct 1710 ms 7296 KB Output is correct
22 Correct 1720 ms 7100 KB Output is correct
23 Correct 2479 ms 7148 KB Output is correct
24 Correct 2427 ms 7328 KB Output is correct
25 Correct 2471 ms 7300 KB Output is correct
26 Correct 58 ms 3040 KB Output is correct
27 Correct 1799 ms 7160 KB Output is correct
28 Correct 1681 ms 6936 KB Output is correct
29 Correct 1158 ms 8324 KB Output is correct
30 Correct 1563 ms 6644 KB Output is correct
31 Correct 1425 ms 5736 KB Output is correct
32 Correct 1018 ms 3288 KB Output is correct
33 Correct 1626 ms 5796 KB Output is correct
34 Correct 1388 ms 5756 KB Output is correct
35 Correct 56 ms 3172 KB Output is correct
36 Correct 1539 ms 5616 KB Output is correct
37 Correct 1292 ms 5844 KB Output is correct
38 Correct 1136 ms 5520 KB Output is correct
39 Correct 714 ms 6200 KB Output is correct
40 Correct 640 ms 6048 KB Output is correct
41 Correct 1022 ms 4860 KB Output is correct
42 Correct 939 ms 4968 KB Output is correct
43 Correct 681 ms 11052 KB Output is correct
44 Correct 56 ms 3044 KB Output is correct
45 Correct 119 ms 7504 KB Output is correct
46 Correct 105 ms 7504 KB Output is correct
47 Correct 646 ms 11088 KB Output is correct
48 Correct 658 ms 10960 KB Output is correct
49 Correct 628 ms 11088 KB Output is correct
50 Correct 348 ms 7784 KB Output is correct
51 Correct 345 ms 7656 KB Output is correct
52 Correct 352 ms 7876 KB Output is correct
53 Correct 525 ms 9688 KB Output is correct
54 Correct 527 ms 9736 KB Output is correct
55 Correct 549 ms 9944 KB Output is correct
56 Correct 643 ms 11088 KB Output is correct
57 Correct 642 ms 11352 KB Output is correct
58 Correct 688 ms 11104 KB Output is correct
59 Correct 685 ms 11020 KB Output is correct
60 Correct 695 ms 11124 KB Output is correct
61 Correct 696 ms 11228 KB Output is correct
62 Correct 597 ms 10524 KB Output is correct
63 Correct 600 ms 10424 KB Output is correct
64 Correct 656 ms 10916 KB Output is correct
65 Correct 544 ms 10128 KB Output is correct
66 Correct 1850 ms 7024 KB Output is correct
67 Correct 2303 ms 7260 KB Output is correct
68 Correct 1951 ms 6940 KB Output is correct
69 Correct 1455 ms 7020 KB Output is correct
70 Correct 2203 ms 7024 KB Output is correct
71 Correct 2272 ms 6984 KB Output is correct
72 Correct 2279 ms 6936 KB Output is correct
73 Correct 1957 ms 6860 KB Output is correct
74 Correct 1976 ms 6816 KB Output is correct
75 Correct 1966 ms 7100 KB Output is correct
76 Correct 1540 ms 7352 KB Output is correct
77 Correct 1558 ms 7084 KB Output is correct
78 Correct 1492 ms 7148 KB Output is correct
79 Correct 921 ms 7908 KB Output is correct
80 Correct 919 ms 7912 KB Output is correct
81 Correct 938 ms 8040 KB Output is correct
82 Correct 1267 ms 6772 KB Output is correct
83 Correct 1266 ms 6640 KB Output is correct
84 Correct 1284 ms 6560 KB Output is correct
85 Correct 2707 ms 10716 KB Output is correct
86 Correct 305 ms 7780 KB Output is correct
87 Correct 190 ms 7924 KB Output is correct
88 Correct 2000 ms 10840 KB Output is correct
89 Correct 2698 ms 10704 KB Output is correct
90 Correct 1858 ms 10852 KB Output is correct
91 Correct 1993 ms 7404 KB Output is correct
92 Correct 2012 ms 7284 KB Output is correct
93 Correct 2671 ms 7148 KB Output is correct
94 Correct 2269 ms 9960 KB Output is correct
95 Correct 2382 ms 10236 KB Output is correct
96 Correct 2045 ms 10324 KB Output is correct
97 Correct 1196 ms 12360 KB Output is correct
98 Correct 1747 ms 10708 KB Output is correct
99 Correct 2709 ms 11364 KB Output is correct
100 Correct 2686 ms 11572 KB Output is correct
101 Correct 2766 ms 11492 KB Output is correct
102 Correct 2748 ms 11228 KB Output is correct
103 Correct 2186 ms 10552 KB Output is correct
104 Correct 2119 ms 10480 KB Output is correct
105 Correct 1886 ms 9820 KB Output is correct
106 Correct 1598 ms 9132 KB Output is correct
107 Correct 1337 ms 11632 KB Output is correct
108 Correct 2104 ms 11032 KB Output is correct
109 Correct 1814 ms 10372 KB Output is correct