oj.uz

Submission #841432

# Submission time Handle Problem Language Result Execution time Memory
841432 2023-09-01T15:40:02 Z model_code Beech Tree (IOI23_beechtree) C++17
22 / 100
 258 ms 80012 KB 
// incorrect/sol_db_wa2.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];
    map<int, vector<int>> col[N];
} graph;

bool check(int v, int u)
{
    if (graph.col[v].size() > graph.col[u].size() || graph.cnt[u] == graph.cnt[v] && graph.col[u].size() != graph.col[v].size())
        return false;
    for (auto &pr : graph.col[v])
    {
        auto &[col, vec] = pr;
        auto it = graph.col[u].find(col);
        if (it == graph.col[u].end())
        {
            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 (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;
            }
            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];
        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 'bool check(int, int)':
beechtree.cpp:24:83: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   24 |     if (graph.col[v].size() > graph.col[u].size() || graph.cnt[u] == graph.cnt[v] && graph.col[u].size() != graph.col[v].size())
      |                                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 13 ms 19068 KB Output is correct

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 10 ms 19060 KB Output is correct
4 Correct 10 ms 19028 KB Output is correct
5 Correct 9 ms 19028 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 13 ms 19040 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 9 ms 19028 KB Output is correct
10 Correct 10 ms 19048 KB Output is correct
11 Correct 10 ms 18980 KB Output is correct
12 Correct 10 ms 19028 KB Output is correct
13 Correct 10 ms 19028 KB Output is correct
14 Correct 9 ms 19028 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 10 ms 19076 KB Output is correct
17 Correct 10 ms 18992 KB Output is correct
18 Incorrect 9 ms 19028 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
19 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 10 ms 19060 KB Output is correct
4 Correct 10 ms 19028 KB Output is correct
5 Correct 9 ms 19028 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 114 ms 77484 KB Output is correct
8 Correct 123 ms 77504 KB Output is correct
9 Correct 10 ms 19028 KB Output is correct
10 Correct 13 ms 19092 KB Output is correct
11 Correct 10 ms 19028 KB Output is correct
12 Correct 10 ms 19028 KB Output is correct
13 Correct 11 ms 19668 KB Output is correct
14 Correct 17 ms 19620 KB Output is correct
15 Correct 15 ms 19608 KB Output is correct
16 Correct 11 ms 19668 KB Output is correct
17 Correct 139 ms 77516 KB Output is correct
18 Correct 153 ms 79992 KB Output is correct
19 Correct 121 ms 79996 KB Output is correct
20 Correct 121 ms 80012 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19040 KB Output is correct
2 Correct 12 ms 19040 KB Output is correct
3 Correct 10 ms 19040 KB Output is correct
4 Correct 12 ms 19040 KB Output is correct
5 Correct 9 ms 19040 KB Output is correct
6 Correct 9 ms 19040 KB Output is correct
7 Correct 10 ms 19104 KB Output is correct
8 Correct 9 ms 19040 KB Output is correct
9 Correct 13 ms 19048 KB Output is correct
10 Correct 13 ms 19040 KB Output is correct
11 Correct 13 ms 19424 KB Output is correct
12 Correct 12 ms 19296 KB Output is correct
13 Correct 11 ms 19356 KB Output is correct
14 Correct 11 ms 19404 KB Output is correct
15 Correct 130 ms 45384 KB Output is correct
16 Correct 153 ms 46104 KB Output is correct
17 Correct 160 ms 46432 KB Output is correct
18 Correct 158 ms 47312 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 13 ms 19040 KB Output is correct
4 Correct 10 ms 19028 KB Output is correct
5 Correct 114 ms 77484 KB Output is correct
6 Correct 123 ms 77504 KB Output is correct
7 Correct 9 ms 19040 KB Output is correct
8 Correct 11 ms 19032 KB Output is correct
9 Correct 19 ms 19500 KB Output is correct
10 Correct 15 ms 19496 KB Output is correct
11 Correct 184 ms 61804 KB Output is correct
12 Correct 258 ms 62024 KB Output is correct

Subtask #5
0.0 / 14.0

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

Subtask #6
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 13 ms 19040 KB Output is correct
4 Correct 10 ms 19028 KB Output is correct
5 Correct 9 ms 19028 KB Output is correct
6 Correct 10 ms 19048 KB Output is correct
7 Correct 10 ms 18980 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 10 ms 19028 KB Output is correct
10 Correct 9 ms 19028 KB Output is correct
11 Correct 10 ms 19028 KB Output is correct
12 Correct 10 ms 19076 KB Output is correct
13 Correct 10 ms 18992 KB Output is correct
14 Incorrect 9 ms 19028 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
15 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

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

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 11 ms 19028 KB Output is correct
3 Correct 13 ms 19040 KB Output is correct
4 Correct 10 ms 19028 KB Output is correct
5 Correct 9 ms 19028 KB Output is correct
6 Correct 10 ms 19048 KB Output is correct
7 Correct 10 ms 18980 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 10 ms 19028 KB Output is correct
10 Correct 9 ms 19028 KB Output is correct
11 Correct 10 ms 19028 KB Output is correct
12 Correct 10 ms 19076 KB Output is correct
13 Correct 10 ms 18992 KB Output is correct
14 Incorrect 9 ms 19028 KB 2nd lines differ - on the 1st token, expected: '0', found: '1'
15 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

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