oj.uz

Submission #841423

# Submission time Handle Problem Language Result Execution time Memory
841423 2023-09-01T15:39:44 Z model_code Beech Tree (IOI23_beechtree) C++17
58 / 100
 2000 ms 700860 KB 
// correct/sol_db_mediumN.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];
    vector<pii> srt[N];
    map<int, vector<int>> col[N];
} graph;

bool check(int v, int u)
{
    for (auto &pr : graph.col[v])
    {
        auto &[col, vec] = pr;
        auto it = graph.col[u].find(col);
        if (it == graph.col[u].end() || graph.cnt[vec[0]] > graph.cnt[it->yy[0]])
        {
            return false;
        }
    }
    return true;
}

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

    for (auto &pr : graph.col[u])
    {
        auto &[col, vec] = pr;
        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;
            }
            for (pii p : graph.srt[v])
            {
                graph.srt[u].push_back(p);
            }
        }
    }
    graph.srt[u].push_back({graph.cnt[u], u});
    sort(all(graph.srt[u]));

    for (int i = 0; i < graph.srt[u].size() - 1; ++i)
    {
        graph.con[u] = graph.con[u] & check(graph.srt[u][i].yy, graph.srt[u][i + 1].yy);
    }
    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];
        if (!graph.col[p].count(c))
        {
            graph.col[p][c] = vector<int>();
        }
        graph.col[p][c].push_back(i);
    }
    dfs(0);

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

Compilation message

beechtree.cpp: In function 'int dfs(int)':
beechtree.cpp:66:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i = 0; i < graph.srt[u].size() - 1; ++i)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 10 ms 14292 KB Output is correct
3 Correct 7 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14328 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 7 ms 14292 KB Output is correct
9 Correct 8 ms 14292 KB Output is correct
10 Correct 7 ms 14356 KB Output is correct
11 Correct 9 ms 14292 KB Output is correct
12 Correct 7 ms 14388 KB Output is correct
13 Correct 8 ms 14292 KB Output is correct
14 Correct 7 ms 14292 KB Output is correct
15 Correct 8 ms 14384 KB Output is correct
16 Correct 7 ms 14276 KB Output is correct
17 Correct 8 ms 14292 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 9 ms 14292 KB Output is correct
20 Correct 7 ms 14372 KB Output is correct
21 Correct 7 ms 14340 KB Output is correct
22 Correct 7 ms 14292 KB Output is correct
23 Correct 7 ms 14344 KB Output is correct
24 Correct 7 ms 14292 KB Output is correct
25 Correct 10 ms 14292 KB Output is correct
26 Correct 8 ms 14408 KB Output is correct
27 Correct 8 ms 14324 KB Output is correct
28 Correct 8 ms 14388 KB Output is correct
29 Correct 7 ms 14284 KB Output is correct
30 Correct 7 ms 14400 KB Output is correct
31 Correct 7 ms 14372 KB Output is correct
32 Correct 7 ms 14292 KB Output is correct
33 Correct 8 ms 14296 KB Output is correct
34 Correct 8 ms 14292 KB Output is correct

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 10 ms 14292 KB Output is correct
3 Correct 7 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14328 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Execution timed out 2076 ms 247712 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 9 ms 14408 KB Output is correct
4 Correct 6 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 6 ms 14420 KB Output is correct
8 Correct 8 ms 14308 KB Output is correct
9 Correct 6 ms 14420 KB Output is correct
10 Correct 7 ms 14420 KB Output is correct
11 Correct 7 ms 14548 KB Output is correct
12 Correct 7 ms 14568 KB Output is correct
13 Correct 6 ms 14576 KB Output is correct
14 Correct 7 ms 14580 KB Output is correct
15 Correct 104 ms 34016 KB Output is correct
16 Correct 98 ms 32828 KB Output is correct
17 Correct 93 ms 33044 KB Output is correct
18 Correct 115 ms 33708 KB Output is correct

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 10 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Execution timed out 2076 ms 247712 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 10 ms 14292 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 7 ms 14292 KB Output is correct
8 Correct 8 ms 14328 KB Output is correct
9 Correct 7 ms 14292 KB Output is correct
10 Correct 9 ms 14292 KB Output is correct
11 Correct 7 ms 14292 KB Output is correct
12 Correct 8 ms 14292 KB Output is correct
13 Correct 7 ms 14356 KB Output is correct
14 Correct 9 ms 14292 KB Output is correct
15 Correct 7 ms 14388 KB Output is correct
16 Correct 8 ms 14292 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 8 ms 14384 KB Output is correct
19 Correct 7 ms 14276 KB Output is correct
20 Correct 8 ms 14292 KB Output is correct
21 Correct 7 ms 14292 KB Output is correct
22 Correct 9 ms 14292 KB Output is correct
23 Correct 7 ms 14372 KB Output is correct
24 Correct 7 ms 14340 KB Output is correct
25 Correct 7 ms 14292 KB Output is correct
26 Correct 7 ms 14344 KB Output is correct
27 Correct 7 ms 14292 KB Output is correct
28 Correct 10 ms 14292 KB Output is correct
29 Correct 8 ms 14408 KB Output is correct
30 Correct 8 ms 14324 KB Output is correct
31 Correct 8 ms 14388 KB Output is correct
32 Correct 7 ms 14284 KB Output is correct
33 Correct 7 ms 14400 KB Output is correct
34 Correct 7 ms 14372 KB Output is correct
35 Correct 7 ms 14292 KB Output is correct
36 Correct 8 ms 14296 KB Output is correct
37 Correct 8 ms 14292 KB Output is correct
38 Correct 7 ms 14420 KB Output is correct
39 Correct 7 ms 14420 KB Output is correct
40 Correct 9 ms 14408 KB Output is correct
41 Correct 6 ms 14420 KB Output is correct
42 Correct 7 ms 14420 KB Output is correct
43 Correct 7 ms 14420 KB Output is correct
44 Correct 6 ms 14420 KB Output is correct
45 Correct 8 ms 14308 KB Output is correct
46 Correct 6 ms 14420 KB Output is correct
47 Correct 7 ms 14420 KB Output is correct
48 Correct 8 ms 14676 KB Output is correct
49 Correct 10 ms 14588 KB Output is correct
50 Correct 8 ms 14676 KB Output is correct
51 Correct 10 ms 14596 KB Output is correct
52 Correct 8 ms 14424 KB Output is correct
53 Correct 7 ms 14420 KB Output is correct
54 Correct 7 ms 14428 KB Output is correct
55 Correct 8 ms 14324 KB Output is correct
56 Correct 7 ms 14420 KB Output is correct
57 Correct 6 ms 14420 KB Output is correct
58 Correct 6 ms 14392 KB Output is correct
59 Correct 7 ms 14368 KB Output is correct
60 Correct 6 ms 14420 KB Output is correct
61 Correct 6 ms 14420 KB Output is correct
62 Correct 7 ms 14420 KB Output is correct
63 Correct 8 ms 14420 KB Output is correct
64 Correct 7 ms 14412 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 10 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 7 ms 14356 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 7 ms 14388 KB Output is correct
9 Correct 8 ms 14292 KB Output is correct
10 Correct 7 ms 14292 KB Output is correct
11 Correct 8 ms 14384 KB Output is correct
12 Correct 7 ms 14276 KB Output is correct
13 Correct 8 ms 14292 KB Output is correct
14 Correct 7 ms 14292 KB Output is correct
15 Correct 9 ms 14292 KB Output is correct
16 Correct 7 ms 14372 KB Output is correct
17 Correct 7 ms 14340 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 7 ms 14344 KB Output is correct
20 Correct 7 ms 14292 KB Output is correct
21 Correct 10 ms 14292 KB Output is correct
22 Correct 8 ms 14408 KB Output is correct
23 Correct 8 ms 14324 KB Output is correct
24 Correct 8 ms 14388 KB Output is correct
25 Correct 63 ms 35028 KB Output is correct
26 Correct 114 ms 34988 KB Output is correct
27 Correct 144 ms 34932 KB Output is correct
28 Correct 203 ms 34984 KB Output is correct
29 Correct 58 ms 34912 KB Output is correct
30 Correct 16 ms 16852 KB Output is correct
31 Correct 9 ms 14932 KB Output is correct
32 Correct 9 ms 14932 KB Output is correct
33 Correct 14 ms 15184 KB Output is correct
34 Correct 8 ms 14804 KB Output is correct
35 Correct 9 ms 14888 KB Output is correct
36 Correct 10 ms 14804 KB Output is correct
37 Correct 22 ms 19992 KB Output is correct
38 Correct 14 ms 16940 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 10 ms 14292 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 7 ms 14292 KB Output is correct
8 Correct 8 ms 14328 KB Output is correct
9 Correct 7 ms 14292 KB Output is correct
10 Correct 9 ms 14292 KB Output is correct
11 Correct 7 ms 14292 KB Output is correct
12 Correct 8 ms 14292 KB Output is correct
13 Correct 7 ms 14356 KB Output is correct
14 Correct 9 ms 14292 KB Output is correct
15 Correct 7 ms 14388 KB Output is correct
16 Correct 8 ms 14292 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 8 ms 14384 KB Output is correct
19 Correct 7 ms 14276 KB Output is correct
20 Correct 8 ms 14292 KB Output is correct
21 Correct 7 ms 14292 KB Output is correct
22 Correct 9 ms 14292 KB Output is correct
23 Correct 7 ms 14372 KB Output is correct
24 Correct 7 ms 14340 KB Output is correct
25 Correct 7 ms 14292 KB Output is correct
26 Correct 7 ms 14344 KB Output is correct
27 Correct 7 ms 14292 KB Output is correct
28 Correct 10 ms 14292 KB Output is correct
29 Correct 8 ms 14408 KB Output is correct
30 Correct 8 ms 14324 KB Output is correct
31 Correct 8 ms 14388 KB Output is correct
32 Correct 7 ms 14284 KB Output is correct
33 Correct 7 ms 14400 KB Output is correct
34 Correct 7 ms 14372 KB Output is correct
35 Correct 7 ms 14292 KB Output is correct
36 Correct 8 ms 14296 KB Output is correct
37 Correct 8 ms 14292 KB Output is correct
38 Correct 8 ms 14676 KB Output is correct
39 Correct 10 ms 14588 KB Output is correct
40 Correct 8 ms 14676 KB Output is correct
41 Correct 10 ms 14596 KB Output is correct
42 Correct 7 ms 14420 KB Output is correct
43 Correct 7 ms 14420 KB Output is correct
44 Correct 9 ms 14408 KB Output is correct
45 Correct 6 ms 14420 KB Output is correct
46 Correct 7 ms 14420 KB Output is correct
47 Correct 7 ms 14420 KB Output is correct
48 Correct 6 ms 14420 KB Output is correct
49 Correct 8 ms 14308 KB Output is correct
50 Correct 6 ms 14420 KB Output is correct
51 Correct 7 ms 14420 KB Output is correct
52 Correct 7 ms 14548 KB Output is correct
53 Correct 7 ms 14568 KB Output is correct
54 Correct 6 ms 14576 KB Output is correct
55 Correct 7 ms 14580 KB Output is correct
56 Correct 8 ms 14424 KB Output is correct
57 Correct 7 ms 14420 KB Output is correct
58 Correct 7 ms 14428 KB Output is correct
59 Correct 8 ms 14324 KB Output is correct
60 Correct 7 ms 14420 KB Output is correct
61 Correct 6 ms 14420 KB Output is correct
62 Correct 6 ms 14392 KB Output is correct
63 Correct 7 ms 14368 KB Output is correct
64 Correct 6 ms 14420 KB Output is correct
65 Correct 6 ms 14420 KB Output is correct
66 Correct 7 ms 14420 KB Output is correct
67 Correct 8 ms 14420 KB Output is correct
68 Correct 7 ms 14412 KB Output is correct
69 Correct 63 ms 35028 KB Output is correct
70 Correct 114 ms 34988 KB Output is correct
71 Correct 144 ms 34932 KB Output is correct
72 Correct 203 ms 34984 KB Output is correct
73 Correct 58 ms 34912 KB Output is correct
74 Correct 16 ms 16852 KB Output is correct
75 Correct 9 ms 14932 KB Output is correct
76 Correct 9 ms 14932 KB Output is correct
77 Correct 14 ms 15184 KB Output is correct
78 Correct 8 ms 14804 KB Output is correct
79 Correct 9 ms 14888 KB Output is correct
80 Correct 10 ms 14804 KB Output is correct
81 Correct 22 ms 19992 KB Output is correct
82 Correct 14 ms 16940 KB Output is correct
83 Correct 53 ms 34968 KB Output is correct
84 Correct 115 ms 34984 KB Output is correct
85 Correct 186 ms 34980 KB Output is correct
86 Correct 198 ms 34976 KB Output is correct
87 Correct 14 ms 16220 KB Output is correct
88 Correct 11 ms 14804 KB Output is correct
89 Correct 27 ms 22360 KB Output is correct
90 Correct 11 ms 15956 KB Output is correct
91 Correct 8 ms 14804 KB Output is correct
92 Correct 9 ms 14912 KB Output is correct
93 Correct 12 ms 15188 KB Output is correct
94 Correct 9 ms 14804 KB Output is correct
95 Correct 12 ms 14804 KB Output is correct
96 Correct 9 ms 14728 KB Output is correct
97 Correct 23 ms 20008 KB Output is correct
98 Correct 16 ms 17044 KB Output is correct

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 10 ms 14292 KB Output is correct
3 Correct 9 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 7 ms 14356 KB Output is correct
7 Correct 9 ms 14292 KB Output is correct
8 Correct 7 ms 14388 KB Output is correct
9 Correct 8 ms 14292 KB Output is correct
10 Correct 7 ms 14292 KB Output is correct
11 Correct 8 ms 14384 KB Output is correct
12 Correct 7 ms 14276 KB Output is correct
13 Correct 8 ms 14292 KB Output is correct
14 Correct 7 ms 14292 KB Output is correct
15 Correct 9 ms 14292 KB Output is correct
16 Correct 7 ms 14372 KB Output is correct
17 Correct 7 ms 14340 KB Output is correct
18 Correct 7 ms 14292 KB Output is correct
19 Correct 7 ms 14344 KB Output is correct
20 Correct 7 ms 14292 KB Output is correct
21 Correct 10 ms 14292 KB Output is correct
22 Correct 8 ms 14408 KB Output is correct
23 Correct 8 ms 14324 KB Output is correct
24 Correct 8 ms 14388 KB Output is correct
25 Correct 63 ms 35028 KB Output is correct
26 Correct 114 ms 34988 KB Output is correct
27 Correct 144 ms 34932 KB Output is correct
28 Correct 203 ms 34984 KB Output is correct
29 Correct 58 ms 34912 KB Output is correct
30 Correct 16 ms 16852 KB Output is correct
31 Correct 9 ms 14932 KB Output is correct
32 Correct 9 ms 14932 KB Output is correct
33 Correct 14 ms 15184 KB Output is correct
34 Correct 8 ms 14804 KB Output is correct
35 Correct 9 ms 14888 KB Output is correct
36 Correct 10 ms 14804 KB Output is correct
37 Correct 22 ms 19992 KB Output is correct
38 Correct 14 ms 16940 KB Output is correct
39 Execution timed out 2089 ms 700860 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 6 ms 14292 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 10 ms 14292 KB Output is correct
6 Correct 7 ms 14292 KB Output is correct
7 Correct 7 ms 14292 KB Output is correct
8 Correct 8 ms 14328 KB Output is correct
9 Correct 7 ms 14292 KB Output is correct
10 Correct 9 ms 14292 KB Output is correct
11 Correct 7 ms 14292 KB Output is correct
12 Correct 8 ms 14292 KB Output is correct
13 Correct 7 ms 14356 KB Output is correct
14 Correct 9 ms 14292 KB Output is correct
15 Correct 7 ms 14388 KB Output is correct
16 Correct 8 ms 14292 KB Output is correct
17 Correct 7 ms 14292 KB Output is correct
18 Correct 8 ms 14384 KB Output is correct
19 Correct 7 ms 14276 KB Output is correct
20 Correct 8 ms 14292 KB Output is correct
21 Correct 7 ms 14292 KB Output is correct
22 Correct 9 ms 14292 KB Output is correct
23 Correct 7 ms 14372 KB Output is correct
24 Correct 7 ms 14340 KB Output is correct
25 Correct 7 ms 14292 KB Output is correct
26 Correct 7 ms 14344 KB Output is correct
27 Correct 7 ms 14292 KB Output is correct
28 Correct 10 ms 14292 KB Output is correct
29 Correct 8 ms 14408 KB Output is correct
30 Correct 8 ms 14324 KB Output is correct
31 Correct 8 ms 14388 KB Output is correct
32 Correct 7 ms 14284 KB Output is correct
33 Correct 7 ms 14400 KB Output is correct
34 Correct 7 ms 14372 KB Output is correct
35 Correct 7 ms 14292 KB Output is correct
36 Correct 8 ms 14296 KB Output is correct
37 Correct 8 ms 14292 KB Output is correct
38 Execution timed out 2076 ms 247712 KB Time limit exceeded
39 Halted 0 ms 0 KB -