oj.uz

답안 #241898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241898 2020-06-26T09:32:47 Z osaaateiasavtnl Construction of Highway (JOI18_construction) C++17
16 / 100
 2000 ms 31124 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int N = 1e5+7, LG = 20;
int n, a[N], par[N];
ii d[N];
vector <int> tree[N];

int to[N][LG], h[N];
int l[N], r[N], ptr = -1;
void dfs(int u) {
    to[u][0] = par[u];
    for (int i = 1; i < LG; ++i)
        to[u][i] = to[to[u][i - 1]][i - 1];

    l[u] = ++ptr;    

    for (int v : tree[u]) {
        h[v] = h[u]+1;
        dfs(v);        
    }   

    r[u] = ptr;
}   

int mx[N << 2];
void upd(int v, int tl, int tr, int i, int x) {
    mx[v] = x;
    if (tl == tr) 
        return;
    int tm = (tl + tr) >> 1;
    if (i <= tm)
        upd(v * 2 + 1, tl, tm, i, x);
    else
        upd(v * 2 + 2, tm + 1, tr, i, x);
}
int get(int v, int tl, int tr, int l, int r) {
    if (tr < l || r < tl)
        return -1;
    if (l <= tl && tr <= r)
        return mx[v];
    int tm = (tl + tr) >> 1;
    return max(get(v * 2 + 1, tl, tm, l, r), get(v * 2 + 2, tm + 1, tr, l, r));
}

int val[N];

int last(int u) {
    return get(0, 0, N, l[u], r[u]);
}

int getval(int u, int ls) {
    if (ls == -1)
        return a[u];
    else
        return val[ls];
}

struct Fen {
int f[N];
void add(int i, int x) {
    for (; i < N; i |= i + 1) 
        f[i] += x;
}   
void clear(int i) {
    for (; i < N; i |= i + 1)
        f[i] = 0;
}   
int get(int i) {
    int ans = 0;
    for (; i >= 0; i &= i + 1, --i) ans += f[i];
    return ans;
}   
int get(int l, int r) {
    return get(r) - get(l - 1);
}   
} f;

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    for (int i = 0; i < (N << 2); ++i)
        mx[i] = -1;

    cin >> n;
    vector <int> c;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        c.app(a[i]);
    }   
    sort(all(c));
    c.resize(unique(all(c)) - c.begin());
    for (int i = 1; i <= n; ++i)
        a[i] = lower_bound(all(c), a[i]) - c.begin();

    for (int t = 0; t < n - 1; ++t) {
        int u, v;
        cin >> u >> v;
        tree[u].app(v);
        par[v] = u;
        d[t] = mp(u,v);
    }   

    par[1] = 1;
    dfs(1);
    for (int t = 0; t < n - 1; ++t) {
        int u, v;
        tie(u, v) = d[t];

        vector <ii> path;
        while (1) {
            int up = u;
            for (int i = LG - 1; i >= 0; --i)
                if (last(to[up][i]) == last(u))
                    up = to[up][i];
            path.app(mp(getval(u, last(u)), h[u] - h[up] + 1));
            if (up == 1)
                break;
            else
                u = par[up];
        }   

        val[t] = a[v];
        upd(0, 0, N, l[v], t);

        int ans = 0;
        for (auto e : path) {
            ans += f.get(e.f - 1) * e.s;
            f.add(e.f, e.s);
        }   
        cout << ans << endl;
        for (auto e : path)
            f.clear(e.f);
    }   
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5888 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 11 ms 5888 KB Output is correct
4 Correct 13 ms 6016 KB Output is correct
5 Correct 16 ms 6016 KB Output is correct
6 Correct 17 ms 6016 KB Output is correct
7 Correct 16 ms 6016 KB Output is correct
8 Correct 11 ms 6016 KB Output is correct
9 Correct 11 ms 6016 KB Output is correct
10 Correct 11 ms 6016 KB Output is correct
11 Correct 13 ms 6016 KB Output is correct
12 Correct 12 ms 6016 KB Output is correct
13 Correct 13 ms 6016 KB Output is correct
14 Correct 12 ms 6016 KB Output is correct
15 Correct 28 ms 6016 KB Output is correct
16 Correct 28 ms 6016 KB Output is correct
17 Correct 27 ms 6016 KB Output is correct
18 Correct 29 ms 6100 KB Output is correct
19 Correct 13 ms 6016 KB Output is correct
20 Correct 13 ms 6016 KB Output is correct
21 Correct 13 ms 6016 KB Output is correct
22 Correct 17 ms 6016 KB Output is correct
23 Correct 16 ms 6016 KB Output is correct
24 Correct 18 ms 6016 KB Output is correct
25 Correct 18 ms 6016 KB Output is correct
26 Correct 11 ms 6016 KB Output is correct
27 Correct 12 ms 6016 KB Output is correct
28 Correct 12 ms 6016 KB Output is correct
29 Correct 12 ms 6016 KB Output is correct
30 Correct 27 ms 6016 KB Output is correct
31 Correct 28 ms 6016 KB Output is correct
32 Correct 12 ms 6016 KB Output is correct
33 Correct 12 ms 6016 KB Output is correct
34 Correct 12 ms 6016 KB Output is correct
35 Correct 12 ms 6016 KB Output is correct
36 Correct 14 ms 6068 KB Output is correct
37 Correct 12 ms 6016 KB Output is correct
38 Correct 13 ms 6016 KB Output is correct
39 Correct 12 ms 6016 KB Output is correct
40 Correct 14 ms 6016 KB Output is correct
41 Correct 13 ms 6016 KB Output is correct
42 Correct 13 ms 6016 KB Output is correct
43 Correct 13 ms 6016 KB Output is correct
44 Correct 12 ms 6016 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5888 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 11 ms 5888 KB Output is correct
4 Correct 13 ms 6016 KB Output is correct
5 Correct 16 ms 6016 KB Output is correct
6 Correct 17 ms 6016 KB Output is correct
7 Correct 16 ms 6016 KB Output is correct
8 Correct 11 ms 6016 KB Output is correct
9 Correct 11 ms 6016 KB Output is correct
10 Correct 11 ms 6016 KB Output is correct
11 Correct 13 ms 6016 KB Output is correct
12 Correct 12 ms 6016 KB Output is correct
13 Correct 13 ms 6016 KB Output is correct
14 Correct 12 ms 6016 KB Output is correct
15 Correct 28 ms 6016 KB Output is correct
16 Correct 28 ms 6016 KB Output is correct
17 Correct 27 ms 6016 KB Output is correct
18 Correct 29 ms 6100 KB Output is correct
19 Correct 13 ms 6016 KB Output is correct
20 Correct 13 ms 6016 KB Output is correct
21 Correct 13 ms 6016 KB Output is correct
22 Correct 17 ms 6016 KB Output is correct
23 Correct 16 ms 6016 KB Output is correct
24 Correct 18 ms 6016 KB Output is correct
25 Correct 18 ms 6016 KB Output is correct
26 Correct 11 ms 6016 KB Output is correct
27 Correct 12 ms 6016 KB Output is correct
28 Correct 12 ms 6016 KB Output is correct
29 Correct 12 ms 6016 KB Output is correct
30 Correct 27 ms 6016 KB Output is correct
31 Correct 28 ms 6016 KB Output is correct
32 Correct 12 ms 6016 KB Output is correct
33 Correct 12 ms 6016 KB Output is correct
34 Correct 12 ms 6016 KB Output is correct
35 Correct 12 ms 6016 KB Output is correct
36 Correct 14 ms 6068 KB Output is correct
37 Correct 12 ms 6016 KB Output is correct
38 Correct 13 ms 6016 KB Output is correct
39 Correct 12 ms 6016 KB Output is correct
40 Correct 14 ms 6016 KB Output is correct
41 Correct 13 ms 6016 KB Output is correct
42 Correct 13 ms 6016 KB Output is correct
43 Correct 13 ms 6016 KB Output is correct
44 Correct 12 ms 6016 KB Output is correct
45 Correct 26 ms 6144 KB Output is correct
46 Correct 97 ms 6912 KB Output is correct
47 Correct 102 ms 7032 KB Output is correct
48 Correct 101 ms 7032 KB Output is correct
49 Correct 33 ms 7040 KB Output is correct
50 Correct 33 ms 7160 KB Output is correct
51 Correct 34 ms 7040 KB Output is correct
52 Correct 46 ms 7032 KB Output is correct
53 Correct 53 ms 7032 KB Output is correct
54 Correct 47 ms 7032 KB Output is correct
55 Correct 48 ms 7032 KB Output is correct
56 Correct 50 ms 7040 KB Output is correct
57 Correct 228 ms 6888 KB Output is correct
58 Correct 224 ms 7036 KB Output is correct
59 Correct 235 ms 7036 KB Output is correct
60 Correct 213 ms 6912 KB Output is correct
61 Correct 53 ms 7032 KB Output is correct
62 Correct 50 ms 6912 KB Output is correct
63 Correct 52 ms 6912 KB Output is correct
64 Correct 100 ms 6912 KB Output is correct
65 Correct 96 ms 6912 KB Output is correct
66 Correct 107 ms 7048 KB Output is correct
67 Correct 102 ms 6912 KB Output is correct
68 Correct 34 ms 7040 KB Output is correct
69 Correct 48 ms 7036 KB Output is correct
70 Correct 46 ms 7032 KB Output is correct
71 Correct 46 ms 6912 KB Output is correct
72 Correct 234 ms 7032 KB Output is correct
73 Correct 218 ms 6904 KB Output is correct
74 Correct 46 ms 6912 KB Output is correct
75 Correct 47 ms 6912 KB Output is correct
76 Correct 45 ms 6912 KB Output is correct
77 Correct 47 ms 6912 KB Output is correct
78 Correct 48 ms 6912 KB Output is correct
79 Correct 47 ms 6912 KB Output is correct
80 Correct 46 ms 6912 KB Output is correct
81 Correct 54 ms 6912 KB Output is correct
82 Correct 54 ms 6912 KB Output is correct
83 Correct 57 ms 7032 KB Output is correct
84 Correct 51 ms 6912 KB Output is correct
85 Correct 54 ms 7040 KB Output is correct
86 Correct 53 ms 6912 KB Output is correct

Subtask #3
0 / 84.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5888 KB Output is correct
2 Correct 7 ms 5888 KB Output is correct
3 Correct 11 ms 5888 KB Output is correct
4 Correct 13 ms 6016 KB Output is correct
5 Correct 16 ms 6016 KB Output is correct
6 Correct 17 ms 6016 KB Output is correct
7 Correct 16 ms 6016 KB Output is correct
8 Correct 11 ms 6016 KB Output is correct
9 Correct 11 ms 6016 KB Output is correct
10 Correct 11 ms 6016 KB Output is correct
11 Correct 13 ms 6016 KB Output is correct
12 Correct 12 ms 6016 KB Output is correct
13 Correct 13 ms 6016 KB Output is correct
14 Correct 12 ms 6016 KB Output is correct
15 Correct 28 ms 6016 KB Output is correct
16 Correct 28 ms 6016 KB Output is correct
17 Correct 27 ms 6016 KB Output is correct
18 Correct 29 ms 6100 KB Output is correct
19 Correct 13 ms 6016 KB Output is correct
20 Correct 13 ms 6016 KB Output is correct
21 Correct 13 ms 6016 KB Output is correct
22 Correct 17 ms 6016 KB Output is correct
23 Correct 16 ms 6016 KB Output is correct
24 Correct 18 ms 6016 KB Output is correct
25 Correct 18 ms 6016 KB Output is correct
26 Correct 11 ms 6016 KB Output is correct
27 Correct 12 ms 6016 KB Output is correct
28 Correct 12 ms 6016 KB Output is correct
29 Correct 12 ms 6016 KB Output is correct
30 Correct 27 ms 6016 KB Output is correct
31 Correct 28 ms 6016 KB Output is correct
32 Correct 12 ms 6016 KB Output is correct
33 Correct 12 ms 6016 KB Output is correct
34 Correct 12 ms 6016 KB Output is correct
35 Correct 12 ms 6016 KB Output is correct
36 Correct 14 ms 6068 KB Output is correct
37 Correct 12 ms 6016 KB Output is correct
38 Correct 13 ms 6016 KB Output is correct
39 Correct 12 ms 6016 KB Output is correct
40 Correct 14 ms 6016 KB Output is correct
41 Correct 13 ms 6016 KB Output is correct
42 Correct 13 ms 6016 KB Output is correct
43 Correct 13 ms 6016 KB Output is correct
44 Correct 12 ms 6016 KB Output is correct
45 Correct 26 ms 6144 KB Output is correct
46 Correct 97 ms 6912 KB Output is correct
47 Correct 102 ms 7032 KB Output is correct
48 Correct 101 ms 7032 KB Output is correct
49 Correct 33 ms 7040 KB Output is correct
50 Correct 33 ms 7160 KB Output is correct
51 Correct 34 ms 7040 KB Output is correct
52 Correct 46 ms 7032 KB Output is correct
53 Correct 53 ms 7032 KB Output is correct
54 Correct 47 ms 7032 KB Output is correct
55 Correct 48 ms 7032 KB Output is correct
56 Correct 50 ms 7040 KB Output is correct
57 Correct 228 ms 6888 KB Output is correct
58 Correct 224 ms 7036 KB Output is correct
59 Correct 235 ms 7036 KB Output is correct
60 Correct 213 ms 6912 KB Output is correct
61 Correct 53 ms 7032 KB Output is correct
62 Correct 50 ms 6912 KB Output is correct
63 Correct 52 ms 6912 KB Output is correct
64 Correct 100 ms 6912 KB Output is correct
65 Correct 96 ms 6912 KB Output is correct
66 Correct 107 ms 7048 KB Output is correct
67 Correct 102 ms 6912 KB Output is correct
68 Correct 34 ms 7040 KB Output is correct
69 Correct 48 ms 7036 KB Output is correct
70 Correct 46 ms 7032 KB Output is correct
71 Correct 46 ms 6912 KB Output is correct
72 Correct 234 ms 7032 KB Output is correct
73 Correct 218 ms 6904 KB Output is correct
74 Correct 46 ms 6912 KB Output is correct
75 Correct 47 ms 6912 KB Output is correct
76 Correct 45 ms 6912 KB Output is correct
77 Correct 47 ms 6912 KB Output is correct
78 Correct 48 ms 6912 KB Output is correct
79 Correct 47 ms 6912 KB Output is correct
80 Correct 46 ms 6912 KB Output is correct
81 Correct 54 ms 6912 KB Output is correct
82 Correct 54 ms 6912 KB Output is correct
83 Correct 57 ms 7032 KB Output is correct
84 Correct 51 ms 6912 KB Output is correct
85 Correct 54 ms 7040 KB Output is correct
86 Correct 53 ms 6912 KB Output is correct
87 Correct 269 ms 8424 KB Output is correct
88 Correct 948 ms 13816 KB Output is correct
89 Execution timed out 2088 ms 31124 KB Time limit exceeded
90 Halted 0 ms 0 KB -