oj.uz

Submission #129770

# Submission time Handle Problem Language Result Execution time Memory
129770 2019-07-13T07:49:14 Z pr3pony Bridges (APIO19_bridges) C++14
100 / 100
 2933 ms 13824 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 51212, M = 121212, Q = 121212;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define F first
#define S second
pii e[M];
int d[M], la[M], ans[Q], dsu[N], vis[N], qu[N], vct;
vector<int> g[N];
int find(int u) {return dsu[u] < 0 ? u : dsu[u] = find(dsu[u]);}
void meld(int u,int v)
{
    u = find(u), v = find(v);
    if (u == v)
        return;
    if (dsu[v] < dsu[u])
        swap(u,v);
    dsu[u] += dsu[v];
    dsu[v] = u;
}
set<pii,greater<pii>> se;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m,q;
    cin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        cin >> e[i].F >> e[i].S >> d[i];
        se.emplace(d[i],i);
    }
    const int BS = 1 + sqrt(n+m) * 2;
    vector<tuple<int,int,int>> qry; // w, vertex id, time
    vector<tuple<int,int,int,int>> ce; // edge id, time l, time r, w
    vector<int> cv;
    cin >> q;
    for (int i = 1, lt = 0; i <= q; ++i) {
        int a,b,c;
        cin >> a >> b >> c;
        if (a == 1) {
            ce.emplace_back(b,la[b],i-1,d[b]);
            la[b] = i;
            se.erase({d[b],b});
            d[b] = c;
            se.emplace(d[b],b);
        } else {
            qry.emplace_back(c,b,i);
        }
//        if (qry.size() * ce.size() * 4 >=  BS * BS || i == q) {
        if (i - lt == BS || i == q) {
            for (int j = 1; j <= m; ++j)
                if (la[j] > lt) 
                    ce.emplace_back(j,la[j],i,d[j]);
            sort(begin(ce),end(ce),[](const tuple<int,int,int,int>& x,const tuple<int,int,int,int>& y){return get<3>(x)>get<3>(y);});
            auto it = begin(se);
            sort(begin(qry),end(qry),greater<decltype(qry[0])>());
            fill_n(dsu,n+1,-1);
            for (const auto & tu : qry) {
                int w,vi,t;
                tie(w,vi,t) = tu;
                for (;it != end(se) && it->F >= w; ++it) {
                    int ei = it->S;
                    if (la[ei] <= lt) {
                        meld(e[ei].F,e[ei].S);
                    }
                }
                cv.clear();
                for (const auto & eu : ce) {
                    int ei,tl,tr,ew;
                    tie(ei,tl,tr,ew) = eu;
                    if (ew < w)
                        break;
                    int u = find(e[ei].F), v = find(e[ei].S);
                    if (tl <= t && t <= tr && u != v) {
                        g[u].emplace_back(v);
                        g[v].emplace_back(u);
                        cv.emplace_back(u);
                        cv.emplace_back(v);
                    }
                }
                vi = find(vi);
                int ta = dsu[vi], ql=0, qr=0;
                qu[qr++] = (vi);
                vis[vi] = ++vct;
                while (qr - ql) {
                    int u = qu[ql++];
                    for (int v : g[u])
                        if (vis[v] != vct) {
                            vis[v] = vct;
                            qu[qr++] = v;
                            ta += dsu[v];
                        }
                }
                ans[t] = -ta;
                for (int u : cv)
                    g[u].clear();
            }
            qry.clear();
            ce.clear();
            lt = i;
        }
    }
    for (int i = 1; i <= q; ++i)
        if (ans[i])
            cout << ans[i] << '\n';
    }

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 16 ms 1784 KB Output is correct
4 Correct 7 ms 1656 KB Output is correct
5 Correct 12 ms 1656 KB Output is correct
6 Correct 10 ms 1656 KB Output is correct
7 Correct 12 ms 1656 KB Output is correct
8 Correct 12 ms 1656 KB Output is correct
9 Correct 12 ms 1656 KB Output is correct
10 Correct 12 ms 1656 KB Output is correct
11 Correct 12 ms 1656 KB Output is correct
12 Correct 13 ms 1656 KB Output is correct
13 Correct 13 ms 1656 KB Output is correct
14 Correct 12 ms 1656 KB Output is correct
15 Correct 13 ms 1656 KB Output is correct
16 Correct 12 ms 1656 KB Output is correct
17 Correct 12 ms 1656 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1956 ms 7068 KB Output is correct
2 Correct 1808 ms 7032 KB Output is correct
3 Correct 1726 ms 7080 KB Output is correct
4 Correct 1705 ms 7204 KB Output is correct
5 Correct 1699 ms 7168 KB Output is correct
6 Correct 2552 ms 6316 KB Output is correct
7 Correct 2459 ms 6364 KB Output is correct
8 Correct 2411 ms 6312 KB Output is correct
9 Correct 40 ms 2168 KB Output is correct
10 Correct 1552 ms 7004 KB Output is correct
11 Correct 1555 ms 6960 KB Output is correct
12 Correct 1329 ms 6152 KB Output is correct
13 Correct 1518 ms 6184 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1240 ms 5444 KB Output is correct
2 Correct 576 ms 3064 KB Output is correct
3 Correct 1395 ms 5436 KB Output is correct
4 Correct 1256 ms 5496 KB Output is correct
5 Correct 40 ms 2168 KB Output is correct
6 Correct 1422 ms 5612 KB Output is correct
7 Correct 1133 ms 5432 KB Output is correct
8 Correct 987 ms 5420 KB Output is correct
9 Correct 801 ms 5084 KB Output is correct
10 Correct 750 ms 4984 KB Output is correct
11 Correct 1052 ms 5448 KB Output is correct
12 Correct 894 ms 5408 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1896 ms 8776 KB Output is correct
2 Correct 40 ms 2168 KB Output is correct
3 Correct 263 ms 7544 KB Output is correct
4 Correct 99 ms 7672 KB Output is correct
5 Correct 961 ms 8920 KB Output is correct
6 Correct 2096 ms 8972 KB Output is correct
7 Correct 1316 ms 8880 KB Output is correct
8 Correct 1004 ms 5764 KB Output is correct
9 Correct 863 ms 5668 KB Output is correct
10 Correct 843 ms 5724 KB Output is correct
11 Correct 1684 ms 7176 KB Output is correct
12 Correct 1413 ms 7276 KB Output is correct
13 Correct 1547 ms 7388 KB Output is correct
14 Correct 924 ms 8840 KB Output is correct
15 Correct 953 ms 8728 KB Output is correct
16 Correct 1937 ms 8804 KB Output is correct
17 Correct 2052 ms 8696 KB Output is correct
18 Correct 1909 ms 8776 KB Output is correct
19 Correct 2016 ms 8840 KB Output is correct
20 Correct 1676 ms 7848 KB Output is correct
21 Correct 1616 ms 7908 KB Output is correct
22 Correct 1960 ms 8516 KB Output is correct
23 Correct 1429 ms 7796 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1956 ms 7068 KB Output is correct
2 Correct 1808 ms 7032 KB Output is correct
3 Correct 1726 ms 7080 KB Output is correct
4 Correct 1705 ms 7204 KB Output is correct
5 Correct 1699 ms 7168 KB Output is correct
6 Correct 2552 ms 6316 KB Output is correct
7 Correct 2459 ms 6364 KB Output is correct
8 Correct 2411 ms 6312 KB Output is correct
9 Correct 40 ms 2168 KB Output is correct
10 Correct 1552 ms 7004 KB Output is correct
11 Correct 1555 ms 6960 KB Output is correct
12 Correct 1329 ms 6152 KB Output is correct
13 Correct 1518 ms 6184 KB Output is correct
14 Correct 1240 ms 5444 KB Output is correct
15 Correct 576 ms 3064 KB Output is correct
16 Correct 1395 ms 5436 KB Output is correct
17 Correct 1256 ms 5496 KB Output is correct
18 Correct 40 ms 2168 KB Output is correct
19 Correct 1422 ms 5612 KB Output is correct
20 Correct 1133 ms 5432 KB Output is correct
21 Correct 987 ms 5420 KB Output is correct
22 Correct 801 ms 5084 KB Output is correct
23 Correct 750 ms 4984 KB Output is correct
24 Correct 1052 ms 5448 KB Output is correct
25 Correct 894 ms 5408 KB Output is correct
26 Correct 1668 ms 6888 KB Output is correct
27 Correct 2343 ms 7032 KB Output is correct
28 Correct 1883 ms 7032 KB Output is correct
29 Correct 1269 ms 7060 KB Output is correct
30 Correct 2377 ms 7072 KB Output is correct
31 Correct 2340 ms 7072 KB Output is correct
32 Correct 2235 ms 7108 KB Output is correct
33 Correct 1884 ms 7072 KB Output is correct
34 Correct 2001 ms 7084 KB Output is correct
35 Correct 1941 ms 7136 KB Output is correct
36 Correct 1442 ms 7032 KB Output is correct
37 Correct 1438 ms 6916 KB Output is correct
38 Correct 1375 ms 7000 KB Output is correct
39 Correct 1027 ms 6544 KB Output is correct
40 Correct 986 ms 6460 KB Output is correct
41 Correct 1028 ms 6352 KB Output is correct
42 Correct 1171 ms 7092 KB Output is correct
43 Correct 1141 ms 7104 KB Output is correct
44 Correct 1231 ms 7200 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 16 ms 1784 KB Output is correct
4 Correct 7 ms 1656 KB Output is correct
5 Correct 12 ms 1656 KB Output is correct
6 Correct 10 ms 1656 KB Output is correct
7 Correct 12 ms 1656 KB Output is correct
8 Correct 12 ms 1656 KB Output is correct
9 Correct 12 ms 1656 KB Output is correct
10 Correct 12 ms 1656 KB Output is correct
11 Correct 12 ms 1656 KB Output is correct
12 Correct 13 ms 1656 KB Output is correct
13 Correct 13 ms 1656 KB Output is correct
14 Correct 12 ms 1656 KB Output is correct
15 Correct 13 ms 1656 KB Output is correct
16 Correct 12 ms 1656 KB Output is correct
17 Correct 12 ms 1656 KB Output is correct
18 Correct 1956 ms 7068 KB Output is correct
19 Correct 1808 ms 7032 KB Output is correct
20 Correct 1726 ms 7080 KB Output is correct
21 Correct 1705 ms 7204 KB Output is correct
22 Correct 1699 ms 7168 KB Output is correct
23 Correct 2552 ms 6316 KB Output is correct
24 Correct 2459 ms 6364 KB Output is correct
25 Correct 2411 ms 6312 KB Output is correct
26 Correct 40 ms 2168 KB Output is correct
27 Correct 1552 ms 7004 KB Output is correct
28 Correct 1555 ms 6960 KB Output is correct
29 Correct 1329 ms 6152 KB Output is correct
30 Correct 1518 ms 6184 KB Output is correct
31 Correct 1240 ms 5444 KB Output is correct
32 Correct 576 ms 3064 KB Output is correct
33 Correct 1395 ms 5436 KB Output is correct
34 Correct 1256 ms 5496 KB Output is correct
35 Correct 40 ms 2168 KB Output is correct
36 Correct 1422 ms 5612 KB Output is correct
37 Correct 1133 ms 5432 KB Output is correct
38 Correct 987 ms 5420 KB Output is correct
39 Correct 801 ms 5084 KB Output is correct
40 Correct 750 ms 4984 KB Output is correct
41 Correct 1052 ms 5448 KB Output is correct
42 Correct 894 ms 5408 KB Output is correct
43 Correct 1896 ms 8776 KB Output is correct
44 Correct 40 ms 2168 KB Output is correct
45 Correct 263 ms 7544 KB Output is correct
46 Correct 99 ms 7672 KB Output is correct
47 Correct 961 ms 8920 KB Output is correct
48 Correct 2096 ms 8972 KB Output is correct
49 Correct 1316 ms 8880 KB Output is correct
50 Correct 1004 ms 5764 KB Output is correct
51 Correct 863 ms 5668 KB Output is correct
52 Correct 843 ms 5724 KB Output is correct
53 Correct 1684 ms 7176 KB Output is correct
54 Correct 1413 ms 7276 KB Output is correct
55 Correct 1547 ms 7388 KB Output is correct
56 Correct 924 ms 8840 KB Output is correct
57 Correct 953 ms 8728 KB Output is correct
58 Correct 1937 ms 8804 KB Output is correct
59 Correct 2052 ms 8696 KB Output is correct
60 Correct 1909 ms 8776 KB Output is correct
61 Correct 2016 ms 8840 KB Output is correct
62 Correct 1676 ms 7848 KB Output is correct
63 Correct 1616 ms 7908 KB Output is correct
64 Correct 1960 ms 8516 KB Output is correct
65 Correct 1429 ms 7796 KB Output is correct
66 Correct 1668 ms 6888 KB Output is correct
67 Correct 2343 ms 7032 KB Output is correct
68 Correct 1883 ms 7032 KB Output is correct
69 Correct 1269 ms 7060 KB Output is correct
70 Correct 2377 ms 7072 KB Output is correct
71 Correct 2340 ms 7072 KB Output is correct
72 Correct 2235 ms 7108 KB Output is correct
73 Correct 1884 ms 7072 KB Output is correct
74 Correct 2001 ms 7084 KB Output is correct
75 Correct 1941 ms 7136 KB Output is correct
76 Correct 1442 ms 7032 KB Output is correct
77 Correct 1438 ms 6916 KB Output is correct
78 Correct 1375 ms 7000 KB Output is correct
79 Correct 1027 ms 6544 KB Output is correct
80 Correct 986 ms 6460 KB Output is correct
81 Correct 1028 ms 6352 KB Output is correct
82 Correct 1171 ms 7092 KB Output is correct
83 Correct 1141 ms 7104 KB Output is correct
84 Correct 1231 ms 7200 KB Output is correct
85 Correct 2933 ms 10044 KB Output is correct
86 Correct 359 ms 10000 KB Output is correct
87 Correct 141 ms 9848 KB Output is correct
88 Correct 1742 ms 11992 KB Output is correct
89 Correct 2871 ms 13796 KB Output is correct
90 Correct 1774 ms 11772 KB Output is correct
91 Correct 1963 ms 9684 KB Output is correct
92 Correct 2073 ms 9800 KB Output is correct
93 Correct 2518 ms 8876 KB Output is correct
94 Correct 2286 ms 11688 KB Output is correct
95 Correct 2487 ms 11848 KB Output is correct
96 Correct 2286 ms 10608 KB Output is correct
97 Correct 1242 ms 11520 KB Output is correct
98 Correct 1450 ms 11548 KB Output is correct
99 Correct 2607 ms 13688 KB Output is correct
100 Correct 2755 ms 13688 KB Output is correct
101 Correct 2759 ms 13824 KB Output is correct
102 Correct 2809 ms 13784 KB Output is correct
103 Correct 2438 ms 11000 KB Output is correct
104 Correct 2447 ms 11128 KB Output is correct
105 Correct 2139 ms 10900 KB Output is correct
106 Correct 1802 ms 10308 KB Output is correct
107 Correct 1908 ms 11432 KB Output is correct
108 Correct 2882 ms 12212 KB Output is correct
109 Correct 2263 ms 9772 KB Output is correct