oj.uz

Submission #841441

# Submission time Handle Problem Language Result Execution time Memory
841441 2023-09-01T15:40:16 Z model_code Beech Tree (IOI23_beechtree) C++17
14 / 100
 182 ms 69928 KB 
// incorrect/solution-1-wa.cpp

#include "beechtree.h"

#include <map>
#include <set>
#include <algorithm>

using namespace std;
using pii = pair<int, int>;

int n;
vector<int> par, col, sz;
vector<map<int, int>> ch;
vector<int> t;
vector<set<pii>> ord;

bool comp(int x, int y)
{
    for (auto [c, sx] : ch[x])
    {
        if (!ch[y].count(c))
            return false;
        int sy = ch[y][c];
        if (sz[sx] > sz[sy])
            return false;
    }
    return true;
}

bool merge(int u, int v)
{
    if (ord[u].size() < ord[v].size())
    {
        swap(ord[u], ord[v]);
    }
    for (auto [s, x] : ord[v])
    {
        auto [it, b] = ord[u].insert({s, x});
        if (it != ord[u].begin() && !comp(prev(it)->second, it->second))
            return false;
        if (next(it) != ord[u].end() && !comp(it->second, next(it)->second))
            return false;
    }
    return true;
}

void dfs(int u)
{
    ord[u].insert({sz[u], u});
    for (auto [c, v] : ch[u])
    {
        dfs(v);
        if (t[v] == 0 || !merge(u, v))
        {
            t[u] = 0;
        }
    }
}

std::vector<int> beechtree(int N, int /*M*/, std::vector<int> P, std::vector<int> C)
{
    n = N, par = P, col = C;
    sz.assign(n, 1);
    ch.resize(n), ord.resize(n);
    t.assign(n, 1);
    for (int v = n - 1; v > 0; --v)
    {
        int u = par[v];
        sz[u] += sz[v];
        if (ch[u].count(col[v]))
        {
            t[u] = 0;
        }
        ch[u][col[v]] = v;
    }
    dfs(0);

    return t;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 220 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 1 ms 248 KB Output is correct

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 228 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 1 ms 228 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 228 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 228 KB Output is correct
9 Correct 0 ms 228 KB Output is correct
10 Correct 1 ms 228 KB Output is correct
11 Correct 1 ms 228 KB Output is correct
12 Correct 1 ms 228 KB Output is correct
13 Correct 1 ms 228 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 260 KB Output is correct
18 Correct 0 ms 236 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Incorrect 0 ms 212 KB 2nd lines differ - on the 5th token, expected: '0', found: '1'
24 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 228 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 1 ms 228 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 228 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 111 ms 60520 KB Output is correct
8 Correct 93 ms 60460 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 182 ms 69928 KB Output is correct
18 Correct 140 ms 66712 KB Output is correct
19 Correct 134 ms 62060 KB Output is correct
20 Correct 113 ms 63000 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 268 KB Output is correct
2 Correct 1 ms 216 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 224 KB Output is correct
5 Correct 1 ms 216 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 268 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 260 KB Output is correct
10 Correct 1 ms 216 KB Output is correct
11 Correct 3 ms 560 KB Output is correct
12 Correct 3 ms 608 KB Output is correct
13 Correct 2 ms 584 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 158 ms 34196 KB Output is correct
16 Correct 152 ms 31976 KB Output is correct
17 Correct 153 ms 32500 KB Output is correct
18 Correct 166 ms 33448 KB Output is correct

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 228 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 228 KB Output is correct
5 Correct 111 ms 60520 KB Output is correct
6 Correct 93 ms 60460 KB Output is correct
7 Incorrect 1 ms 216 KB 2nd lines differ - on the 32nd token, expected: '0', found: '1'
8 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 220 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 1 ms 248 KB Output is correct
4 Correct 1 ms 228 KB Output is correct
5 Correct 1 ms 228 KB Output is correct
6 Correct 1 ms 228 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 228 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 228 KB Output is correct
12 Correct 0 ms 228 KB Output is correct
13 Correct 1 ms 228 KB Output is correct
14 Correct 1 ms 228 KB Output is correct
15 Correct 1 ms 228 KB Output is correct
16 Correct 1 ms 228 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 260 KB Output is correct
21 Correct 0 ms 236 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Incorrect 0 ms 212 KB 2nd lines differ - on the 5th token, expected: '0', found: '1'
27 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 228 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 228 KB Output is correct
5 Correct 0 ms 228 KB Output is correct
6 Correct 1 ms 228 KB Output is correct
7 Correct 1 ms 228 KB Output is correct
8 Correct 1 ms 228 KB Output is correct
9 Correct 1 ms 228 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 260 KB Output is correct
14 Correct 0 ms 236 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Incorrect 0 ms 212 KB 2nd lines differ - on the 5th token, expected: '0', found: '1'
20 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 220 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 1 ms 248 KB Output is correct
4 Correct 1 ms 228 KB Output is correct
5 Correct 1 ms 228 KB Output is correct
6 Correct 1 ms 228 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 228 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 228 KB Output is correct
12 Correct 0 ms 228 KB Output is correct
13 Correct 1 ms 228 KB Output is correct
14 Correct 1 ms 228 KB Output is correct
15 Correct 1 ms 228 KB Output is correct
16 Correct 1 ms 228 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 260 KB Output is correct
21 Correct 0 ms 236 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Incorrect 0 ms 212 KB 2nd lines differ - on the 5th token, expected: '0', found: '1'
27 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 228 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 228 KB Output is correct
5 Correct 0 ms 228 KB Output is correct
6 Correct 1 ms 228 KB Output is correct
7 Correct 1 ms 228 KB Output is correct
8 Correct 1 ms 228 KB Output is correct
9 Correct 1 ms 228 KB Output is correct
10 Correct 1 ms 292 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 260 KB Output is correct
14 Correct 0 ms 236 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Incorrect 0 ms 212 KB 2nd lines differ - on the 5th token, expected: '0', found: '1'
20 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 220 KB Output is correct
2 Correct 1 ms 228 KB Output is correct
3 Correct 1 ms 248 KB Output is correct
4 Correct 1 ms 228 KB Output is correct
5 Correct 1 ms 228 KB Output is correct
6 Correct 1 ms 228 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 228 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 228 KB Output is correct
12 Correct 0 ms 228 KB Output is correct
13 Correct 1 ms 228 KB Output is correct
14 Correct 1 ms 228 KB Output is correct
15 Correct 1 ms 228 KB Output is correct
16 Correct 1 ms 228 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 260 KB Output is correct
21 Correct 0 ms 236 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Incorrect 0 ms 212 KB 2nd lines differ - on the 5th token, expected: '0', found: '1'
27 Halted 0 ms 0 KB -