oj.uz

답안 #1115930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115930 2024-11-21T05:17:28 Z _8_8_ Unique Cities (JOI19_ho_t5) C++17
36 / 100
 735 ms 274432 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;

const int  N = 2e5 + 12, MOD = (int)1e9 + 7;

int n, m, a[N];
bool vis[N], timer;
vector<int> g[N];
vector<vector<int>> dist;
bool zap;
int f(int d) {
    vector<int> D(n + 1, 0);
    timer = 1;
    for(int i = 1; i <= n; i++) {
        vis[i] = 0;
    }
    vis[d] = timer;
    int lst = d;
    queue<int> q;
    q.push(d);
    while(!q.empty()) {
        int v = q.front();
        lst = v;
        q.pop();
        for(int to : g[v]) {
            if(vis[to] != timer) {
                D[to] = D[v] + 1;
                q.push(to);
                vis[to] = timer;
            }
        }
    }
    dist.push_back(D);
    return lst;
}
int dep[N], mxd[N], res[N], d, d1, o, cr, gl[N];
void dfs(int v, int pr = -1) {
    mxd[v] = dep[v];
    for(int to:g[v]) if(to != pr) {
        dep[to] = dep[v] + 1;
        dfs(to, v);
        mxd[v] = max(mxd[v], mxd[to]);
    }
    for(int i = 0; i < (int)g[v].size(); i++) {
        if(g[v][i] == pr) {
            swap(g[v][(int)g[v].size() - 1], g[v][i]);
            break;
        }
    }
    for(int i = 0; i < (int)g[v].size() - 1; i++) {
        if(mxd[g[v][i]] == mxd[v]) {
            swap(g[v][0], g[v][i]);
        }
    }
}
int b = 17, it = 0, cur = 0, ver[N];
int up[N][18];
struct node{
    node *l = 0, *r = 0;
    bool sum = 0;
    node(){};
    node(bool v) {
        sum = v;
    }
    node (node *L, node *R) {
        l = L;
        r = R;
        // sum = l->sum + r->sum;
    }
};
using pnode = node *;
pnode tr[N];    
pnode build(int tl = 1, int tr = m) {
    if(tl == tr) {
        return new node();
    }
    int tm = (tl + tr) >> 1;
    return new node(build(tl, tm), build(tm + 1, tr));
}
pnode upd(int pos, pnode v, int tl = 1, int tr = m) {
    if(tl == tr) {
        return new node(1);
    }
    int tm = (tl + tr) >> 1;
    if(pos <= tm) 
        return new node(upd(pos, v->l, tl, tm), v->r);
    return new node(v->l, upd(pos, v->r, tm + 1, tr));
}
bool get(int pos, pnode v, int tl = 1, int tr = m) {
    if(tl == tr) return v->sum;
    int tm = (tl + tr) >> 1;
    if(pos <= tm) return get(pos, v->l, tl, tm);
    return get(pos, v->r, tm + 1, tr);
}
int rt;
void go(int v) {
    if(dist[cr][v] > dist[o][v] || (dist[cr][v] == dist[o][v] && zap)) {
        int f = cur, val = -mxd[v] + dep[v] * 2;
        set<int> r;
        if(dep[ver[f]] >= val) {
            for(int i = b - 1; i >= 0; i--) {
                int nv = ver[up[f][i]];
                if(dep[nv] >= val) {
                    f = up[f][i];
                }
            }
            f = up[f][0];
        }
        res[v] += gl[f];
    }
    int sz = (int)g[v].size() - (rt != v), mx1 = dep[v];
    if(!sz) return;
    for(int i = 1; i < sz; i++) {
        mx1 = max(mx1, mxd[g[v][i]]);
    }
    int bf = cur;
    for(int i = 0; i < sz; i++) {
        int to = g[v][i];
        int mx = dep[v];
        if(i) mx = mxd[g[v][0]];
        if(i < sz - 1) mx = max(mx, mx1);
        mx -= dep[v];
        if(i == 1 && ver[cur] == v) {
            cur = up[cur][0];
        }
        if(i <= 1 && dep[v] - dep[ver[cur]] <= mx) {
            for(int i = b - 1; i >= 0; i--) {
                int nv = up[cur][i];
                if(dep[v] - dep[ver[nv]] <= mx) {
                    cur = nv;
                }
            }
            cur = up[cur][0];
        }
        if(i <= 1 && !get(a[v], tr[cur])) {
            it++;
            ver[it] = v;
            gl[it] = gl[cur] + 1;
            up[it][0] = cur;
            tr[it] = upd(a[v], tr[cur]);
            for(int i = 1; i < b; i++) {
                up[it][i] = up[up[it][i - 1]][i - 1];
            }
            cur = it;
        }
        go(to);
    }
    cur = bf;
}
void solve(int root) {
    it = cur = 0;
    ver[0] = 0;
    dep[0] = -(int)1e9;
    tr[0] = build();
    rt = root;
    dep[root] = 1;
    dfs(root);

    go(root);

}
void test() {
    cin >> n >> m;
    for(int i = 1; i <= n - 1; i++) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    d = f(1), d1 = f(d);
    f(d1);
    o = 2;cr = 1;
    solve(d);
    zap = 1;
    o = 1;cr = 2;
    solve(d1);
    for(int i = 1; i <= n; i++) {
        cout << res[i] << '\n';
    }

}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t = 1; 
    // cin >> t;

    while(t--) 
        test();
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12624 KB Output is correct
2 Correct 4 ms 14032 KB Output is correct
3 Correct 3 ms 13392 KB Output is correct
4 Correct 4 ms 13648 KB Output is correct
5 Correct 4 ms 13136 KB Output is correct
6 Correct 3 ms 12880 KB Output is correct
7 Correct 3 ms 12880 KB Output is correct
8 Correct 3 ms 12984 KB Output is correct
9 Correct 4 ms 13136 KB Output is correct
10 Correct 3 ms 12992 KB Output is correct
11 Correct 4 ms 13136 KB Output is correct
12 Correct 3 ms 12880 KB Output is correct
13 Correct 3 ms 12880 KB Output is correct
14 Correct 3 ms 12880 KB Output is correct
15 Correct 3 ms 12880 KB Output is correct
16 Correct 3 ms 12880 KB Output is correct
17 Correct 3 ms 12880 KB Output is correct
18 Correct 3 ms 12880 KB Output is correct
19 Correct 6 ms 13904 KB Output is correct
20 Correct 5 ms 14076 KB Output is correct
21 Correct 5 ms 14160 KB Output is correct
22 Correct 4 ms 13648 KB Output is correct
23 Correct 5 ms 14328 KB Output is correct
24 Correct 4 ms 13904 KB Output is correct
25 Correct 5 ms 13904 KB Output is correct
26 Correct 3 ms 13136 KB Output is correct
27 Correct 5 ms 14416 KB Output is correct
28 Correct 4 ms 13816 KB Output is correct
29 Correct 5 ms 14160 KB Output is correct
30 Correct 3 ms 12880 KB Output is correct
31 Correct 3 ms 13060 KB Output is correct
32 Correct 4 ms 13904 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 24452 KB Output is correct
2 Correct 88 ms 31108 KB Output is correct
3 Correct 19 ms 15708 KB Output is correct
4 Correct 122 ms 29240 KB Output is correct
5 Correct 161 ms 44788 KB Output is correct
6 Correct 151 ms 36668 KB Output is correct
7 Correct 123 ms 28596 KB Output is correct
8 Correct 130 ms 31032 KB Output is correct
9 Correct 151 ms 31288 KB Output is correct
10 Correct 153 ms 30008 KB Output is correct
11 Correct 87 ms 24236 KB Output is correct
12 Correct 176 ms 39480 KB Output is correct
13 Correct 155 ms 36020 KB Output is correct
14 Correct 165 ms 33212 KB Output is correct
15 Correct 86 ms 24500 KB Output is correct
16 Correct 175 ms 37940 KB Output is correct
17 Correct 151 ms 34228 KB Output is correct

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 462 ms 207068 KB Output is correct
2 Runtime error 735 ms 274432 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12624 KB Output is correct
2 Correct 4 ms 14032 KB Output is correct
3 Correct 3 ms 13392 KB Output is correct
4 Correct 4 ms 13648 KB Output is correct
5 Correct 4 ms 13136 KB Output is correct
6 Correct 3 ms 12880 KB Output is correct
7 Correct 3 ms 12880 KB Output is correct
8 Correct 3 ms 12984 KB Output is correct
9 Correct 4 ms 13136 KB Output is correct
10 Correct 3 ms 12992 KB Output is correct
11 Correct 4 ms 13136 KB Output is correct
12 Correct 3 ms 12880 KB Output is correct
13 Correct 3 ms 12880 KB Output is correct
14 Correct 3 ms 12880 KB Output is correct
15 Correct 3 ms 12880 KB Output is correct
16 Correct 3 ms 12880 KB Output is correct
17 Correct 3 ms 12880 KB Output is correct
18 Correct 3 ms 12880 KB Output is correct
19 Correct 6 ms 13904 KB Output is correct
20 Correct 5 ms 14076 KB Output is correct
21 Correct 5 ms 14160 KB Output is correct
22 Correct 4 ms 13648 KB Output is correct
23 Correct 5 ms 14328 KB Output is correct
24 Correct 4 ms 13904 KB Output is correct
25 Correct 5 ms 13904 KB Output is correct
26 Correct 3 ms 13136 KB Output is correct
27 Correct 5 ms 14416 KB Output is correct
28 Correct 4 ms 13816 KB Output is correct
29 Correct 5 ms 14160 KB Output is correct
30 Correct 3 ms 12880 KB Output is correct
31 Correct 3 ms 13060 KB Output is correct
32 Correct 4 ms 13904 KB Output is correct
33 Correct 74 ms 24452 KB Output is correct
34 Correct 88 ms 31108 KB Output is correct
35 Correct 19 ms 15708 KB Output is correct
36 Correct 122 ms 29240 KB Output is correct
37 Correct 161 ms 44788 KB Output is correct
38 Correct 151 ms 36668 KB Output is correct
39 Correct 123 ms 28596 KB Output is correct
40 Correct 130 ms 31032 KB Output is correct
41 Correct 151 ms 31288 KB Output is correct
42 Correct 153 ms 30008 KB Output is correct
43 Correct 87 ms 24236 KB Output is correct
44 Correct 176 ms 39480 KB Output is correct
45 Correct 155 ms 36020 KB Output is correct
46 Correct 165 ms 33212 KB Output is correct
47 Correct 86 ms 24500 KB Output is correct
48 Correct 175 ms 37940 KB Output is correct
49 Correct 151 ms 34228 KB Output is correct
50 Correct 462 ms 207068 KB Output is correct
51 Runtime error 735 ms 274432 KB Execution killed with signal 9
52 Halted 0 ms 0 KB -