oj.uz

Submission #841626

# Submission time Handle Problem Language Result Execution time Memory
841626 2023-09-01T18:49:21 Z Enchom Beech Tree (IOI23_beechtree) C++17
9 / 100
 2000 ms 247224 KB 
#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)
    {
        if (graph.srt[u][i].xx == graph.srt[u][i + 1].yy)
        {
            continue;
        }

        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:64: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]
   64 |     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 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 3 ms 15204 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Correct 3 ms 15192 KB Output is correct
8 Correct 3 ms 15448 KB Output is correct
9 Correct 3 ms 15192 KB Output is correct
10 Correct 3 ms 15192 KB Output is correct
11 Correct 3 ms 15192 KB Output is correct
12 Correct 3 ms 15196 KB Output is correct
13 Correct 3 ms 15192 KB Output is correct
14 Correct 3 ms 15196 KB Output is correct
15 Correct 3 ms 15192 KB Output is correct
16 Correct 3 ms 15196 KB Output is correct
17 Correct 3 ms 15192 KB Output is correct
18 Correct 3 ms 15192 KB Output is correct
19 Correct 3 ms 15192 KB Output is correct
20 Correct 3 ms 15192 KB Output is correct
21 Correct 3 ms 15192 KB Output is correct
22 Correct 3 ms 15192 KB Output is correct
23 Correct 3 ms 15192 KB Output is correct
24 Correct 3 ms 15192 KB Output is correct
25 Correct 3 ms 15192 KB Output is correct
26 Incorrect 3 ms 15192 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
27 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct
4 Correct 3 ms 15196 KB Output is correct
5 Correct 3 ms 15204 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Execution timed out 2052 ms 247224 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 15448 KB Output is correct
5 Correct 3 ms 15192 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Correct 3 ms 15192 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 3 ms 15192 KB Output is correct
10 Correct 3 ms 15196 KB Output is correct
11 Correct 4 ms 15448 KB Output is correct
12 Correct 4 ms 15452 KB Output is correct
13 Correct 3 ms 15448 KB Output is correct
14 Correct 4 ms 15448 KB Output is correct
15 Correct 96 ms 34472 KB Output is correct
16 Correct 89 ms 33472 KB Output is correct
17 Correct 88 ms 33736 KB Output is correct
18 Correct 94 ms 34248 KB Output is correct

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct
4 Correct 3 ms 15448 KB Output is correct
5 Execution timed out 2052 ms 247224 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct
4 Correct 3 ms 15192 KB Output is correct
5 Correct 3 ms 15192 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Correct 3 ms 15196 KB Output is correct
8 Correct 3 ms 15204 KB Output is correct
9 Correct 3 ms 15192 KB Output is correct
10 Correct 3 ms 15192 KB Output is correct
11 Correct 3 ms 15448 KB Output is correct
12 Correct 3 ms 15192 KB Output is correct
13 Correct 3 ms 15192 KB Output is correct
14 Correct 3 ms 15192 KB Output is correct
15 Correct 3 ms 15196 KB Output is correct
16 Correct 3 ms 15192 KB Output is correct
17 Correct 3 ms 15196 KB Output is correct
18 Correct 3 ms 15192 KB Output is correct
19 Correct 3 ms 15196 KB Output is correct
20 Correct 3 ms 15192 KB Output is correct
21 Correct 3 ms 15192 KB Output is correct
22 Correct 3 ms 15192 KB Output is correct
23 Correct 3 ms 15192 KB Output is correct
24 Correct 3 ms 15192 KB Output is correct
25 Correct 3 ms 15192 KB Output is correct
26 Correct 3 ms 15192 KB Output is correct
27 Correct 3 ms 15192 KB Output is correct
28 Correct 3 ms 15192 KB Output is correct
29 Incorrect 3 ms 15192 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
30 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct
4 Correct 3 ms 15448 KB Output is correct
5 Correct 3 ms 15192 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Correct 3 ms 15192 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 3 ms 15192 KB Output is correct
10 Correct 3 ms 15196 KB Output is correct
11 Correct 3 ms 15192 KB Output is correct
12 Correct 3 ms 15196 KB Output is correct
13 Correct 3 ms 15192 KB Output is correct
14 Correct 3 ms 15192 KB Output is correct
15 Correct 3 ms 15192 KB Output is correct
16 Correct 3 ms 15192 KB Output is correct
17 Correct 3 ms 15192 KB Output is correct
18 Correct 3 ms 15192 KB Output is correct
19 Correct 3 ms 15192 KB Output is correct
20 Correct 3 ms 15192 KB Output is correct
21 Correct 3 ms 15192 KB Output is correct
22 Incorrect 3 ms 15192 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
23 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct
4 Correct 3 ms 15192 KB Output is correct
5 Correct 3 ms 15192 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Correct 3 ms 15196 KB Output is correct
8 Correct 3 ms 15204 KB Output is correct
9 Correct 3 ms 15192 KB Output is correct
10 Correct 3 ms 15192 KB Output is correct
11 Correct 3 ms 15448 KB Output is correct
12 Correct 3 ms 15192 KB Output is correct
13 Correct 3 ms 15192 KB Output is correct
14 Correct 3 ms 15192 KB Output is correct
15 Correct 3 ms 15196 KB Output is correct
16 Correct 3 ms 15192 KB Output is correct
17 Correct 3 ms 15196 KB Output is correct
18 Correct 3 ms 15192 KB Output is correct
19 Correct 3 ms 15196 KB Output is correct
20 Correct 3 ms 15192 KB Output is correct
21 Correct 3 ms 15192 KB Output is correct
22 Correct 3 ms 15192 KB Output is correct
23 Correct 3 ms 15192 KB Output is correct
24 Correct 3 ms 15192 KB Output is correct
25 Correct 3 ms 15192 KB Output is correct
26 Correct 3 ms 15192 KB Output is correct
27 Correct 3 ms 15192 KB Output is correct
28 Correct 3 ms 15192 KB Output is correct
29 Incorrect 3 ms 15192 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
30 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct
4 Correct 3 ms 15448 KB Output is correct
5 Correct 3 ms 15192 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Correct 3 ms 15192 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 3 ms 15192 KB Output is correct
10 Correct 3 ms 15196 KB Output is correct
11 Correct 3 ms 15192 KB Output is correct
12 Correct 3 ms 15196 KB Output is correct
13 Correct 3 ms 15192 KB Output is correct
14 Correct 3 ms 15192 KB Output is correct
15 Correct 3 ms 15192 KB Output is correct
16 Correct 3 ms 15192 KB Output is correct
17 Correct 3 ms 15192 KB Output is correct
18 Correct 3 ms 15192 KB Output is correct
19 Correct 3 ms 15192 KB Output is correct
20 Correct 3 ms 15192 KB Output is correct
21 Correct 3 ms 15192 KB Output is correct
22 Incorrect 3 ms 15192 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
23 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 15192 KB Output is correct
3 Correct 3 ms 15192 KB Output is correct
4 Correct 3 ms 15192 KB Output is correct
5 Correct 3 ms 15192 KB Output is correct
6 Correct 3 ms 15192 KB Output is correct
7 Correct 3 ms 15196 KB Output is correct
8 Correct 3 ms 15204 KB Output is correct
9 Correct 3 ms 15192 KB Output is correct
10 Correct 3 ms 15192 KB Output is correct
11 Correct 3 ms 15448 KB Output is correct
12 Correct 3 ms 15192 KB Output is correct
13 Correct 3 ms 15192 KB Output is correct
14 Correct 3 ms 15192 KB Output is correct
15 Correct 3 ms 15196 KB Output is correct
16 Correct 3 ms 15192 KB Output is correct
17 Correct 3 ms 15196 KB Output is correct
18 Correct 3 ms 15192 KB Output is correct
19 Correct 3 ms 15196 KB Output is correct
20 Correct 3 ms 15192 KB Output is correct
21 Correct 3 ms 15192 KB Output is correct
22 Correct 3 ms 15192 KB Output is correct
23 Correct 3 ms 15192 KB Output is correct
24 Correct 3 ms 15192 KB Output is correct
25 Correct 3 ms 15192 KB Output is correct
26 Correct 3 ms 15192 KB Output is correct
27 Correct 3 ms 15192 KB Output is correct
28 Correct 3 ms 15192 KB Output is correct
29 Incorrect 3 ms 15192 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
30 Halted 0 ms 0 KB -