oj.uz

Submission #841404

# Submission time Handle Problem Language Result Execution time Memory
841404 2023-09-01T15:39:07 Z model_code Beech Tree (IOI23_beechtree) C++17
31 / 100
 420 ms 109216 KB 
// correct/sol_db_twoColors.cpp

#include "beechtree.h"
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;
typedef pair<int, int> pii;
const int N = 2e5 + 1;

struct Graph
{
    int cnt[N];
    bool con[N];
    set<pii> srt[N];
    vector<int> adj[N][2];
} graph;

bool check(int v, int u)
{
    for (int c = 0; c < 2; ++c)
    {
        if (graph.adj[v][c].empty())
        {
            continue;
        }
        if (graph.adj[u][c].empty())
        {
            return false;
        }
        if (graph.cnt[graph.adj[v][c][0]] > graph.cnt[graph.adj[u][c][0]])
        {
            return false;
        }
    }
    return true;
}

bool insertAndCheck(set<pii> &srt, pii p)
{
    auto [it, st] = srt.insert(p);
    bool result = true;
    if (it != srt.begin())
    {
        result &= check(prev(it)->yy, it->yy);
    }
    if (next(it) != srt.end())
    {
        result &= check(it->yy, next(it)->yy);
    }
    return result;
}

int dfs(int u)
{
    graph.cnt[u] = 1;
    graph.con[u] = true;

    for (int c = 0; c < 2; ++c)
    {
        auto &vec = graph.adj[u][c];
        graph.con[u] &= vec.size() <= 1;

        for (int v : vec)
        {
            int cnv = dfs(v);
            if (cnv == -1)
            {
                graph.con[u] = false;
            }
            else
            {
                graph.cnt[u] += cnv;
            }
            if (graph.con[u])
            {
                if (graph.srt[v].size() > graph.srt[u].size())
                {
                    graph.srt[u].swap(graph.srt[v]);
                }
                for (pii p : graph.srt[v])
                {
                    graph.con[u] &= insertAndCheck(graph.srt[u], p);
                }
            }
        }
    }
    graph.con[u] &= insertAndCheck(graph.srt[u], {graph.cnt[u], u});
    return graph.con[u] ? graph.cnt[u] : -1;
}

vector<int> beechtree(int n, int m, vector<int> P, vector<int> C)
{
    for (int i = 1; i < n; ++i)
    {
        int p = P[i];
        int c = C[i];
        graph.adj[p][c - 1].push_back(i);
    }
    dfs(0);

    vector<int> ans;
    for (int i = 0; i < n; ++i)
        ans.push_back(graph.con[i]);
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Incorrect 8 ms 19028 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 9 ms 19028 KB Output is correct
3 Incorrect 10 ms 19028 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 9 ms 19028 KB Output is correct
3 Incorrect 10 ms 19028 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
4 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 19028 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 9 ms 19028 KB Output is correct
3 Correct 8 ms 19040 KB Output is correct
4 Correct 8 ms 18996 KB Output is correct
5 Runtime error 78 ms 50352 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Incorrect 8 ms 19028 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 9 ms 19028 KB Output is correct
3 Correct 8 ms 19040 KB Output is correct
4 Correct 8 ms 18996 KB Output is correct
5 Correct 11 ms 19052 KB Output is correct
6 Correct 10 ms 19084 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19012 KB Output is correct
9 Correct 9 ms 19008 KB Output is correct
10 Correct 10 ms 19028 KB Output is correct
11 Correct 9 ms 19032 KB Output is correct
12 Correct 8 ms 19028 KB Output is correct
13 Correct 9 ms 19064 KB Output is correct
14 Correct 11 ms 19028 KB Output is correct
15 Correct 9 ms 19040 KB Output is correct
16 Correct 8 ms 19040 KB Output is correct
17 Correct 9 ms 19008 KB Output is correct
18 Correct 10 ms 19028 KB Output is correct
19 Correct 9 ms 19028 KB Output is correct
20 Correct 7 ms 19028 KB Output is correct
21 Correct 9 ms 19028 KB Output is correct
22 Correct 8 ms 19028 KB Output is correct
23 Correct 9 ms 19156 KB Output is correct
24 Correct 11 ms 19040 KB Output is correct
25 Correct 9 ms 19552 KB Output is correct
26 Correct 9 ms 19552 KB Output is correct
27 Correct 8 ms 19552 KB Output is correct
28 Correct 11 ms 19548 KB Output is correct
29 Correct 9 ms 19552 KB Output is correct
30 Correct 9 ms 19292 KB Output is correct
31 Correct 10 ms 19540 KB Output is correct
32 Correct 11 ms 19412 KB Output is correct
33 Correct 11 ms 19384 KB Output is correct
34 Correct 13 ms 19668 KB Output is correct
35 Correct 9 ms 19412 KB Output is correct
36 Correct 10 ms 19284 KB Output is correct
37 Correct 10 ms 19412 KB Output is correct
38 Correct 9 ms 19284 KB Output is correct

Subtask #7
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Incorrect 8 ms 19028 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 9 ms 19028 KB Output is correct
3 Correct 8 ms 19040 KB Output is correct
4 Correct 8 ms 18996 KB Output is correct
5 Correct 11 ms 19052 KB Output is correct
6 Correct 10 ms 19084 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19012 KB Output is correct
9 Correct 9 ms 19008 KB Output is correct
10 Correct 10 ms 19028 KB Output is correct
11 Correct 9 ms 19032 KB Output is correct
12 Correct 8 ms 19028 KB Output is correct
13 Correct 9 ms 19064 KB Output is correct
14 Correct 11 ms 19028 KB Output is correct
15 Correct 9 ms 19040 KB Output is correct
16 Correct 8 ms 19040 KB Output is correct
17 Correct 9 ms 19008 KB Output is correct
18 Correct 10 ms 19028 KB Output is correct
19 Correct 9 ms 19028 KB Output is correct
20 Correct 7 ms 19028 KB Output is correct
21 Correct 9 ms 19028 KB Output is correct
22 Correct 8 ms 19028 KB Output is correct
23 Correct 9 ms 19156 KB Output is correct
24 Correct 11 ms 19040 KB Output is correct
25 Correct 9 ms 19552 KB Output is correct
26 Correct 9 ms 19552 KB Output is correct
27 Correct 8 ms 19552 KB Output is correct
28 Correct 11 ms 19548 KB Output is correct
29 Correct 9 ms 19552 KB Output is correct
30 Correct 9 ms 19292 KB Output is correct
31 Correct 10 ms 19540 KB Output is correct
32 Correct 11 ms 19412 KB Output is correct
33 Correct 11 ms 19384 KB Output is correct
34 Correct 13 ms 19668 KB Output is correct
35 Correct 9 ms 19412 KB Output is correct
36 Correct 10 ms 19284 KB Output is correct
37 Correct 10 ms 19412 KB Output is correct
38 Correct 9 ms 19284 KB Output is correct
39 Correct 114 ms 65012 KB Output is correct
40 Correct 100 ms 64964 KB Output is correct
41 Correct 95 ms 65056 KB Output is correct
42 Correct 94 ms 64936 KB Output is correct
43 Correct 126 ms 59204 KB Output is correct
44 Correct 113 ms 46404 KB Output is correct
45 Correct 393 ms 95432 KB Output is correct
46 Correct 279 ms 74100 KB Output is correct
47 Correct 194 ms 65028 KB Output is correct
48 Correct 143 ms 54016 KB Output is correct
49 Correct 103 ms 46020 KB Output is correct
50 Correct 420 ms 109216 KB Output is correct
51 Correct 291 ms 90688 KB Output is correct
52 Correct 209 ms 73412 KB Output is correct
53 Correct 172 ms 58140 KB Output is correct
54 Correct 121 ms 46180 KB Output is correct
55 Correct 108 ms 52132 KB Output is correct
56 Correct 114 ms 52652 KB Output is correct
57 Correct 88 ms 44236 KB Output is correct
58 Correct 88 ms 43412 KB Output is correct
59 Correct 115 ms 43364 KB Output is correct
60 Correct 98 ms 43296 KB Output is correct
61 Correct 89 ms 43316 KB Output is correct
62 Correct 102 ms 43292 KB Output is correct
63 Correct 154 ms 55588 KB Output is correct
64 Correct 107 ms 46632 KB Output is correct

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Incorrect 8 ms 19028 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
3 Halted 0 ms 0 KB -