oj.uz

Submission #888178

# Submission time Handle Problem Language Result Execution time Memory
888178 2023-12-16T09:42:33 Z Shayan86 Construction of Highway (JOI18_construction) C++14
100 / 100
 768 ms 36828 KB 
#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv
 
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
#define Mp          make_pair
#define sep         ' '
#define endl        '\n'
#define F	        first
#define S	        second
#define pb          push_back
#define all(x)      (x).begin(),(x).end()
#define kill(res)	cout << res << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define fast_io     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io     freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);
 
 #define lid (id*2)
 #define rid (id*2+1)
 #define mid ((l+r)/2)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const ll L = 18;
const ll N = 1e5 + 50;
const ll Mod = 1e9 + 7;
 
ll n, c[N], par[N][L], h[N], st[N], ft[N], timer = 1, down[N];
 
vector<int> edge, adj[N];
 
void dfs(int v, int p = 0){
    par[v][0] = p;
    for(int i = 1; i < L; i++){
        if(!par[v][i-1]) break;
        par[v][i] = par[par[v][i-1]][i-1];
    }
    st[v] = timer++;
    for(int u: adj[v]){
        h[u] = h[v] + 1; dfs(u, v);
    }
    ft[v] = timer;

    down[v] = v;
}

int fen[N];

int getfen(int x){
    int out = 0;
    for(; x; x -= x & (-x)) out += fen[x];
    return out;
}

void updfen(int x, int y){
    for(; x <= n+1; x += x & (-x)) fen[x] += y;
}
 
int getPar(int v){
    int x = getfen(st[v]);
    for(int i = L-1; i >= 0; i--){
        if(x == getfen(st[par[v][i]])) v = par[v][i];
    }
    return v;
}
 
vector<int> vec;
vector<pii> block;
 
int bit[N], m;
 
void updsol(int x, int y){
    for(; x <= m; x += x & (-x)) bit[x] += y;
}
 
int getsol(int x){
    int out = 0;
    for(; x; x -= x & (-x)) out += bit[x];
    return out;
}
 
ll solve(){
    vec.clear();
    for(auto i: block) vec.pb(i.F);
 
    sort(all(vec)); vec.resize(unique(all(vec)) - vec.begin());
    m = vec.size();
 
    int sum = 0; ll res = 0;
    for(auto [x, y]: block){
        int id = lower_bound(all(vec), x) - vec.begin() + 1;
        res += 1ll * y * (sum - getsol(id)); updsol(id, y); sum += y;
    }
 
    fill(bit, bit + m+1, 0);
    return res;
}

pii seg[N*4];

void updseg(int x, pii y, int l = 1, int r = n+1, int id = 1){
    if(l+1 == r){
        seg[id] = y; return;
    }
    if(x < mid) updseg(x, y, l, mid, lid);
    else updseg(x, y, mid, r, rid);
    seg[id] = max(seg[lid], seg[rid]);
}

pii getseg(int ql, int qr, int l = 1, int r = n+1, int id = 1){
    if(ql <= l && r <= qr) return seg[id];
    if(qr <= l || r <= ql) return {0, 0};
    return max(getseg(ql, qr, l, mid, lid), getseg(ql, qr, mid, r, rid));
}
 
int main(){
    fast_io;
 
    cin >> n;
 
    for(int i = 1; i <= n; i++) cin >> c[i];
 
    int u, v; edge.pb(1);
    for(int i = 1; i < n; i++){
        cin >> u >> v;
        adj[u].pb(v); edge.pb(v);
    }
 
    dfs(1);
 
    updseg(st[1], {0, c[1]});
    updfen(st[1], 1); updfen(ft[1], -1);

    for(int i = 1; i < n; i++){
        block.clear(); 
        v = par[edge[i]][0];
        while(v){
            u = getPar(v);
            block.pb({getseg(st[v], ft[v]).S, h[v] - h[u] + 1});
            v = par[u][0];
        }
        reverse(all(block));

        cout << solve() << endl;

        v = edge[i];
        updseg(st[v], {i, c[v]});

        int last = v; v = par[v][0];
        while(v){
            u = getPar(v);
            if(down[v] != v){
                updfen(st[down[v]], 1);
                updfen(ft[down[v]], -1);
            }
            down[v] = last;

            if(u != 1){
                updfen(st[u], -1);
                updfen(ft[u], 1);
            }
            last = u;
            v = par[u][0];
        }
    }
 
}

Compilation message

construction.cpp: In function 'll solve()':
construction.cpp:96:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   96 |     for(auto [x, y]: block){
      |              ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8792 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8712 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8632 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 8692 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8792 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8628 KB Output is correct
30 Correct 2 ms 8688 KB Output is correct
31 Correct 2 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 2 ms 8540 KB Output is correct
34 Correct 2 ms 8540 KB Output is correct
35 Correct 2 ms 8540 KB Output is correct
36 Correct 2 ms 8540 KB Output is correct
37 Correct 2 ms 8540 KB Output is correct
38 Correct 2 ms 8540 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 2 ms 8540 KB Output is correct
41 Correct 2 ms 8540 KB Output is correct
42 Correct 2 ms 8540 KB Output is correct
43 Correct 2 ms 8536 KB Output is correct
44 Correct 2 ms 8540 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8792 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8712 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8632 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 8692 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8792 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8628 KB Output is correct
30 Correct 2 ms 8688 KB Output is correct
31 Correct 2 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 2 ms 8540 KB Output is correct
34 Correct 2 ms 8540 KB Output is correct
35 Correct 2 ms 8540 KB Output is correct
36 Correct 2 ms 8540 KB Output is correct
37 Correct 2 ms 8540 KB Output is correct
38 Correct 2 ms 8540 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 2 ms 8540 KB Output is correct
41 Correct 2 ms 8540 KB Output is correct
42 Correct 2 ms 8540 KB Output is correct
43 Correct 2 ms 8536 KB Output is correct
44 Correct 2 ms 8540 KB Output is correct
45 Correct 3 ms 8540 KB Output is correct
46 Correct 9 ms 8796 KB Output is correct
47 Correct 10 ms 8796 KB Output is correct
48 Correct 9 ms 8868 KB Output is correct
49 Correct 4 ms 9052 KB Output is correct
50 Correct 4 ms 9052 KB Output is correct
51 Correct 4 ms 9248 KB Output is correct
52 Correct 6 ms 8796 KB Output is correct
53 Correct 5 ms 9008 KB Output is correct
54 Correct 6 ms 8796 KB Output is correct
55 Correct 6 ms 8796 KB Output is correct
56 Correct 6 ms 8796 KB Output is correct
57 Correct 15 ms 8796 KB Output is correct
58 Correct 16 ms 8868 KB Output is correct
59 Correct 16 ms 8792 KB Output is correct
60 Correct 16 ms 8792 KB Output is correct
61 Correct 6 ms 8792 KB Output is correct
62 Correct 6 ms 8796 KB Output is correct
63 Correct 6 ms 8796 KB Output is correct
64 Correct 9 ms 8792 KB Output is correct
65 Correct 11 ms 9068 KB Output is correct
66 Correct 9 ms 8796 KB Output is correct
67 Correct 8 ms 8796 KB Output is correct
68 Correct 4 ms 9048 KB Output is correct
69 Correct 6 ms 8796 KB Output is correct
70 Correct 6 ms 8800 KB Output is correct
71 Correct 5 ms 8796 KB Output is correct
72 Correct 15 ms 8796 KB Output is correct
73 Correct 17 ms 8784 KB Output is correct
74 Correct 6 ms 8792 KB Output is correct
75 Correct 5 ms 8796 KB Output is correct
76 Correct 5 ms 8796 KB Output is correct
77 Correct 6 ms 8892 KB Output is correct
78 Correct 5 ms 8796 KB Output is correct
79 Correct 5 ms 8892 KB Output is correct
80 Correct 7 ms 8796 KB Output is correct
81 Correct 6 ms 8796 KB Output is correct
82 Correct 6 ms 8796 KB Output is correct
83 Correct 6 ms 8792 KB Output is correct
84 Correct 6 ms 8796 KB Output is correct
85 Correct 6 ms 8796 KB Output is correct
86 Correct 6 ms 8796 KB Output is correct

Subtask #3
84.0 / 84.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8792 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 2 ms 8540 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 2 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 2 ms 8712 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 2 ms 8540 KB Output is correct
12 Correct 2 ms 8540 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 2 ms 8632 KB Output is correct
16 Correct 2 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 2 ms 8540 KB Output is correct
19 Correct 2 ms 8540 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 8692 KB Output is correct
23 Correct 2 ms 8540 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8540 KB Output is correct
27 Correct 2 ms 8792 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 8628 KB Output is correct
30 Correct 2 ms 8688 KB Output is correct
31 Correct 2 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 2 ms 8540 KB Output is correct
34 Correct 2 ms 8540 KB Output is correct
35 Correct 2 ms 8540 KB Output is correct
36 Correct 2 ms 8540 KB Output is correct
37 Correct 2 ms 8540 KB Output is correct
38 Correct 2 ms 8540 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 2 ms 8540 KB Output is correct
41 Correct 2 ms 8540 KB Output is correct
42 Correct 2 ms 8540 KB Output is correct
43 Correct 2 ms 8536 KB Output is correct
44 Correct 2 ms 8540 KB Output is correct
45 Correct 3 ms 8540 KB Output is correct
46 Correct 9 ms 8796 KB Output is correct
47 Correct 10 ms 8796 KB Output is correct
48 Correct 9 ms 8868 KB Output is correct
49 Correct 4 ms 9052 KB Output is correct
50 Correct 4 ms 9052 KB Output is correct
51 Correct 4 ms 9248 KB Output is correct
52 Correct 6 ms 8796 KB Output is correct
53 Correct 5 ms 9008 KB Output is correct
54 Correct 6 ms 8796 KB Output is correct
55 Correct 6 ms 8796 KB Output is correct
56 Correct 6 ms 8796 KB Output is correct
57 Correct 15 ms 8796 KB Output is correct
58 Correct 16 ms 8868 KB Output is correct
59 Correct 16 ms 8792 KB Output is correct
60 Correct 16 ms 8792 KB Output is correct
61 Correct 6 ms 8792 KB Output is correct
62 Correct 6 ms 8796 KB Output is correct
63 Correct 6 ms 8796 KB Output is correct
64 Correct 9 ms 8792 KB Output is correct
65 Correct 11 ms 9068 KB Output is correct
66 Correct 9 ms 8796 KB Output is correct
67 Correct 8 ms 8796 KB Output is correct
68 Correct 4 ms 9048 KB Output is correct
69 Correct 6 ms 8796 KB Output is correct
70 Correct 6 ms 8800 KB Output is correct
71 Correct 5 ms 8796 KB Output is correct
72 Correct 15 ms 8796 KB Output is correct
73 Correct 17 ms 8784 KB Output is correct
74 Correct 6 ms 8792 KB Output is correct
75 Correct 5 ms 8796 KB Output is correct
76 Correct 5 ms 8796 KB Output is correct
77 Correct 6 ms 8892 KB Output is correct
78 Correct 5 ms 8796 KB Output is correct
79 Correct 5 ms 8892 KB Output is correct
80 Correct 7 ms 8796 KB Output is correct
81 Correct 6 ms 8796 KB Output is correct
82 Correct 6 ms 8796 KB Output is correct
83 Correct 6 ms 8792 KB Output is correct
84 Correct 6 ms 8796 KB Output is correct
85 Correct 6 ms 8796 KB Output is correct
86 Correct 6 ms 8796 KB Output is correct
87 Correct 24 ms 13248 KB Output is correct
88 Correct 80 ms 15708 KB Output is correct
89 Correct 386 ms 27088 KB Output is correct
90 Correct 362 ms 26876 KB Output is correct
91 Correct 394 ms 26988 KB Output is correct
92 Correct 121 ms 34528 KB Output is correct
93 Correct 115 ms 36820 KB Output is correct
94 Correct 124 ms 36828 KB Output is correct
95 Correct 167 ms 32428 KB Output is correct
96 Correct 187 ms 32844 KB Output is correct
97 Correct 175 ms 32844 KB Output is correct
98 Correct 176 ms 32952 KB Output is correct
99 Correct 164 ms 32276 KB Output is correct
100 Correct 727 ms 29312 KB Output is correct
101 Correct 761 ms 29800 KB Output is correct
102 Correct 753 ms 30020 KB Output is correct
103 Correct 760 ms 29640 KB Output is correct
104 Correct 210 ms 32204 KB Output is correct
105 Correct 242 ms 32356 KB Output is correct
106 Correct 215 ms 32220 KB Output is correct
107 Correct 353 ms 28328 KB Output is correct
108 Correct 373 ms 28432 KB Output is correct
109 Correct 387 ms 28620 KB Output is correct
110 Correct 120 ms 36036 KB Output is correct
111 Correct 173 ms 32584 KB Output is correct
112 Correct 161 ms 32236 KB Output is correct
113 Correct 168 ms 31668 KB Output is correct
114 Correct 722 ms 29132 KB Output is correct
115 Correct 768 ms 28876 KB Output is correct
116 Correct 213 ms 31408 KB Output is correct
117 Correct 154 ms 30236 KB Output is correct
118 Correct 161 ms 29640 KB Output is correct
119 Correct 151 ms 29384 KB Output is correct
120 Correct 156 ms 29896 KB Output is correct
121 Correct 152 ms 29348 KB Output is correct
122 Correct 152 ms 29196 KB Output is correct
123 Correct 216 ms 30408 KB Output is correct
124 Correct 233 ms 29856 KB Output is correct
125 Correct 207 ms 29612 KB Output is correct
126 Correct 226 ms 30020 KB Output is correct
127 Correct 210 ms 29524 KB Output is correct
128 Correct 215 ms 29160 KB Output is correct