oj.uz

Submission #484685

# Submission time Handle Problem Language Result Execution time Memory
484685 2021-11-05T04:12:42 Z Killer2501 Bridges (APIO19_bridges) C++14
100 / 100
 2079 ms 16352 KB 
#include <bits/stdc++.h>
#define ll int
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pll pair<ll, ll>
#define pii pair<ll, pll>
#define fi first
#define se second
using namespace std;
const int N = 2e5+5;
const int M = 405;
const ll mod = 1e9;
const ll base = 350;
const ll inf = 1e9  ;

ll n, m, t, q, k, ans, a[N], b[N], tong, in[N], out[N], res[N], x[N], y[N], w[N], id[N];
vector<ll> adj[N];
struct DSU
{
    ll n;
    vector<ll> lab;
    vector<pair<pll, pll>> snap;
    DSU(ll _n)
    {
        n = _n;
        lab.resize(n+1, -1);
    }
    ll findp(ll u)
    {
        return lab[u] < 0 ? u : findp(lab[u]);
    }
    void hop(ll x, ll y)
    {
        ll u = findp(x), v = findp(y);
        if(u == v)return;
        if(lab[u] > lab[v])swap(u, v);
        snap.pb({{u, lab[u]}, {v, lab[v]}});
        lab[u] += lab[v];
        lab[v] = u;
    }
    void rollback(ll sz)
    {
        while((int) snap.size() > sz)
        {
            auto x = snap.back();
            snap.pop_back();
            lab[x.fi.fi] = x.fi.se;
            lab[x.se.fi] = x.se.se;
        }
    }
};
vector<ll> ve;
bool cmp(const ll& x, const ll& y)
{
    return w[x] > w[y];
}
void sol()
{
    cin >> n >> m;
    for(int i = 1; i <= m; i ++)
    {
        cin >> x[i] >> y[i] >> w[i];
        id[i] = i;
        in[i] = i;
        out[i] = inf;
        ve.pb(i);
    }
    cin >> q;
    for(int i = m+1; i <= m+q; i ++)
    {
        cin >> x[i] >> y[i] >> w[i];
        if(x[i] == 1)
        {
            out[id[y[i]]] = i-1;
            id[y[i]] = i;
            in[i] = i;
            out[i] = inf;
            ve.pb(i);
        }
    }
    //for(int i = 1; i <= m+q; i ++)cout << in[i] <<" "<<out[i] << '\n';
    DSU dsu(n);
    sort(ve.begin(), ve.end(), cmp);
    for(int l = m+1; l <= m+q; l += base)
    {
        int r = min(m+q, l+base-1);
        vector<ll> fixed, query, kq;
        for(int i = l; i <= r; i ++)if(x[i] == 2)query.pb(i);
        if(query.empty())continue;
        sort(query.begin(), query.end(), cmp);
        for(int i: ve)
        {
            if(in[i] <= l && out[i] >= r)fixed.pb(i);
            else if(in[i] <= r && out[i] >= l)kq.pb(i);
        }
        int j = 0;
        for(int i: query)
        {
            //cout << i << " ";
            while(j < (int) fixed.size() && w[fixed[j]] >= w[i])
            {
                //cout << fixed[j] << " ";
                if(fixed[j] <= m)dsu.hop(x[fixed[j]], y[fixed[j]]);
                else dsu.hop(x[y[fixed[j]]], y[y[fixed[j]]]);
                ++j;
            }
            k = dsu.snap.size();
            for(int p: kq)
            {
                if(w[p] >= w[i] && in[p] <= i && i <= out[p])
                {
                    //cout << p << " ";
                    if(p <= m)dsu.hop(x[p], y[p]);
                    else dsu.hop(x[y[p]], y[y[p]]);
                }
            }
            //cout << '\n';
            res[i] = -dsu.lab[dsu.findp(y[i])];
            dsu.rollback(k);
        }
        dsu.rollback(0);
    }
    for(int i = m+1; i <= m+q; i ++)if(x[i] == 2)cout << res[i] << '\n';

}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    #define task "test"
    if(fopen(task".inp", "r"))
	{
		freopen(task".inp", "r", stdin);
		freopen(task".out", "w", stdout);
	}
    int test = 1;
    //cin >> test;
    while(test -- > 0)sol();
    return 0;
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:135:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |   freopen(task".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:136:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  136 |   freopen(task".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 18 ms 5360 KB Output is correct
4 Correct 6 ms 5324 KB Output is correct
5 Correct 13 ms 5500 KB Output is correct
6 Correct 13 ms 5476 KB Output is correct
7 Correct 17 ms 5324 KB Output is correct
8 Correct 14 ms 5484 KB Output is correct
9 Correct 20 ms 5392 KB Output is correct
10 Correct 15 ms 5452 KB Output is correct
11 Correct 14 ms 5484 KB Output is correct
12 Correct 15 ms 5452 KB Output is correct
13 Correct 19 ms 5468 KB Output is correct
14 Correct 15 ms 5444 KB Output is correct
15 Correct 16 ms 5580 KB Output is correct
16 Correct 14 ms 5416 KB Output is correct
17 Correct 14 ms 5324 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1170 ms 10812 KB Output is correct
2 Correct 1129 ms 13768 KB Output is correct
3 Correct 1156 ms 13660 KB Output is correct
4 Correct 1147 ms 13788 KB Output is correct
5 Correct 1166 ms 13760 KB Output is correct
6 Correct 1337 ms 13728 KB Output is correct
7 Correct 1401 ms 13592 KB Output is correct
8 Correct 1310 ms 13704 KB Output is correct
9 Correct 34 ms 8128 KB Output is correct
10 Correct 850 ms 12500 KB Output is correct
11 Correct 870 ms 12524 KB Output is correct
12 Correct 746 ms 13172 KB Output is correct
13 Correct 1192 ms 13756 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 835 ms 9608 KB Output is correct
2 Correct 499 ms 9884 KB Output is correct
3 Correct 898 ms 11840 KB Output is correct
4 Correct 829 ms 12160 KB Output is correct
5 Correct 36 ms 8128 KB Output is correct
6 Correct 887 ms 11948 KB Output is correct
7 Correct 806 ms 11920 KB Output is correct
8 Correct 768 ms 11904 KB Output is correct
9 Correct 495 ms 11772 KB Output is correct
10 Correct 506 ms 11812 KB Output is correct
11 Correct 843 ms 11952 KB Output is correct
12 Correct 790 ms 11892 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1343 ms 11280 KB Output is correct
2 Correct 36 ms 6716 KB Output is correct
3 Correct 128 ms 8808 KB Output is correct
4 Correct 107 ms 8876 KB Output is correct
5 Correct 1101 ms 11348 KB Output is correct
6 Correct 1292 ms 11220 KB Output is correct
7 Correct 1090 ms 11284 KB Output is correct
8 Correct 586 ms 9800 KB Output is correct
9 Correct 589 ms 9696 KB Output is correct
10 Correct 602 ms 9824 KB Output is correct
11 Correct 1048 ms 10564 KB Output is correct
12 Correct 985 ms 10632 KB Output is correct
13 Correct 1074 ms 10448 KB Output is correct
14 Correct 1103 ms 11344 KB Output is correct
15 Correct 1091 ms 11208 KB Output is correct
16 Correct 1371 ms 11384 KB Output is correct
17 Correct 1417 ms 11248 KB Output is correct
18 Correct 1387 ms 11320 KB Output is correct
19 Correct 1384 ms 11248 KB Output is correct
20 Correct 1191 ms 10768 KB Output is correct
21 Correct 1198 ms 10952 KB Output is correct
22 Correct 1344 ms 11192 KB Output is correct
23 Correct 1096 ms 10580 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1170 ms 10812 KB Output is correct
2 Correct 1129 ms 13768 KB Output is correct
3 Correct 1156 ms 13660 KB Output is correct
4 Correct 1147 ms 13788 KB Output is correct
5 Correct 1166 ms 13760 KB Output is correct
6 Correct 1337 ms 13728 KB Output is correct
7 Correct 1401 ms 13592 KB Output is correct
8 Correct 1310 ms 13704 KB Output is correct
9 Correct 34 ms 8128 KB Output is correct
10 Correct 850 ms 12500 KB Output is correct
11 Correct 870 ms 12524 KB Output is correct
12 Correct 746 ms 13172 KB Output is correct
13 Correct 1192 ms 13756 KB Output is correct
14 Correct 835 ms 9608 KB Output is correct
15 Correct 499 ms 9884 KB Output is correct
16 Correct 898 ms 11840 KB Output is correct
17 Correct 829 ms 12160 KB Output is correct
18 Correct 36 ms 8128 KB Output is correct
19 Correct 887 ms 11948 KB Output is correct
20 Correct 806 ms 11920 KB Output is correct
21 Correct 768 ms 11904 KB Output is correct
22 Correct 495 ms 11772 KB Output is correct
23 Correct 506 ms 11812 KB Output is correct
24 Correct 843 ms 11952 KB Output is correct
25 Correct 790 ms 11892 KB Output is correct
26 Correct 1082 ms 13760 KB Output is correct
27 Correct 1277 ms 13580 KB Output is correct
28 Correct 1195 ms 13588 KB Output is correct
29 Correct 1036 ms 13800 KB Output is correct
30 Correct 1256 ms 13448 KB Output is correct
31 Correct 1259 ms 13524 KB Output is correct
32 Correct 1308 ms 13556 KB Output is correct
33 Correct 1146 ms 13708 KB Output is correct
34 Correct 1180 ms 13628 KB Output is correct
35 Correct 1165 ms 13648 KB Output is correct
36 Correct 1042 ms 13692 KB Output is correct
37 Correct 1016 ms 13584 KB Output is correct
38 Correct 1030 ms 13656 KB Output is correct
39 Correct 744 ms 13068 KB Output is correct
40 Correct 722 ms 13296 KB Output is correct
41 Correct 711 ms 13148 KB Output is correct
42 Correct 1047 ms 13760 KB Output is correct
43 Correct 1064 ms 13500 KB Output is correct
44 Correct 1044 ms 13624 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 18 ms 5360 KB Output is correct
4 Correct 6 ms 5324 KB Output is correct
5 Correct 13 ms 5500 KB Output is correct
6 Correct 13 ms 5476 KB Output is correct
7 Correct 17 ms 5324 KB Output is correct
8 Correct 14 ms 5484 KB Output is correct
9 Correct 20 ms 5392 KB Output is correct
10 Correct 15 ms 5452 KB Output is correct
11 Correct 14 ms 5484 KB Output is correct
12 Correct 15 ms 5452 KB Output is correct
13 Correct 19 ms 5468 KB Output is correct
14 Correct 15 ms 5444 KB Output is correct
15 Correct 16 ms 5580 KB Output is correct
16 Correct 14 ms 5416 KB Output is correct
17 Correct 14 ms 5324 KB Output is correct
18 Correct 1170 ms 10812 KB Output is correct
19 Correct 1129 ms 13768 KB Output is correct
20 Correct 1156 ms 13660 KB Output is correct
21 Correct 1147 ms 13788 KB Output is correct
22 Correct 1166 ms 13760 KB Output is correct
23 Correct 1337 ms 13728 KB Output is correct
24 Correct 1401 ms 13592 KB Output is correct
25 Correct 1310 ms 13704 KB Output is correct
26 Correct 34 ms 8128 KB Output is correct
27 Correct 850 ms 12500 KB Output is correct
28 Correct 870 ms 12524 KB Output is correct
29 Correct 746 ms 13172 KB Output is correct
30 Correct 1192 ms 13756 KB Output is correct
31 Correct 835 ms 9608 KB Output is correct
32 Correct 499 ms 9884 KB Output is correct
33 Correct 898 ms 11840 KB Output is correct
34 Correct 829 ms 12160 KB Output is correct
35 Correct 36 ms 8128 KB Output is correct
36 Correct 887 ms 11948 KB Output is correct
37 Correct 806 ms 11920 KB Output is correct
38 Correct 768 ms 11904 KB Output is correct
39 Correct 495 ms 11772 KB Output is correct
40 Correct 506 ms 11812 KB Output is correct
41 Correct 843 ms 11952 KB Output is correct
42 Correct 790 ms 11892 KB Output is correct
43 Correct 1343 ms 11280 KB Output is correct
44 Correct 36 ms 6716 KB Output is correct
45 Correct 128 ms 8808 KB Output is correct
46 Correct 107 ms 8876 KB Output is correct
47 Correct 1101 ms 11348 KB Output is correct
48 Correct 1292 ms 11220 KB Output is correct
49 Correct 1090 ms 11284 KB Output is correct
50 Correct 586 ms 9800 KB Output is correct
51 Correct 589 ms 9696 KB Output is correct
52 Correct 602 ms 9824 KB Output is correct
53 Correct 1048 ms 10564 KB Output is correct
54 Correct 985 ms 10632 KB Output is correct
55 Correct 1074 ms 10448 KB Output is correct
56 Correct 1103 ms 11344 KB Output is correct
57 Correct 1091 ms 11208 KB Output is correct
58 Correct 1371 ms 11384 KB Output is correct
59 Correct 1417 ms 11248 KB Output is correct
60 Correct 1387 ms 11320 KB Output is correct
61 Correct 1384 ms 11248 KB Output is correct
62 Correct 1191 ms 10768 KB Output is correct
63 Correct 1198 ms 10952 KB Output is correct
64 Correct 1344 ms 11192 KB Output is correct
65 Correct 1096 ms 10580 KB Output is correct
66 Correct 1082 ms 13760 KB Output is correct
67 Correct 1277 ms 13580 KB Output is correct
68 Correct 1195 ms 13588 KB Output is correct
69 Correct 1036 ms 13800 KB Output is correct
70 Correct 1256 ms 13448 KB Output is correct
71 Correct 1259 ms 13524 KB Output is correct
72 Correct 1308 ms 13556 KB Output is correct
73 Correct 1146 ms 13708 KB Output is correct
74 Correct 1180 ms 13628 KB Output is correct
75 Correct 1165 ms 13648 KB Output is correct
76 Correct 1042 ms 13692 KB Output is correct
77 Correct 1016 ms 13584 KB Output is correct
78 Correct 1030 ms 13656 KB Output is correct
79 Correct 744 ms 13068 KB Output is correct
80 Correct 722 ms 13296 KB Output is correct
81 Correct 711 ms 13148 KB Output is correct
82 Correct 1047 ms 13760 KB Output is correct
83 Correct 1064 ms 13500 KB Output is correct
84 Correct 1044 ms 13624 KB Output is correct
85 Correct 2005 ms 16296 KB Output is correct
86 Correct 153 ms 10776 KB Output is correct
87 Correct 124 ms 10940 KB Output is correct
88 Correct 1622 ms 14756 KB Output is correct
89 Correct 1962 ms 16352 KB Output is correct
90 Correct 1620 ms 14784 KB Output is correct
91 Correct 1162 ms 13764 KB Output is correct
92 Correct 1147 ms 13752 KB Output is correct
93 Correct 1373 ms 13440 KB Output is correct
94 Correct 1676 ms 14760 KB Output is correct
95 Correct 1651 ms 14916 KB Output is correct
96 Correct 1780 ms 14780 KB Output is correct
97 Correct 1259 ms 14552 KB Output is correct
98 Correct 1699 ms 14888 KB Output is correct
99 Correct 2035 ms 16308 KB Output is correct
100 Correct 2059 ms 16192 KB Output is correct
101 Correct 2033 ms 16352 KB Output is correct
102 Correct 2079 ms 16348 KB Output is correct
103 Correct 1960 ms 15424 KB Output is correct
104 Correct 1948 ms 15296 KB Output is correct
105 Correct 1961 ms 15552 KB Output is correct
106 Correct 1738 ms 15168 KB Output is correct
107 Correct 1406 ms 14896 KB Output is correct
108 Correct 2017 ms 15920 KB Output is correct
109 Correct 1742 ms 13992 KB Output is correct