Submission #123655

# Submission time Handle Problem Language Result Execution time Memory
123655 2019-07-01T22:20:24 Z duality Bridges (APIO19_bridges) C++11
100 / 100
2306 ms 11816 KB
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int u[100000],v[100000],d[100000];
int t[100000],x[100000],w[100000];
int order[100000],temp1[100000],temp2[100000];
bool comp(int a,int b) {
    return d[a] > d[b];
}
int change[100000],seen[100000];
int ans[100000];
int parent[50000],size[50000];
int find(int n) {
    if (parent[n] != n) parent[n] = find(parent[n]);
    return parent[n];
}
int merge(int a,int b) {
    int pa = find(a),pb = find(b);
    if (pa != pb) {
        if (size[pa] < size[pb]) swap(pa,pb);
        parent[pb] = pa,size[pa] += size[pb];
    }
    return 0;
}
vi adjList[50000];
int visited[50000];
int doDFS(int u) {
    if (visited[u]) return 0;
    int i;
    int ans = size[u];
    visited[u] = 1;
    for (i = 0; i < adjList[u].size(); i++) ans += doDFS(adjList[u][i]);
    return ans;
}
int main() {
    int i;
    int n,m,q;
    scanf("%d %d",&n,&m);
    for (i = 0; i < m; i++) scanf("%d %d %d",&u[i],&v[i],&d[i]),u[i]--,v[i]--;
    scanf("%d",&q);
    for (i = 0; i < q; i++) scanf("%d %d %d",&t[i],&x[i],&w[i]),x[i]--;

    int j,k,l;
    int bs = 1.5*sqrt(q)+EPS;
    for (i = 0; i < m; i++) order[i] = i;
    sort(order,order+m,comp);
    for (i = 0; i < q; i += bs) {
        int e = min(i+bs,q);
        vector<pair<pii,int> > queries;
        for (j = i; j < e; j++) {
            if (t[j] == 1) change[x[j]] = 1;
            else queries.pb(mp(mp(w[j],x[j]),j));
        }
        sort(queries.begin(),queries.end());
        for (j = 0; j < n; j++) parent[j] = j,size[j] = 1;
        k = 0;
        for (j = queries.size()-1; j >= 0; j--) {
            while ((k < m) && (d[order[k]] >= queries[j].first.first)) {
                if (!change[order[k]]) merge(u[order[k]],v[order[k]]);
                k++;
            }
            vi toClear;
            for (l = queries[j].second; l >= i; l--) {
                if ((t[l] == 1) && !seen[x[l]]) {
                    seen[x[l]] = 1;
                    if (w[l] >= queries[j].first.first) {
                        int pu = find(u[x[l]]),pv = find(v[x[l]]);
                        adjList[pu].pb(pv),adjList[pv].pb(pu);
                        toClear.pb(pu),toClear.pb(pv);
                    }
                }
            }
            for (l = queries[j].second+1; l < e; l++) {
                if ((t[l] == 1) && !seen[x[l]] && (d[x[l]] >= queries[j].first.first)) {
                    int pu = find(u[x[l]]),pv = find(v[x[l]]);
                    adjList[pu].pb(pv),adjList[pv].pb(pu);
                    toClear.pb(pu),toClear.pb(pv);
                }
            }
            ans[queries[j].second] = doDFS(find(queries[j].first.second));
            toClear.pb(find(queries[j].first.second));
            for (l = 0; l < toClear.size(); l++) adjList[toClear[l]].clear(),visited[toClear[l]] = 0;
            for (l = queries[j].second; l >= i; l--) {
                if (t[l] == 1) seen[x[l]] = 0;
            }
        }
        for (j = i; j < e; j++) {
            if (t[j] == 1) d[x[j]] = w[j];
        }
        int a = 0,b = 0;
        for (j = 0; j < m; j++) {
            if (!change[order[j]]) temp1[a++] = order[j];
        }
        for (j = i; j < e; j++) {
            if ((t[j] == 1) && change[x[j]]) change[x[j]] = 0,temp2[b++] = x[j];
        }
        sort(temp2,temp2+b,comp);
        merge(temp1,temp1+a,temp2,temp2+b,order,comp);
    }
    for (i = 0; i < q; i++) {
        if (t[i] == 2) printf("%d\n",ans[i]);
    }

    return 0;
}

Compilation message

bridges.cpp: In function 'int doDFS(int)':
bridges.cpp:86:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) ans += doDFS(adjList[u][i]);
                 ~~^~~~~~~~~~~~~~~~~~~
bridges.cpp: In function 'int main()':
bridges.cpp:136:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (l = 0; l < toClear.size(); l++) adjList[toClear[l]].clear(),visited[toClear[l]] = 0;
                         ~~^~~~~~~~~~~~~~~~
bridges.cpp:92: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:93:71: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < m; i++) scanf("%d %d %d",&u[i],&v[i],&d[i]),u[i]--,v[i]--;
                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
bridges.cpp:94:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&q);
     ~~~~~^~~~~~~~~
bridges.cpp:95:64: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < q; i++) scanf("%d %d %d",&t[i],&x[i],&w[i]),x[i]--;
                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1532 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 25 ms 1912 KB Output is correct
4 Correct 11 ms 1784 KB Output is correct
5 Correct 23 ms 1912 KB Output is correct
6 Correct 21 ms 1784 KB Output is correct
7 Correct 23 ms 1784 KB Output is correct
8 Correct 22 ms 1912 KB Output is correct
9 Correct 29 ms 1800 KB Output is correct
10 Correct 21 ms 1784 KB Output is correct
11 Correct 21 ms 1856 KB Output is correct
12 Correct 26 ms 1784 KB Output is correct
13 Correct 24 ms 1784 KB Output is correct
14 Correct 23 ms 1912 KB Output is correct
15 Correct 23 ms 1780 KB Output is correct
16 Correct 24 ms 1788 KB Output is correct
17 Correct 23 ms 1788 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1478 ms 6892 KB Output is correct
2 Correct 1428 ms 6904 KB Output is correct
3 Correct 1442 ms 6936 KB Output is correct
4 Correct 1427 ms 6852 KB Output is correct
5 Correct 1410 ms 7048 KB Output is correct
6 Correct 1837 ms 5992 KB Output is correct
7 Correct 1718 ms 5884 KB Output is correct
8 Correct 1706 ms 6152 KB Output is correct
9 Correct 113 ms 3472 KB Output is correct
10 Correct 1381 ms 6904 KB Output is correct
11 Correct 1419 ms 6908 KB Output is correct
12 Correct 1050 ms 6116 KB Output is correct
13 Correct 1119 ms 5852 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1223 ms 5520 KB Output is correct
2 Correct 833 ms 4128 KB Output is correct
3 Correct 1271 ms 5880 KB Output is correct
4 Correct 1157 ms 5748 KB Output is correct
5 Correct 111 ms 3420 KB Output is correct
6 Correct 1185 ms 5564 KB Output is correct
7 Correct 1051 ms 5532 KB Output is correct
8 Correct 910 ms 5540 KB Output is correct
9 Correct 736 ms 5112 KB Output is correct
10 Correct 712 ms 5116 KB Output is correct
11 Correct 817 ms 5660 KB Output is correct
12 Correct 675 ms 5752 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1355 ms 6180 KB Output is correct
2 Correct 111 ms 3576 KB Output is correct
3 Correct 271 ms 4060 KB Output is correct
4 Correct 111 ms 3960 KB Output is correct
5 Correct 993 ms 6512 KB Output is correct
6 Correct 1366 ms 6380 KB Output is correct
7 Correct 974 ms 6528 KB Output is correct
8 Correct 848 ms 5188 KB Output is correct
9 Correct 860 ms 5240 KB Output is correct
10 Correct 833 ms 5540 KB Output is correct
11 Correct 1273 ms 5880 KB Output is correct
12 Correct 1294 ms 5708 KB Output is correct
13 Correct 1552 ms 5860 KB Output is correct
14 Correct 906 ms 6520 KB Output is correct
15 Correct 921 ms 6616 KB Output is correct
16 Correct 1553 ms 6456 KB Output is correct
17 Correct 1548 ms 6500 KB Output is correct
18 Correct 1545 ms 6572 KB Output is correct
19 Correct 1597 ms 6364 KB Output is correct
20 Correct 1427 ms 6232 KB Output is correct
21 Correct 1441 ms 6264 KB Output is correct
22 Correct 1521 ms 6512 KB Output is correct
23 Correct 1239 ms 6008 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1478 ms 6892 KB Output is correct
2 Correct 1428 ms 6904 KB Output is correct
3 Correct 1442 ms 6936 KB Output is correct
4 Correct 1427 ms 6852 KB Output is correct
5 Correct 1410 ms 7048 KB Output is correct
6 Correct 1837 ms 5992 KB Output is correct
7 Correct 1718 ms 5884 KB Output is correct
8 Correct 1706 ms 6152 KB Output is correct
9 Correct 113 ms 3472 KB Output is correct
10 Correct 1381 ms 6904 KB Output is correct
11 Correct 1419 ms 6908 KB Output is correct
12 Correct 1050 ms 6116 KB Output is correct
13 Correct 1119 ms 5852 KB Output is correct
14 Correct 1223 ms 5520 KB Output is correct
15 Correct 833 ms 4128 KB Output is correct
16 Correct 1271 ms 5880 KB Output is correct
17 Correct 1157 ms 5748 KB Output is correct
18 Correct 111 ms 3420 KB Output is correct
19 Correct 1185 ms 5564 KB Output is correct
20 Correct 1051 ms 5532 KB Output is correct
21 Correct 910 ms 5540 KB Output is correct
22 Correct 736 ms 5112 KB Output is correct
23 Correct 712 ms 5116 KB Output is correct
24 Correct 817 ms 5660 KB Output is correct
25 Correct 675 ms 5752 KB Output is correct
26 Correct 1543 ms 6788 KB Output is correct
27 Correct 1769 ms 6960 KB Output is correct
28 Correct 1599 ms 6904 KB Output is correct
29 Correct 1215 ms 6812 KB Output is correct
30 Correct 1816 ms 6960 KB Output is correct
31 Correct 1831 ms 6848 KB Output is correct
32 Correct 1831 ms 6964 KB Output is correct
33 Correct 1663 ms 6820 KB Output is correct
34 Correct 1667 ms 6844 KB Output is correct
35 Correct 1665 ms 6860 KB Output is correct
36 Correct 1273 ms 6924 KB Output is correct
37 Correct 1256 ms 6872 KB Output is correct
38 Correct 1258 ms 6844 KB Output is correct
39 Correct 1034 ms 6320 KB Output is correct
40 Correct 1038 ms 6192 KB Output is correct
41 Correct 1036 ms 6012 KB Output is correct
42 Correct 961 ms 6856 KB Output is correct
43 Correct 944 ms 6924 KB Output is correct
44 Correct 931 ms 7024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1532 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 25 ms 1912 KB Output is correct
4 Correct 11 ms 1784 KB Output is correct
5 Correct 23 ms 1912 KB Output is correct
6 Correct 21 ms 1784 KB Output is correct
7 Correct 23 ms 1784 KB Output is correct
8 Correct 22 ms 1912 KB Output is correct
9 Correct 29 ms 1800 KB Output is correct
10 Correct 21 ms 1784 KB Output is correct
11 Correct 21 ms 1856 KB Output is correct
12 Correct 26 ms 1784 KB Output is correct
13 Correct 24 ms 1784 KB Output is correct
14 Correct 23 ms 1912 KB Output is correct
15 Correct 23 ms 1780 KB Output is correct
16 Correct 24 ms 1788 KB Output is correct
17 Correct 23 ms 1788 KB Output is correct
18 Correct 1478 ms 6892 KB Output is correct
19 Correct 1428 ms 6904 KB Output is correct
20 Correct 1442 ms 6936 KB Output is correct
21 Correct 1427 ms 6852 KB Output is correct
22 Correct 1410 ms 7048 KB Output is correct
23 Correct 1837 ms 5992 KB Output is correct
24 Correct 1718 ms 5884 KB Output is correct
25 Correct 1706 ms 6152 KB Output is correct
26 Correct 113 ms 3472 KB Output is correct
27 Correct 1381 ms 6904 KB Output is correct
28 Correct 1419 ms 6908 KB Output is correct
29 Correct 1050 ms 6116 KB Output is correct
30 Correct 1119 ms 5852 KB Output is correct
31 Correct 1223 ms 5520 KB Output is correct
32 Correct 833 ms 4128 KB Output is correct
33 Correct 1271 ms 5880 KB Output is correct
34 Correct 1157 ms 5748 KB Output is correct
35 Correct 111 ms 3420 KB Output is correct
36 Correct 1185 ms 5564 KB Output is correct
37 Correct 1051 ms 5532 KB Output is correct
38 Correct 910 ms 5540 KB Output is correct
39 Correct 736 ms 5112 KB Output is correct
40 Correct 712 ms 5116 KB Output is correct
41 Correct 817 ms 5660 KB Output is correct
42 Correct 675 ms 5752 KB Output is correct
43 Correct 1355 ms 6180 KB Output is correct
44 Correct 111 ms 3576 KB Output is correct
45 Correct 271 ms 4060 KB Output is correct
46 Correct 111 ms 3960 KB Output is correct
47 Correct 993 ms 6512 KB Output is correct
48 Correct 1366 ms 6380 KB Output is correct
49 Correct 974 ms 6528 KB Output is correct
50 Correct 848 ms 5188 KB Output is correct
51 Correct 860 ms 5240 KB Output is correct
52 Correct 833 ms 5540 KB Output is correct
53 Correct 1273 ms 5880 KB Output is correct
54 Correct 1294 ms 5708 KB Output is correct
55 Correct 1552 ms 5860 KB Output is correct
56 Correct 906 ms 6520 KB Output is correct
57 Correct 921 ms 6616 KB Output is correct
58 Correct 1553 ms 6456 KB Output is correct
59 Correct 1548 ms 6500 KB Output is correct
60 Correct 1545 ms 6572 KB Output is correct
61 Correct 1597 ms 6364 KB Output is correct
62 Correct 1427 ms 6232 KB Output is correct
63 Correct 1441 ms 6264 KB Output is correct
64 Correct 1521 ms 6512 KB Output is correct
65 Correct 1239 ms 6008 KB Output is correct
66 Correct 1543 ms 6788 KB Output is correct
67 Correct 1769 ms 6960 KB Output is correct
68 Correct 1599 ms 6904 KB Output is correct
69 Correct 1215 ms 6812 KB Output is correct
70 Correct 1816 ms 6960 KB Output is correct
71 Correct 1831 ms 6848 KB Output is correct
72 Correct 1831 ms 6964 KB Output is correct
73 Correct 1663 ms 6820 KB Output is correct
74 Correct 1667 ms 6844 KB Output is correct
75 Correct 1665 ms 6860 KB Output is correct
76 Correct 1273 ms 6924 KB Output is correct
77 Correct 1256 ms 6872 KB Output is correct
78 Correct 1258 ms 6844 KB Output is correct
79 Correct 1034 ms 6320 KB Output is correct
80 Correct 1038 ms 6192 KB Output is correct
81 Correct 1036 ms 6012 KB Output is correct
82 Correct 961 ms 6856 KB Output is correct
83 Correct 944 ms 6924 KB Output is correct
84 Correct 931 ms 7024 KB Output is correct
85 Correct 2088 ms 8120 KB Output is correct
86 Correct 315 ms 4728 KB Output is correct
87 Correct 145 ms 4728 KB Output is correct
88 Correct 1673 ms 7908 KB Output is correct
89 Correct 2137 ms 8088 KB Output is correct
90 Correct 1633 ms 7280 KB Output is correct
91 Correct 1681 ms 6784 KB Output is correct
92 Correct 1676 ms 6912 KB Output is correct
93 Correct 1895 ms 6308 KB Output is correct
94 Correct 2050 ms 7588 KB Output is correct
95 Correct 2023 ms 7624 KB Output is correct
96 Correct 2049 ms 6488 KB Output is correct
97 Correct 1240 ms 7140 KB Output is correct
98 Correct 1300 ms 7416 KB Output is correct
99 Correct 2209 ms 8044 KB Output is correct
100 Correct 2267 ms 11728 KB Output is correct
101 Correct 2306 ms 11740 KB Output is correct
102 Correct 2295 ms 11816 KB Output is correct
103 Correct 2146 ms 9592 KB Output is correct
104 Correct 2181 ms 9592 KB Output is correct
105 Correct 1694 ms 9632 KB Output is correct
106 Correct 1450 ms 9580 KB Output is correct
107 Correct 1757 ms 9420 KB Output is correct
108 Correct 2232 ms 10024 KB Output is correct
109 Correct 1953 ms 8092 KB Output is correct