oj.uz

답안 #1115933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115933 2024-11-21T05:26:06 Z _8_8_ Unique Cities (JOI19_ho_t5) C++17
36 / 100
 2000 ms 62008 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;
vector<int> e[N];
void bld(int v) {
    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) {
            it++;
            e[cur].push_back(it);
            ver[it] = v;
            gl[it] = gl[cur] + 1;
            up[it][0] = cur;
            for(int i = 1; i < b; i++) {
                up[it][i] = up[up[it][i - 1]][i - 1];
            }
            cur = it;
        }
        bld(to);
    }
    cur = bf;
}
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) {
            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) {
            it++;
            ver[it] = v;
            auto check = [&](){
                int f = cur;
                while(f) {
                    if(a[ver[f]] == a[v]) return 0;
                    f = up[f][0];
                }
                return 1;
            };
            gl[it] = gl[cur] + (check());
            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);

    // bld(root);

    it = cur = 0;

    go(root);

    for(int i = 0; i <= it; i++) {
        e[i].clear();
    }
}
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 3 ms 16976 KB Output is correct
2 Correct 5 ms 19024 KB Output is correct
3 Correct 5 ms 17232 KB Output is correct
4 Correct 6 ms 19280 KB Output is correct
5 Correct 5 ms 19280 KB Output is correct
6 Correct 5 ms 19280 KB Output is correct
7 Correct 5 ms 19280 KB Output is correct
8 Correct 5 ms 19280 KB Output is correct
9 Correct 5 ms 19280 KB Output is correct
10 Correct 5 ms 19280 KB Output is correct
11 Correct 5 ms 19280 KB Output is correct
12 Correct 4 ms 17232 KB Output is correct
13 Correct 6 ms 19280 KB Output is correct
14 Correct 5 ms 19452 KB Output is correct
15 Correct 5 ms 19280 KB Output is correct
16 Correct 4 ms 17232 KB Output is correct
17 Correct 5 ms 19280 KB Output is correct
18 Correct 5 ms 19396 KB Output is correct
19 Correct 4 ms 19448 KB Output is correct
20 Correct 12 ms 19380 KB Output is correct
21 Correct 6 ms 19280 KB Output is correct
22 Correct 5 ms 19280 KB Output is correct
23 Correct 5 ms 19308 KB Output is correct
24 Correct 5 ms 19280 KB Output is correct
25 Correct 5 ms 19280 KB Output is correct
26 Correct 4 ms 17232 KB Output is correct
27 Correct 10 ms 19448 KB Output is correct
28 Correct 8 ms 19280 KB Output is correct
29 Correct 7 ms 19280 KB Output is correct
30 Correct 4 ms 17232 KB Output is correct
31 Correct 6 ms 19428 KB Output is correct
32 Correct 7 ms 19280 KB Output is correct

Subtask #2
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 31620 KB Output is correct
2 Correct 162 ms 43912 KB Output is correct
3 Correct 27 ms 22096 KB Output is correct
4 Correct 250 ms 40320 KB Output is correct
5 Correct 307 ms 62008 KB Output is correct
6 Correct 231 ms 51000 KB Output is correct
7 Correct 141 ms 40372 KB Output is correct
8 Correct 171 ms 42356 KB Output is correct
9 Correct 185 ms 41784 KB Output is correct
10 Correct 164 ms 41532 KB Output is correct
11 Correct 80 ms 31148 KB Output is correct
12 Correct 238 ms 53672 KB Output is correct
13 Correct 227 ms 51124 KB Output is correct
14 Correct 204 ms 50356 KB Output is correct
15 Correct 91 ms 29336 KB Output is correct
16 Correct 225 ms 53152 KB Output is correct
17 Correct 214 ms 51348 KB Output is correct

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 132 ms 36068 KB Output is correct
2 Execution timed out 2045 ms 46064 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16976 KB Output is correct
2 Correct 5 ms 19024 KB Output is correct
3 Correct 5 ms 17232 KB Output is correct
4 Correct 6 ms 19280 KB Output is correct
5 Correct 5 ms 19280 KB Output is correct
6 Correct 5 ms 19280 KB Output is correct
7 Correct 5 ms 19280 KB Output is correct
8 Correct 5 ms 19280 KB Output is correct
9 Correct 5 ms 19280 KB Output is correct
10 Correct 5 ms 19280 KB Output is correct
11 Correct 5 ms 19280 KB Output is correct
12 Correct 4 ms 17232 KB Output is correct
13 Correct 6 ms 19280 KB Output is correct
14 Correct 5 ms 19452 KB Output is correct
15 Correct 5 ms 19280 KB Output is correct
16 Correct 4 ms 17232 KB Output is correct
17 Correct 5 ms 19280 KB Output is correct
18 Correct 5 ms 19396 KB Output is correct
19 Correct 4 ms 19448 KB Output is correct
20 Correct 12 ms 19380 KB Output is correct
21 Correct 6 ms 19280 KB Output is correct
22 Correct 5 ms 19280 KB Output is correct
23 Correct 5 ms 19308 KB Output is correct
24 Correct 5 ms 19280 KB Output is correct
25 Correct 5 ms 19280 KB Output is correct
26 Correct 4 ms 17232 KB Output is correct
27 Correct 10 ms 19448 KB Output is correct
28 Correct 8 ms 19280 KB Output is correct
29 Correct 7 ms 19280 KB Output is correct
30 Correct 4 ms 17232 KB Output is correct
31 Correct 6 ms 19428 KB Output is correct
32 Correct 7 ms 19280 KB Output is correct
33 Correct 103 ms 31620 KB Output is correct
34 Correct 162 ms 43912 KB Output is correct
35 Correct 27 ms 22096 KB Output is correct
36 Correct 250 ms 40320 KB Output is correct
37 Correct 307 ms 62008 KB Output is correct
38 Correct 231 ms 51000 KB Output is correct
39 Correct 141 ms 40372 KB Output is correct
40 Correct 171 ms 42356 KB Output is correct
41 Correct 185 ms 41784 KB Output is correct
42 Correct 164 ms 41532 KB Output is correct
43 Correct 80 ms 31148 KB Output is correct
44 Correct 238 ms 53672 KB Output is correct
45 Correct 227 ms 51124 KB Output is correct
46 Correct 204 ms 50356 KB Output is correct
47 Correct 91 ms 29336 KB Output is correct
48 Correct 225 ms 53152 KB Output is correct
49 Correct 214 ms 51348 KB Output is correct
50 Correct 132 ms 36068 KB Output is correct
51 Execution timed out 2045 ms 46064 KB Time limit exceeded
52 Halted 0 ms 0 KB -