oj.uz

Submission #246623

# Submission time Handle Problem Language Result Execution time Memory
246623 2020-07-09T17:49:30 Z Kastanda Bridges (APIO19_bridges) C++11
100 / 100
 2469 ms 8632 KB 
// M
#include<bits/stdc++.h>
using namespace std;
const int N = 100005, SQ = 700;
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 6 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 66 ms 3448 KB Output is correct
4 Correct 23 ms 1408 KB Output is correct
5 Correct 40 ms 3456 KB Output is correct
6 Correct 36 ms 3448 KB Output is correct
7 Correct 30 ms 3328 KB Output is correct
8 Correct 33 ms 3448 KB Output is correct
9 Correct 36 ms 3328 KB Output is correct
10 Correct 33 ms 3456 KB Output is correct
11 Correct 33 ms 3456 KB Output is correct
12 Correct 36 ms 3424 KB Output is correct
13 Correct 41 ms 3456 KB Output is correct
14 Correct 39 ms 3448 KB Output is correct
15 Correct 54 ms 3456 KB Output is correct
16 Correct 35 ms 3328 KB Output is correct
17 Correct 34 ms 3328 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1092 ms 6780 KB Output is correct
2 Correct 1067 ms 6756 KB Output is correct
3 Correct 1070 ms 6876 KB Output is correct
4 Correct 1099 ms 6900 KB Output is correct
5 Correct 1080 ms 6736 KB Output is correct
6 Correct 1507 ms 6740 KB Output is correct
7 Correct 1560 ms 6892 KB Output is correct
8 Correct 1537 ms 6736 KB Output is correct
9 Correct 268 ms 3320 KB Output is correct
10 Correct 1221 ms 6820 KB Output is correct
11 Correct 1137 ms 6844 KB Output is correct
12 Correct 1461 ms 6936 KB Output is correct
13 Correct 676 ms 6832 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 939 ms 6168 KB Output is correct
2 Correct 911 ms 5496 KB Output is correct
3 Correct 1128 ms 6552 KB Output is correct
4 Correct 935 ms 6536 KB Output is correct
5 Correct 268 ms 3324 KB Output is correct
6 Correct 1132 ms 6448 KB Output is correct
7 Correct 882 ms 6144 KB Output is correct
8 Correct 797 ms 6160 KB Output is correct
9 Correct 1140 ms 6432 KB Output is correct
10 Correct 968 ms 6368 KB Output is correct
11 Correct 467 ms 6136 KB Output is correct
12 Correct 436 ms 6048 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2305 ms 5648 KB Output is correct
2 Correct 279 ms 3320 KB Output is correct
3 Correct 163 ms 4220 KB Output is correct
4 Correct 133 ms 4224 KB Output is correct
5 Correct 1998 ms 5744 KB Output is correct
6 Correct 2355 ms 5580 KB Output is correct
7 Correct 1955 ms 5744 KB Output is correct
8 Correct 1147 ms 4584 KB Output is correct
9 Correct 1150 ms 4528 KB Output is correct
10 Correct 1349 ms 4604 KB Output is correct
11 Correct 1564 ms 5356 KB Output is correct
12 Correct 1549 ms 5172 KB Output is correct
13 Correct 1662 ms 5224 KB Output is correct
14 Correct 1987 ms 5644 KB Output is correct
15 Correct 1955 ms 5784 KB Output is correct
16 Correct 2390 ms 5564 KB Output is correct
17 Correct 2177 ms 5884 KB Output is correct
18 Correct 2143 ms 5820 KB Output is correct
19 Correct 2247 ms 5564 KB Output is correct
20 Correct 1794 ms 5276 KB Output is correct
21 Correct 1780 ms 5280 KB Output is correct
22 Correct 2231 ms 5580 KB Output is correct
23 Correct 1826 ms 5184 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1092 ms 6780 KB Output is correct
2 Correct 1067 ms 6756 KB Output is correct
3 Correct 1070 ms 6876 KB Output is correct
4 Correct 1099 ms 6900 KB Output is correct
5 Correct 1080 ms 6736 KB Output is correct
6 Correct 1507 ms 6740 KB Output is correct
7 Correct 1560 ms 6892 KB Output is correct
8 Correct 1537 ms 6736 KB Output is correct
9 Correct 268 ms 3320 KB Output is correct
10 Correct 1221 ms 6820 KB Output is correct
11 Correct 1137 ms 6844 KB Output is correct
12 Correct 1461 ms 6936 KB Output is correct
13 Correct 676 ms 6832 KB Output is correct
14 Correct 939 ms 6168 KB Output is correct
15 Correct 911 ms 5496 KB Output is correct
16 Correct 1128 ms 6552 KB Output is correct
17 Correct 935 ms 6536 KB Output is correct
18 Correct 268 ms 3324 KB Output is correct
19 Correct 1132 ms 6448 KB Output is correct
20 Correct 882 ms 6144 KB Output is correct
21 Correct 797 ms 6160 KB Output is correct
22 Correct 1140 ms 6432 KB Output is correct
23 Correct 968 ms 6368 KB Output is correct
24 Correct 467 ms 6136 KB Output is correct
25 Correct 436 ms 6048 KB Output is correct
26 Correct 1097 ms 6772 KB Output is correct
27 Correct 1732 ms 6884 KB Output is correct
28 Correct 1514 ms 7268 KB Output is correct
29 Correct 1053 ms 6980 KB Output is correct
30 Correct 1428 ms 6944 KB Output is correct
31 Correct 1509 ms 6944 KB Output is correct
32 Correct 1532 ms 7004 KB Output is correct
33 Correct 1254 ms 6768 KB Output is correct
34 Correct 1297 ms 7032 KB Output is correct
35 Correct 1288 ms 6784 KB Output is correct
36 Correct 982 ms 6896 KB Output is correct
37 Correct 1002 ms 6920 KB Output is correct
38 Correct 964 ms 6756 KB Output is correct
39 Correct 1008 ms 6848 KB Output is correct
40 Correct 993 ms 7132 KB Output is correct
41 Correct 986 ms 6836 KB Output is correct
42 Correct 569 ms 6820 KB Output is correct
43 Correct 574 ms 6728 KB Output is correct
44 Correct 608 ms 6736 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 5 ms 1152 KB Output is correct
3 Correct 66 ms 3448 KB Output is correct
4 Correct 23 ms 1408 KB Output is correct
5 Correct 40 ms 3456 KB Output is correct
6 Correct 36 ms 3448 KB Output is correct
7 Correct 30 ms 3328 KB Output is correct
8 Correct 33 ms 3448 KB Output is correct
9 Correct 36 ms 3328 KB Output is correct
10 Correct 33 ms 3456 KB Output is correct
11 Correct 33 ms 3456 KB Output is correct
12 Correct 36 ms 3424 KB Output is correct
13 Correct 41 ms 3456 KB Output is correct
14 Correct 39 ms 3448 KB Output is correct
15 Correct 54 ms 3456 KB Output is correct
16 Correct 35 ms 3328 KB Output is correct
17 Correct 34 ms 3328 KB Output is correct
18 Correct 1092 ms 6780 KB Output is correct
19 Correct 1067 ms 6756 KB Output is correct
20 Correct 1070 ms 6876 KB Output is correct
21 Correct 1099 ms 6900 KB Output is correct
22 Correct 1080 ms 6736 KB Output is correct
23 Correct 1507 ms 6740 KB Output is correct
24 Correct 1560 ms 6892 KB Output is correct
25 Correct 1537 ms 6736 KB Output is correct
26 Correct 268 ms 3320 KB Output is correct
27 Correct 1221 ms 6820 KB Output is correct
28 Correct 1137 ms 6844 KB Output is correct
29 Correct 1461 ms 6936 KB Output is correct
30 Correct 676 ms 6832 KB Output is correct
31 Correct 939 ms 6168 KB Output is correct
32 Correct 911 ms 5496 KB Output is correct
33 Correct 1128 ms 6552 KB Output is correct
34 Correct 935 ms 6536 KB Output is correct
35 Correct 268 ms 3324 KB Output is correct
36 Correct 1132 ms 6448 KB Output is correct
37 Correct 882 ms 6144 KB Output is correct
38 Correct 797 ms 6160 KB Output is correct
39 Correct 1140 ms 6432 KB Output is correct
40 Correct 968 ms 6368 KB Output is correct
41 Correct 467 ms 6136 KB Output is correct
42 Correct 436 ms 6048 KB Output is correct
43 Correct 2305 ms 5648 KB Output is correct
44 Correct 279 ms 3320 KB Output is correct
45 Correct 163 ms 4220 KB Output is correct
46 Correct 133 ms 4224 KB Output is correct
47 Correct 1998 ms 5744 KB Output is correct
48 Correct 2355 ms 5580 KB Output is correct
49 Correct 1955 ms 5744 KB Output is correct
50 Correct 1147 ms 4584 KB Output is correct
51 Correct 1150 ms 4528 KB Output is correct
52 Correct 1349 ms 4604 KB Output is correct
53 Correct 1564 ms 5356 KB Output is correct
54 Correct 1549 ms 5172 KB Output is correct
55 Correct 1662 ms 5224 KB Output is correct
56 Correct 1987 ms 5644 KB Output is correct
57 Correct 1955 ms 5784 KB Output is correct
58 Correct 2390 ms 5564 KB Output is correct
59 Correct 2177 ms 5884 KB Output is correct
60 Correct 2143 ms 5820 KB Output is correct
61 Correct 2247 ms 5564 KB Output is correct
62 Correct 1794 ms 5276 KB Output is correct
63 Correct 1780 ms 5280 KB Output is correct
64 Correct 2231 ms 5580 KB Output is correct
65 Correct 1826 ms 5184 KB Output is correct
66 Correct 1097 ms 6772 KB Output is correct
67 Correct 1732 ms 6884 KB Output is correct
68 Correct 1514 ms 7268 KB Output is correct
69 Correct 1053 ms 6980 KB Output is correct
70 Correct 1428 ms 6944 KB Output is correct
71 Correct 1509 ms 6944 KB Output is correct
72 Correct 1532 ms 7004 KB Output is correct
73 Correct 1254 ms 6768 KB Output is correct
74 Correct 1297 ms 7032 KB Output is correct
75 Correct 1288 ms 6784 KB Output is correct
76 Correct 982 ms 6896 KB Output is correct
77 Correct 1002 ms 6920 KB Output is correct
78 Correct 964 ms 6756 KB Output is correct
79 Correct 1008 ms 6848 KB Output is correct
80 Correct 993 ms 7132 KB Output is correct
81 Correct 986 ms 6836 KB Output is correct
82 Correct 569 ms 6820 KB Output is correct
83 Correct 574 ms 6728 KB Output is correct
84 Correct 608 ms 6736 KB Output is correct
85 Correct 2469 ms 8564 KB Output is correct
86 Correct 177 ms 6924 KB Output is correct
87 Correct 144 ms 6860 KB Output is correct
88 Correct 2213 ms 8476 KB Output is correct
89 Correct 2446 ms 8632 KB Output is correct
90 Correct 2230 ms 7848 KB Output is correct
91 Correct 1206 ms 6444 KB Output is correct
92 Correct 1236 ms 6516 KB Output is correct
93 Correct 1666 ms 6508 KB Output is correct
94 Correct 1631 ms 7476 KB Output is correct
95 Correct 1599 ms 7532 KB Output is correct
96 Correct 1825 ms 7168 KB Output is correct
97 Correct 2141 ms 7768 KB Output is correct
98 Correct 1463 ms 7632 KB Output is correct
99 Correct 2322 ms 8324 KB Output is correct
100 Correct 2281 ms 8212 KB Output is correct
101 Correct 2210 ms 8232 KB Output is correct
102 Correct 2252 ms 8072 KB Output is correct
103 Correct 1916 ms 7352 KB Output is correct
104 Correct 1894 ms 7572 KB Output is correct
105 Correct 1251 ms 7396 KB Output is correct
106 Correct 930 ms 7172 KB Output is correct
107 Correct 1932 ms 7588 KB Output is correct
108 Correct 2367 ms 7684 KB Output is correct
109 Correct 2040 ms 7272 KB Output is correct