oj.uz

답안 #888156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888156 2023-12-16T08:55:34 Z Shayan86 Construction of Highway (JOI18_construction) C++14
16 / 100
 2000 ms 28008 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);
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const ll L = 18;
const ll sq = 400;
const ll N = 1e5 + 50;
const ll Mod = 1e9 + 7;
 
ll n, c[N], par[N][L], h[N], mx[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];
    }
    for(int u: adj[v]){
        h[u] = h[v] + 1; dfs(u, v);
    }
}
 
int getPar(int v, int k){
    for(int i = 0; i < L; i++){
        if(k >> i & 1) v = par[v][i];
    }
    return v;
}
 
int lca(int v, int u){
    if(h[v] < h[u]) swap(u, v);
    v = getPar(v, h[v] - h[u]);
    if(u == v) return v;
 
    for(int i = L-1; i >= 0; i--){
        if(par[v][i] != par[u][i]){
            v = par[v][i]; u = par[u][i];
        }
    }
    return par[v][0];
}
 
void prep(int v){
    for(int u: adj[v]){
        prep(u); mx[v] = max(mx[v], mx[u]);
    }
    if(mx[v]) c[v] = c[edge[mx[v]]];
}
 
vector<int> vec;
vector<pii> block;
 
int bit[N], m;
 
void upd(int x, int y){
    for(; x <= m; x += x & (-x)) bit[x] += y;
}
 
int get(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 - get(id)); upd(id, y); sum += y;
    }
 
    fill(bit, bit + m+1, 0);
    return res;
}
 
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);
 
    for(int i = 1; i < n; i++){
        block.clear(); 
        int tah = -1; v = edge[i];
        for(int j = i-1; j % sq != 0; j--){
            u = lca(v, edge[j]);
            if(h[u] > tah){
                block.pb({c[edge[j]], h[u] - tah});
                tah = h[u];
                if(tah == h[v]-1) break;
            }
        }
        vec.clear();
        while(h[v] - 1 > tah){
            v = par[v][0]; vec.pb(c[v]);
        }
        reverse(all(vec));
 
        for(int j: vec) block.pb({j, 1});
 
        cout << solve() << endl;

        if(i % sq == 0){
            fill(mx, mx + N, 0);
            for(int j = i; j > i - sq; j--) mx[edge[j]] = j;
            prep(1);
        }
    }
 
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 3 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 4 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8672 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 3 ms 8540 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 3 ms 8540 KB Output is correct
18 Correct 3 ms 8536 KB Output is correct
19 Correct 2 ms 8536 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 3 ms 8540 KB Output is correct
24 Correct 3 ms 8540 KB Output is correct
25 Correct 3 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 8536 KB Output is correct
28 Correct 1 ms 8536 KB Output is correct
29 Correct 3 ms 8536 KB Output is correct
30 Correct 3 ms 8540 KB Output is correct
31 Correct 3 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 4 ms 8540 KB Output is correct
34 Correct 3 ms 8540 KB Output is correct
35 Correct 3 ms 8540 KB Output is correct
36 Correct 3 ms 8540 KB Output is correct
37 Correct 3 ms 8540 KB Output is correct
38 Correct 3 ms 8540 KB Output is correct
39 Correct 2 ms 8696 KB Output is correct
40 Correct 2 ms 8536 KB Output is correct
41 Correct 2 ms 8540 KB Output is correct
42 Correct 2 ms 8536 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 3 ms 8540 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 3 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 4 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8672 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 3 ms 8540 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 3 ms 8540 KB Output is correct
18 Correct 3 ms 8536 KB Output is correct
19 Correct 2 ms 8536 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 3 ms 8540 KB Output is correct
24 Correct 3 ms 8540 KB Output is correct
25 Correct 3 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 8536 KB Output is correct
28 Correct 1 ms 8536 KB Output is correct
29 Correct 3 ms 8536 KB Output is correct
30 Correct 3 ms 8540 KB Output is correct
31 Correct 3 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 4 ms 8540 KB Output is correct
34 Correct 3 ms 8540 KB Output is correct
35 Correct 3 ms 8540 KB Output is correct
36 Correct 3 ms 8540 KB Output is correct
37 Correct 3 ms 8540 KB Output is correct
38 Correct 3 ms 8540 KB Output is correct
39 Correct 2 ms 8696 KB Output is correct
40 Correct 2 ms 8536 KB Output is correct
41 Correct 2 ms 8540 KB Output is correct
42 Correct 2 ms 8536 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 3 ms 8540 KB Output is correct
45 Correct 6 ms 8540 KB Output is correct
46 Correct 38 ms 8768 KB Output is correct
47 Correct 34 ms 9196 KB Output is correct
48 Correct 32 ms 8540 KB Output is correct
49 Correct 4 ms 8792 KB Output is correct
50 Correct 4 ms 8996 KB Output is correct
51 Correct 4 ms 8796 KB Output is correct
52 Correct 4 ms 8796 KB Output is correct
53 Correct 4 ms 8796 KB Output is correct
54 Correct 4 ms 8796 KB Output is correct
55 Correct 4 ms 8796 KB Output is correct
56 Correct 17 ms 8796 KB Output is correct
57 Correct 28 ms 8784 KB Output is correct
58 Correct 28 ms 8540 KB Output is correct
59 Correct 30 ms 8540 KB Output is correct
60 Correct 29 ms 8540 KB Output is correct
61 Correct 7 ms 8796 KB Output is correct
62 Correct 5 ms 8796 KB Output is correct
63 Correct 5 ms 8820 KB Output is correct
64 Correct 33 ms 8540 KB Output is correct
65 Correct 33 ms 8764 KB Output is correct
66 Correct 34 ms 8756 KB Output is correct
67 Correct 32 ms 8540 KB Output is correct
68 Correct 4 ms 8976 KB Output is correct
69 Correct 4 ms 8796 KB Output is correct
70 Correct 4 ms 8796 KB Output is correct
71 Correct 18 ms 8796 KB Output is correct
72 Correct 28 ms 8772 KB Output is correct
73 Correct 29 ms 8536 KB Output is correct
74 Correct 5 ms 8796 KB Output is correct
75 Correct 19 ms 8796 KB Output is correct
76 Correct 21 ms 8796 KB Output is correct
77 Correct 23 ms 8780 KB Output is correct
78 Correct 20 ms 8796 KB Output is correct
79 Correct 21 ms 9048 KB Output is correct
80 Correct 23 ms 8796 KB Output is correct
81 Correct 6 ms 8796 KB Output is correct
82 Correct 7 ms 8796 KB Output is correct
83 Correct 7 ms 8784 KB Output is correct
84 Correct 5 ms 8796 KB Output is correct
85 Correct 7 ms 8784 KB Output is correct
86 Correct 7 ms 8540 KB Output is correct

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 2 ms 8540 KB Output is correct
5 Correct 3 ms 8540 KB Output is correct
6 Correct 3 ms 8540 KB Output is correct
7 Correct 3 ms 8540 KB Output is correct
8 Correct 1 ms 8540 KB Output is correct
9 Correct 4 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 2 ms 8672 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 3 ms 8540 KB Output is correct
16 Correct 3 ms 8540 KB Output is correct
17 Correct 3 ms 8540 KB Output is correct
18 Correct 3 ms 8536 KB Output is correct
19 Correct 2 ms 8536 KB Output is correct
20 Correct 2 ms 8540 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 3 ms 8540 KB Output is correct
24 Correct 3 ms 8540 KB Output is correct
25 Correct 3 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 1 ms 8536 KB Output is correct
28 Correct 1 ms 8536 KB Output is correct
29 Correct 3 ms 8536 KB Output is correct
30 Correct 3 ms 8540 KB Output is correct
31 Correct 3 ms 8540 KB Output is correct
32 Correct 2 ms 8540 KB Output is correct
33 Correct 4 ms 8540 KB Output is correct
34 Correct 3 ms 8540 KB Output is correct
35 Correct 3 ms 8540 KB Output is correct
36 Correct 3 ms 8540 KB Output is correct
37 Correct 3 ms 8540 KB Output is correct
38 Correct 3 ms 8540 KB Output is correct
39 Correct 2 ms 8696 KB Output is correct
40 Correct 2 ms 8536 KB Output is correct
41 Correct 2 ms 8540 KB Output is correct
42 Correct 2 ms 8536 KB Output is correct
43 Correct 2 ms 8540 KB Output is correct
44 Correct 3 ms 8540 KB Output is correct
45 Correct 6 ms 8540 KB Output is correct
46 Correct 38 ms 8768 KB Output is correct
47 Correct 34 ms 9196 KB Output is correct
48 Correct 32 ms 8540 KB Output is correct
49 Correct 4 ms 8792 KB Output is correct
50 Correct 4 ms 8996 KB Output is correct
51 Correct 4 ms 8796 KB Output is correct
52 Correct 4 ms 8796 KB Output is correct
53 Correct 4 ms 8796 KB Output is correct
54 Correct 4 ms 8796 KB Output is correct
55 Correct 4 ms 8796 KB Output is correct
56 Correct 17 ms 8796 KB Output is correct
57 Correct 28 ms 8784 KB Output is correct
58 Correct 28 ms 8540 KB Output is correct
59 Correct 30 ms 8540 KB Output is correct
60 Correct 29 ms 8540 KB Output is correct
61 Correct 7 ms 8796 KB Output is correct
62 Correct 5 ms 8796 KB Output is correct
63 Correct 5 ms 8820 KB Output is correct
64 Correct 33 ms 8540 KB Output is correct
65 Correct 33 ms 8764 KB Output is correct
66 Correct 34 ms 8756 KB Output is correct
67 Correct 32 ms 8540 KB Output is correct
68 Correct 4 ms 8976 KB Output is correct
69 Correct 4 ms 8796 KB Output is correct
70 Correct 4 ms 8796 KB Output is correct
71 Correct 18 ms 8796 KB Output is correct
72 Correct 28 ms 8772 KB Output is correct
73 Correct 29 ms 8536 KB Output is correct
74 Correct 5 ms 8796 KB Output is correct
75 Correct 19 ms 8796 KB Output is correct
76 Correct 21 ms 8796 KB Output is correct
77 Correct 23 ms 8780 KB Output is correct
78 Correct 20 ms 8796 KB Output is correct
79 Correct 21 ms 9048 KB Output is correct
80 Correct 23 ms 8796 KB Output is correct
81 Correct 6 ms 8796 KB Output is correct
82 Correct 7 ms 8796 KB Output is correct
83 Correct 7 ms 8784 KB Output is correct
84 Correct 5 ms 8796 KB Output is correct
85 Correct 7 ms 8784 KB Output is correct
86 Correct 7 ms 8540 KB Output is correct
87 Correct 99 ms 8896 KB Output is correct
88 Correct 349 ms 13412 KB Output is correct
89 Correct 1757 ms 21784 KB Output is correct
90 Correct 1646 ms 21992 KB Output is correct
91 Correct 1698 ms 21980 KB Output is correct
92 Execution timed out 2091 ms 28008 KB Time limit exceeded
93 Halted 0 ms 0 KB -