oj.uz

Submission #1083492

# Submission time Handle Problem Language Result Execution time Memory
1083492 2024-09-03T10:26:30 Z SamueleVid Beech Tree (IOI23_beechtree) C++17
0 / 100
 2000 ms 9852 KB 
#include <bits/stdc++.h>
using namespace std;

constexpr int MAXN = 2e5 + 5;
constexpr int MAXM = 2e5 + 5;

int depth[MAXN];
vector<int> adj[MAXN];
vector<int> P;
vector<int> C;
set<int> colori_prof[3];
int numero[3];

void dfs(int u) {
    colori_prof[depth[u]].insert(C[u]);
    numero[depth[u]] ++;

    for (auto x : adj[u]) {
        if (x == P[u]) continue;
        depth[x] = depth[u] + 1;
        dfs(x);
    }
}

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C) {
    :: P = P;
    :: C = C;

    for (int i = 1; i < N; i ++) {
        adj[P[i]].push_back(i);
        adj[i].push_back(P[i]);
    }

    dfs(0);

    vector<int> res(N, 1);
    
    bool same_as_parent = false;
    for (int i = 1; i < N; i ++) {
        if (P[i] == 0) continue;
        if (C[i] == C[P[i]]) same_as_parent = true;
    }

    if (colori_prof[2].size() == 1 && colori_prof[1].size() == numero[1] && same_as_parent) {
        res[0] = 1;
    }
    else {
        res[0] = 0;
    }
 
    return res;
}

Compilation message

beechtree.cpp: In function 'std::vector<int> beechtree(int, int, std::vector<int>, std::vector<int>)':
beechtree.cpp:44:61: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |     if (colori_prof[2].size() == 1 && colori_prof[1].size() == numero[1] && same_as_parent) {
      |                                       ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Runtime error 6 ms 9852 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Execution timed out 2067 ms 4956 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Execution timed out 2067 ms 4956 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

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

Subtask #4
0.0 / 8.0

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

Subtask #5
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Runtime error 6 ms 9852 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

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

Subtask #7
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Runtime error 6 ms 9852 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

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

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Runtime error 6 ms 9852 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -