oj.uz

Submission #246622

# Submission time Handle Problem Language Result Execution time Memory
246622 2020-07-09T17:47:45 Z Kastanda Bridges (APIO19_bridges) C++11
100 / 100
 2656 ms 10996 KB 
// M
#include<bits/stdc++.h>
using namespace std;
const int N = 100005, SQ = 500;
int n, m, q, A[N], B[N], W[N], Rev[N];
int TP[N], V[N], Z[N], ME[N], Rs[N];
int P[N], P2[N], Fw[SQ + 5][SQ + 5];
int Find(int v)
{
        return (P[v] < 0 ? v : (P[v] = Find(P[v])));
}
int Find2(int v)
{
        return (P2[v] < 0 ? v : (P2[v] = Find2(P2[v])));
}
inline void Merge(int v, int u)
{
        v = Find(v);
        u = Find(u);
        if (v != u)
                P[v] += P[u], P[u] = v;
}
inline void Merge2(int v, int u)
{
        v = Find2(v);
        u = Find2(u);
        if (v != u)
                P2[v] += P2[u], P2[u] = v;
}
int main()
{
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= m; i ++)
        {
                scanf("%d%d%d", &A[i], &B[i], &W[i]);
        }
        scanf("%d", &q);
        for (int i = 1; i <= q; i ++)
                scanf("%d%d%d", &TP[i], &V[i], &Z[i]);
        vector < int > E;
        for (int i = 1; i <= m; i ++)
                E.push_back(i);
        sort(E.begin(), E.end(), [&](int i, int j){return W[i] > W[j];});
        for (int l = 1; l <= q; l += SQ)
        {
                int r = min(l + SQ - 1, q);

                // Eliminating marked edges from E .. :
                for (int i = l; i <= r; i ++)
                        if (TP[i] == 1) ME[V[i]] = i;
                vector < int > tmpE, MarkE;
                for (int id : E)
                        if (!ME[id])
                                tmpE.push_back(id);
                        else
                                MarkE.push_back(id), Rev[id] = (int)MarkE.size() - 1;
                E.swap(tmpE);
                tmpE.clear();
                // Done with this thing

                vector < int > Q;
                for (int i = l; i <= r; i ++)
                        if (TP[i] == 2) Q.push_back(i);
                sort(Q.begin(), Q.end(), [&](int i, int j){return Z[i] > Z[j];});

                // Vertices of interset :
                vector < int > Voi;
                for (int i = l; i <= r; i ++)
                        if (TP[i] == 1)
                                Voi.push_back(A[V[i]]),
                                Voi.push_back(B[V[i]]);
                        else
                                Voi.push_back(V[i]);

                // Calculating last instance of each edge for each query ...
                vector < int > prev((int)MarkE.size());
                for (int i = 0; i < MarkE.size(); i ++)
                        prev[i] = W[MarkE[i]];
                for (int i = l; i <= r; i ++)
                {
                        if (TP[i] == 1)
                                prev[Rev[V[i]]] = Z[i];
                        else
                                for (int j = 0; j < (int)MarkE.size(); j ++)
                                        Fw[i - l][j] = prev[j];
                }
                // Phew, all done ...


                int ptre = 0;
                memset(P2, 0, sizeof(P2));
                memset(P, -1, sizeof(P));
                for (int i : Q)
                {
                        while (ptre < (int)E.size() && W[E[ptre]] >= Z[i])
                                Merge(A[E[ptre]], B[E[ptre]]), ptre ++;
                        for (int v : Voi)
                                Find(v), P2[v] = P[v], P2[Find(v)] = P[Find(v)];

                        for (int j = 0; j < (int)MarkE.size(); j ++)
                                if (Fw[i - l][j] >= Z[i])
                                        Merge2(A[MarkE[j]], B[MarkE[j]]);

                        Rs[i] = - P2[Find2(V[i])];
                }

                for (int i = l; i <= r; i ++)
                        if (TP[i] == 1)
                                ME[V[i]] = 0, W[V[i]] = Z[i];

                sort(MarkE.begin(), MarkE.end(), [&](int i, int j){return W[i] > W[j];});

                int ptme = 0;
                tmpE.clear();
                for (int e : E)
                {
                        while (ptme < (int)MarkE.size() && W[MarkE[ptme]] > W[e])
                                tmpE.push_back(MarkE[ptme]), ptme ++;
                        tmpE.push_back(e);
                }
                while (ptme < (int)MarkE.size())
                        tmpE.push_back(MarkE[ptme]), ptme ++;
                E.swap(tmpE);
                tmpE.clear();
                assert((int)E.size() == m);

        }

        for (int i = 1; i <= q; i ++)
                if (TP[i] == 2)
                        printf("%d\n", Rs[i]);
        return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:77:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int i = 0; i < MarkE.size(); i ++)
                                 ~~^~~~~~~~~~~~~~
bridges.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &n, &m);
         ~~~~~^~~~~~~~~~~~~~~~
bridges.cpp:35:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf("%d%d%d", &A[i], &B[i], &W[i]);
                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &q);
         ~~~~~^~~~~~~~~~
bridges.cpp:39:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf("%d%d%d", &TP[i], &V[i], &Z[i]);
                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 52 ms 2552 KB Output is correct
4 Correct 26 ms 1408 KB Output is correct
5 Correct 36 ms 2468 KB Output is correct
6 Correct 34 ms 2432 KB Output is correct
7 Correct 29 ms 2424 KB Output is correct
8 Correct 29 ms 2432 KB Output is correct
9 Correct 33 ms 2424 KB Output is correct
10 Correct 29 ms 2432 KB Output is correct
11 Correct 28 ms 2560 KB Output is correct
12 Correct 29 ms 2432 KB Output is correct
13 Correct 36 ms 2552 KB Output is correct
14 Correct 34 ms 2432 KB Output is correct
15 Correct 41 ms 2432 KB Output is correct
16 Correct 32 ms 2424 KB Output is correct
17 Correct 30 ms 2432 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1010 ms 5608 KB Output is correct
2 Correct 967 ms 5716 KB Output is correct
3 Correct 1004 ms 5740 KB Output is correct
4 Correct 994 ms 5752 KB Output is correct
5 Correct 995 ms 5808 KB Output is correct
6 Correct 1283 ms 5796 KB Output is correct
7 Correct 1263 ms 5752 KB Output is correct
8 Correct 1273 ms 5656 KB Output is correct
9 Correct 209 ms 3136 KB Output is correct
10 Correct 1058 ms 5720 KB Output is correct
11 Correct 983 ms 5712 KB Output is correct
12 Correct 1253 ms 5716 KB Output is correct
13 Correct 717 ms 5636 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 814 ms 4984 KB Output is correct
2 Correct 666 ms 4576 KB Output is correct
3 Correct 931 ms 5120 KB Output is correct
4 Correct 802 ms 5136 KB Output is correct
5 Correct 214 ms 3064 KB Output is correct
6 Correct 901 ms 5124 KB Output is correct
7 Correct 788 ms 5464 KB Output is correct
8 Correct 742 ms 5188 KB Output is correct
9 Correct 943 ms 5288 KB Output is correct
10 Correct 815 ms 5256 KB Output is correct
11 Correct 466 ms 4984 KB Output is correct
12 Correct 434 ms 4984 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2473 ms 5672 KB Output is correct
2 Correct 214 ms 4216 KB Output is correct
3 Correct 166 ms 5756 KB Output is correct
4 Correct 136 ms 5816 KB Output is correct
5 Correct 2100 ms 7592 KB Output is correct
6 Correct 2483 ms 9172 KB Output is correct
7 Correct 2079 ms 7536 KB Output is correct
8 Correct 1052 ms 6744 KB Output is correct
9 Correct 1060 ms 7000 KB Output is correct
10 Correct 1214 ms 6916 KB Output is correct
11 Correct 1614 ms 7960 KB Output is correct
12 Correct 1589 ms 8252 KB Output is correct
13 Correct 1681 ms 7968 KB Output is correct
14 Correct 2066 ms 7708 KB Output is correct
15 Correct 2153 ms 7708 KB Output is correct
16 Correct 2383 ms 9232 KB Output is correct
17 Correct 2346 ms 9220 KB Output is correct
18 Correct 2233 ms 9436 KB Output is correct
19 Correct 2412 ms 9208 KB Output is correct
20 Correct 1840 ms 8136 KB Output is correct
21 Correct 1823 ms 8408 KB Output is correct
22 Correct 2386 ms 8820 KB Output is correct
23 Correct 1926 ms 6948 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1010 ms 5608 KB Output is correct
2 Correct 967 ms 5716 KB Output is correct
3 Correct 1004 ms 5740 KB Output is correct
4 Correct 994 ms 5752 KB Output is correct
5 Correct 995 ms 5808 KB Output is correct
6 Correct 1283 ms 5796 KB Output is correct
7 Correct 1263 ms 5752 KB Output is correct
8 Correct 1273 ms 5656 KB Output is correct
9 Correct 209 ms 3136 KB Output is correct
10 Correct 1058 ms 5720 KB Output is correct
11 Correct 983 ms 5712 KB Output is correct
12 Correct 1253 ms 5716 KB Output is correct
13 Correct 717 ms 5636 KB Output is correct
14 Correct 814 ms 4984 KB Output is correct
15 Correct 666 ms 4576 KB Output is correct
16 Correct 931 ms 5120 KB Output is correct
17 Correct 802 ms 5136 KB Output is correct
18 Correct 214 ms 3064 KB Output is correct
19 Correct 901 ms 5124 KB Output is correct
20 Correct 788 ms 5464 KB Output is correct
21 Correct 742 ms 5188 KB Output is correct
22 Correct 943 ms 5288 KB Output is correct
23 Correct 815 ms 5256 KB Output is correct
24 Correct 466 ms 4984 KB Output is correct
25 Correct 434 ms 4984 KB Output is correct
26 Correct 987 ms 5780 KB Output is correct
27 Correct 1586 ms 5992 KB Output is correct
28 Correct 1429 ms 5684 KB Output is correct
29 Correct 1103 ms 5956 KB Output is correct
30 Correct 1357 ms 5848 KB Output is correct
31 Correct 1341 ms 5912 KB Output is correct
32 Correct 1366 ms 5888 KB Output is correct
33 Correct 1152 ms 5812 KB Output is correct
34 Correct 1195 ms 5760 KB Output is correct
35 Correct 1216 ms 5996 KB Output is correct
36 Correct 955 ms 5748 KB Output is correct
37 Correct 968 ms 5836 KB Output is correct
38 Correct 972 ms 5612 KB Output is correct
39 Correct 985 ms 5784 KB Output is correct
40 Correct 994 ms 5628 KB Output is correct
41 Correct 992 ms 5732 KB Output is correct
42 Correct 656 ms 5612 KB Output is correct
43 Correct 680 ms 5632 KB Output is correct
44 Correct 667 ms 5856 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 52 ms 2552 KB Output is correct
4 Correct 26 ms 1408 KB Output is correct
5 Correct 36 ms 2468 KB Output is correct
6 Correct 34 ms 2432 KB Output is correct
7 Correct 29 ms 2424 KB Output is correct
8 Correct 29 ms 2432 KB Output is correct
9 Correct 33 ms 2424 KB Output is correct
10 Correct 29 ms 2432 KB Output is correct
11 Correct 28 ms 2560 KB Output is correct
12 Correct 29 ms 2432 KB Output is correct
13 Correct 36 ms 2552 KB Output is correct
14 Correct 34 ms 2432 KB Output is correct
15 Correct 41 ms 2432 KB Output is correct
16 Correct 32 ms 2424 KB Output is correct
17 Correct 30 ms 2432 KB Output is correct
18 Correct 1010 ms 5608 KB Output is correct
19 Correct 967 ms 5716 KB Output is correct
20 Correct 1004 ms 5740 KB Output is correct
21 Correct 994 ms 5752 KB Output is correct
22 Correct 995 ms 5808 KB Output is correct
23 Correct 1283 ms 5796 KB Output is correct
24 Correct 1263 ms 5752 KB Output is correct
25 Correct 1273 ms 5656 KB Output is correct
26 Correct 209 ms 3136 KB Output is correct
27 Correct 1058 ms 5720 KB Output is correct
28 Correct 983 ms 5712 KB Output is correct
29 Correct 1253 ms 5716 KB Output is correct
30 Correct 717 ms 5636 KB Output is correct
31 Correct 814 ms 4984 KB Output is correct
32 Correct 666 ms 4576 KB Output is correct
33 Correct 931 ms 5120 KB Output is correct
34 Correct 802 ms 5136 KB Output is correct
35 Correct 214 ms 3064 KB Output is correct
36 Correct 901 ms 5124 KB Output is correct
37 Correct 788 ms 5464 KB Output is correct
38 Correct 742 ms 5188 KB Output is correct
39 Correct 943 ms 5288 KB Output is correct
40 Correct 815 ms 5256 KB Output is correct
41 Correct 466 ms 4984 KB Output is correct
42 Correct 434 ms 4984 KB Output is correct
43 Correct 2473 ms 5672 KB Output is correct
44 Correct 214 ms 4216 KB Output is correct
45 Correct 166 ms 5756 KB Output is correct
46 Correct 136 ms 5816 KB Output is correct
47 Correct 2100 ms 7592 KB Output is correct
48 Correct 2483 ms 9172 KB Output is correct
49 Correct 2079 ms 7536 KB Output is correct
50 Correct 1052 ms 6744 KB Output is correct
51 Correct 1060 ms 7000 KB Output is correct
52 Correct 1214 ms 6916 KB Output is correct
53 Correct 1614 ms 7960 KB Output is correct
54 Correct 1589 ms 8252 KB Output is correct
55 Correct 1681 ms 7968 KB Output is correct
56 Correct 2066 ms 7708 KB Output is correct
57 Correct 2153 ms 7708 KB Output is correct
58 Correct 2383 ms 9232 KB Output is correct
59 Correct 2346 ms 9220 KB Output is correct
60 Correct 2233 ms 9436 KB Output is correct
61 Correct 2412 ms 9208 KB Output is correct
62 Correct 1840 ms 8136 KB Output is correct
63 Correct 1823 ms 8408 KB Output is correct
64 Correct 2386 ms 8820 KB Output is correct
65 Correct 1926 ms 6948 KB Output is correct
66 Correct 987 ms 5780 KB Output is correct
67 Correct 1586 ms 5992 KB Output is correct
68 Correct 1429 ms 5684 KB Output is correct
69 Correct 1103 ms 5956 KB Output is correct
70 Correct 1357 ms 5848 KB Output is correct
71 Correct 1341 ms 5912 KB Output is correct
72 Correct 1366 ms 5888 KB Output is correct
73 Correct 1152 ms 5812 KB Output is correct
74 Correct 1195 ms 5760 KB Output is correct
75 Correct 1216 ms 5996 KB Output is correct
76 Correct 955 ms 5748 KB Output is correct
77 Correct 968 ms 5836 KB Output is correct
78 Correct 972 ms 5612 KB Output is correct
79 Correct 985 ms 5784 KB Output is correct
80 Correct 994 ms 5628 KB Output is correct
81 Correct 992 ms 5732 KB Output is correct
82 Correct 656 ms 5612 KB Output is correct
83 Correct 680 ms 5632 KB Output is correct
84 Correct 667 ms 5856 KB Output is correct
85 Correct 2656 ms 10996 KB Output is correct
86 Correct 179 ms 7420 KB Output is correct
87 Correct 136 ms 7540 KB Output is correct
88 Correct 2312 ms 9592 KB Output is correct
89 Correct 2623 ms 10976 KB Output is correct
90 Correct 2343 ms 8968 KB Output is correct
91 Correct 1161 ms 8028 KB Output is correct
92 Correct 1144 ms 8336 KB Output is correct
93 Correct 1394 ms 7956 KB Output is correct
94 Correct 1651 ms 9680 KB Output is correct
95 Correct 1637 ms 9792 KB Output is correct
96 Correct 1860 ms 9376 KB Output is correct
97 Correct 2303 ms 9032 KB Output is correct
98 Correct 1809 ms 9204 KB Output is correct
99 Correct 2529 ms 10768 KB Output is correct
100 Correct 2523 ms 10696 KB Output is correct
101 Correct 2383 ms 10780 KB Output is correct
102 Correct 2393 ms 10944 KB Output is correct
103 Correct 2110 ms 9676 KB Output is correct
104 Correct 1980 ms 9520 KB Output is correct
105 Correct 1493 ms 9600 KB Output is correct
106 Correct 1146 ms 9452 KB Output is correct
107 Correct 1982 ms 9880 KB Output is correct
108 Correct 2523 ms 10280 KB Output is correct
109 Correct 2094 ms 8736 KB Output is correct