oj.uz

Submission #403591

# Submission time Handle Problem Language Result Execution time Memory
403591 2021-05-13T09:51:32 Z lyc None (KOI18_family) C++14
44 / 100
 3000 ms 47820 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 inf = 1e9+5;

int K;

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

    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);
    }

    inline int lcd(int a, int b) {
        return dep[lca(a,b)];
    }
} 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 (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));
    }

    void reset() {
        v = inf;
        if (s == e) return;
        l->reset();
        r->reset();
    }
} *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();

    bool die = 0;

    root = new node(1,A.N);
    FOR(i,1,K){
        root->reset();
        FOR(j,1,K) if (j != i) {
            int a = A.lcd(i,j), b = B.lcd(i,j);
            root->update(a,b);
        }
        FOR(j,1,K) if (j != i) {
            int a = A.lcd(i,j), b = B.lcd(i,j);
            if (a < A.N) die |= b > root->qmin(a+1,A.N);
        }
    }

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

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47180 KB Output is correct
2 Correct 22 ms 47288 KB Output is correct
3 Correct 22 ms 47256 KB Output is correct
4 Correct 22 ms 47272 KB Output is correct
5 Correct 24 ms 47296 KB Output is correct
6 Correct 22 ms 47180 KB Output is correct
7 Correct 22 ms 47208 KB Output is correct
8 Correct 28 ms 47180 KB Output is correct
9 Correct 21 ms 47284 KB Output is correct
10 Correct 22 ms 47180 KB Output is correct
11 Correct 22 ms 47280 KB Output is correct
12 Correct 22 ms 47284 KB Output is correct
13 Correct 22 ms 47180 KB Output is correct
14 Correct 32 ms 47296 KB Output is correct
15 Correct 23 ms 47276 KB Output is correct
16 Correct 23 ms 47308 KB Output is correct
17 Correct 26 ms 47304 KB Output is correct
18 Correct 23 ms 47200 KB Output is correct
19 Correct 27 ms 47240 KB Output is correct
20 Correct 25 ms 47308 KB Output is correct
21 Correct 28 ms 47316 KB Output is correct
22 Correct 23 ms 47308 KB Output is correct
23 Correct 22 ms 47280 KB Output is correct
24 Correct 23 ms 47308 KB Output is correct
25 Correct 22 ms 47272 KB Output is correct
26 Correct 23 ms 47160 KB Output is correct
27 Correct 22 ms 47188 KB Output is correct
28 Correct 22 ms 47252 KB Output is correct
29 Correct 22 ms 47296 KB Output is correct
30 Correct 23 ms 47180 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47180 KB Output is correct
2 Correct 22 ms 47288 KB Output is correct
3 Correct 22 ms 47256 KB Output is correct
4 Correct 22 ms 47272 KB Output is correct
5 Correct 24 ms 47296 KB Output is correct
6 Correct 22 ms 47180 KB Output is correct
7 Correct 22 ms 47208 KB Output is correct
8 Correct 28 ms 47180 KB Output is correct
9 Correct 21 ms 47284 KB Output is correct
10 Correct 22 ms 47180 KB Output is correct
11 Correct 22 ms 47280 KB Output is correct
12 Correct 22 ms 47284 KB Output is correct
13 Correct 22 ms 47180 KB Output is correct
14 Correct 32 ms 47296 KB Output is correct
15 Correct 23 ms 47276 KB Output is correct
16 Correct 23 ms 47308 KB Output is correct
17 Correct 26 ms 47304 KB Output is correct
18 Correct 23 ms 47200 KB Output is correct
19 Correct 27 ms 47240 KB Output is correct
20 Correct 25 ms 47308 KB Output is correct
21 Correct 28 ms 47316 KB Output is correct
22 Correct 23 ms 47308 KB Output is correct
23 Correct 22 ms 47280 KB Output is correct
24 Correct 23 ms 47308 KB Output is correct
25 Correct 22 ms 47272 KB Output is correct
26 Correct 23 ms 47160 KB Output is correct
27 Correct 22 ms 47188 KB Output is correct
28 Correct 22 ms 47252 KB Output is correct
29 Correct 22 ms 47296 KB Output is correct
30 Correct 23 ms 47180 KB Output is correct
31 Correct 22 ms 47260 KB Output is correct
32 Correct 21 ms 47180 KB Output is correct
33 Correct 23 ms 47184 KB Output is correct
34 Correct 22 ms 47288 KB Output is correct
35 Correct 22 ms 47244 KB Output is correct
36 Correct 30 ms 47304 KB Output is correct
37 Correct 24 ms 47304 KB Output is correct
38 Correct 32 ms 47232 KB Output is correct
39 Correct 30 ms 47308 KB Output is correct
40 Correct 24 ms 47256 KB Output is correct
41 Correct 22 ms 47292 KB Output is correct
42 Correct 23 ms 47180 KB Output is correct
43 Correct 27 ms 47272 KB Output is correct
44 Correct 21 ms 47180 KB Output is correct
45 Correct 22 ms 47180 KB Output is correct
46 Correct 31 ms 47328 KB Output is correct
47 Correct 26 ms 47292 KB Output is correct
48 Correct 50 ms 47260 KB Output is correct
49 Correct 26 ms 47308 KB Output is correct
50 Correct 22 ms 47212 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47180 KB Output is correct
2 Correct 22 ms 47288 KB Output is correct
3 Correct 22 ms 47256 KB Output is correct
4 Correct 22 ms 47272 KB Output is correct
5 Correct 24 ms 47296 KB Output is correct
6 Correct 22 ms 47180 KB Output is correct
7 Correct 22 ms 47208 KB Output is correct
8 Correct 28 ms 47180 KB Output is correct
9 Correct 21 ms 47284 KB Output is correct
10 Correct 22 ms 47180 KB Output is correct
11 Correct 22 ms 47280 KB Output is correct
12 Correct 22 ms 47284 KB Output is correct
13 Correct 22 ms 47180 KB Output is correct
14 Correct 32 ms 47296 KB Output is correct
15 Correct 23 ms 47276 KB Output is correct
16 Correct 23 ms 47308 KB Output is correct
17 Correct 26 ms 47304 KB Output is correct
18 Correct 23 ms 47200 KB Output is correct
19 Correct 27 ms 47240 KB Output is correct
20 Correct 25 ms 47308 KB Output is correct
21 Correct 28 ms 47316 KB Output is correct
22 Correct 23 ms 47308 KB Output is correct
23 Correct 22 ms 47280 KB Output is correct
24 Correct 23 ms 47308 KB Output is correct
25 Correct 22 ms 47272 KB Output is correct
26 Correct 23 ms 47160 KB Output is correct
27 Correct 22 ms 47188 KB Output is correct
28 Correct 22 ms 47252 KB Output is correct
29 Correct 22 ms 47296 KB Output is correct
30 Correct 23 ms 47180 KB Output is correct
31 Correct 22 ms 47260 KB Output is correct
32 Correct 21 ms 47180 KB Output is correct
33 Correct 23 ms 47184 KB Output is correct
34 Correct 22 ms 47288 KB Output is correct
35 Correct 22 ms 47244 KB Output is correct
36 Correct 30 ms 47304 KB Output is correct
37 Correct 24 ms 47304 KB Output is correct
38 Correct 32 ms 47232 KB Output is correct
39 Correct 30 ms 47308 KB Output is correct
40 Correct 24 ms 47256 KB Output is correct
41 Correct 22 ms 47292 KB Output is correct
42 Correct 23 ms 47180 KB Output is correct
43 Correct 27 ms 47272 KB Output is correct
44 Correct 21 ms 47180 KB Output is correct
45 Correct 22 ms 47180 KB Output is correct
46 Correct 31 ms 47328 KB Output is correct
47 Correct 26 ms 47292 KB Output is correct
48 Correct 50 ms 47260 KB Output is correct
49 Correct 26 ms 47308 KB Output is correct
50 Correct 22 ms 47212 KB Output is correct
51 Execution timed out 3069 ms 47820 KB Time limit exceeded
52 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 47180 KB Output is correct
2 Correct 22 ms 47288 KB Output is correct
3 Correct 22 ms 47256 KB Output is correct
4 Correct 22 ms 47272 KB Output is correct
5 Correct 24 ms 47296 KB Output is correct
6 Correct 22 ms 47180 KB Output is correct
7 Correct 22 ms 47208 KB Output is correct
8 Correct 28 ms 47180 KB Output is correct
9 Correct 21 ms 47284 KB Output is correct
10 Correct 22 ms 47180 KB Output is correct
11 Correct 22 ms 47280 KB Output is correct
12 Correct 22 ms 47284 KB Output is correct
13 Correct 22 ms 47180 KB Output is correct
14 Correct 32 ms 47296 KB Output is correct
15 Correct 23 ms 47276 KB Output is correct
16 Correct 23 ms 47308 KB Output is correct
17 Correct 26 ms 47304 KB Output is correct
18 Correct 23 ms 47200 KB Output is correct
19 Correct 27 ms 47240 KB Output is correct
20 Correct 25 ms 47308 KB Output is correct
21 Correct 28 ms 47316 KB Output is correct
22 Correct 23 ms 47308 KB Output is correct
23 Correct 22 ms 47280 KB Output is correct
24 Correct 23 ms 47308 KB Output is correct
25 Correct 22 ms 47272 KB Output is correct
26 Correct 23 ms 47160 KB Output is correct
27 Correct 22 ms 47188 KB Output is correct
28 Correct 22 ms 47252 KB Output is correct
29 Correct 22 ms 47296 KB Output is correct
30 Correct 23 ms 47180 KB Output is correct
31 Correct 22 ms 47260 KB Output is correct
32 Correct 21 ms 47180 KB Output is correct
33 Correct 23 ms 47184 KB Output is correct
34 Correct 22 ms 47288 KB Output is correct
35 Correct 22 ms 47244 KB Output is correct
36 Correct 30 ms 47304 KB Output is correct
37 Correct 24 ms 47304 KB Output is correct
38 Correct 32 ms 47232 KB Output is correct
39 Correct 30 ms 47308 KB Output is correct
40 Correct 24 ms 47256 KB Output is correct
41 Correct 22 ms 47292 KB Output is correct
42 Correct 23 ms 47180 KB Output is correct
43 Correct 27 ms 47272 KB Output is correct
44 Correct 21 ms 47180 KB Output is correct
45 Correct 22 ms 47180 KB Output is correct
46 Correct 31 ms 47328 KB Output is correct
47 Correct 26 ms 47292 KB Output is correct
48 Correct 50 ms 47260 KB Output is correct
49 Correct 26 ms 47308 KB Output is correct
50 Correct 22 ms 47212 KB Output is correct
51 Execution timed out 3069 ms 47820 KB Time limit exceeded
52 Halted 0 ms 0 KB -