oj.uz

답안 #403523

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403523 2021-05-13T09:09:03 Z lyc 족보 (KOI18_family) C++14
0 / 100
 1 ms 1356 KB 
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)

//const int mxN = 3e5+5;
//const int mxK = 3e5+5;
const int mxN = 5005;
const int mxK = 5005;
const int inf = 1e9+5;

int K;

struct Tree {
    int N;
    vector<int> g[mxN];
    int pa[mxN][14];
    int lcd[mxK];
    int dep[mxN];

    int val[mxK][mxK];

    void read() {
        FOR(i,1,N){
            int P; cin >> P;
            g[P].push_back(i);
        }
    }

    void dfs(int u) {
        FOR(k,1,13) pa[u][k] = (pa[u][k-1] == -1 ? -1 : pa[pa[u][k-1]][k-1]);
        for (int& v : g[u]) {
            pa[v][0] = u;
            dep[v] = dep[u]+1;
            dfs(v);
        }
    }

    int lca(int a, int b) {
        if (dep[a] < dep[b]) swap(a,b);
        RFOR(k,13,0) if (pa[a][k] != -1 && dep[pa[a][k]] >= dep[b]) {
            a = pa[a][k];
        }
        if (a == b) return a;
        RFOR(k,13,0) if (pa[a][k] != pa[b][k]) {
            a = pa[a][k], b = pa[b][k];
        }
        return pa[a][0];
    }

    void run() {
        memset(pa,-1,sizeof pa);
        dep[0] = 0;
        dfs(0);

        FOR(i,1,K-1){
            lcd[i] = dep[lca(i,i+1)];
        }

        FOR(i,1,K-1){
            val[i][i] = lcd[i];
            FOR(j,i+1,K-1){
                val[i][j] = min(val[i][j-1], lcd[j]);
            }
        }
    }
} A, B;

struct node {
    int s, e, m, v;
    node *l, *r;
    node (int s, int e): s(s), e(e), m((s+e)/2), v(inf) {
        if (s != e) {
            l = new node(s,m);
            r = new node(m+1,e);
        }
    }

    void update(int a, int b) {
        if (s == e) { v = min(v,b); return; }
        if (a <= m) l->update(a,b);
        else r->update(a,b);
        v = min(l->v,r->v);
    }

    int qmin(int a, int b) {
        if (a > b) return inf;
        if (s == a && e == b) return v;
        if (b <= m) return l->qmin(a,b);
        if (a > m) return r->qmin(a,b);
        return min(l->qmin(a,m), r->qmin(m+1,b));
    }
} *root;

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin >> A.N >> B.N >> K;
    A.read();
    B.read();

    A.run();
    B.run();

    root = new node(1,A.N);
    FOR(i,1,K-1){
        FOR(j,i,K-1){
            root->update(A.val[i][j], B.val[i][j]);
        }
    }

    bool die = 0;
    FOR(i,1,K-1){
        FOR(j,i,K-1){
            die |= B.val[i][j] > root->qmin(A.val[i][j]+1, A.N);
        }
    }

    cout << (die ? "NO" : "YES") << '\n';
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1228 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Incorrect 1 ms 1100 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1228 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Incorrect 1 ms 1100 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1228 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Incorrect 1 ms 1100 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1228 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Incorrect 1 ms 1100 KB Output isn't correct
8 Halted 0 ms 0 KB -