oj.uz

Submission #856165

# Submission time Handle Problem Language Result Execution time Memory
856165 2023-10-02T18:26:19 Z Sorting Beech Tree (IOI23_beechtree) C++17
5 / 100
 62 ms 16432 KB 
#include "beechtree.h"
#include <algorithm>

using namespace std;

const int N = 2e5 + 3;

int n, m, c[N];
vector<int> adj[N];

std::vector<int> beechtree(int N, int M, std::vector<int> P, std::vector<int> C)
{
    n = N, m = M;
    copy(C.begin(), C.end(), c);
    for(int i = 1; i < n; ++i){
        adj[P[i]].push_back(i);
    }

    vector<int> ans;
    ans.push_back(1);
    int same = 0, col = -1;
    for(int i = n - 1; i > 0; --i){
        if(c[i] != col){
            same = 1;
            col = c[i];
        }
        else{
            ++same;
        }
        ans.push_back(same == n - i);
    }
    reverse(ans.begin(), ans.end());
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5464 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 9.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5468 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct
3 Correct 1 ms 5468 KB Output is correct
4 Correct 2 ms 5468 KB Output is correct
5 Correct 1 ms 5468 KB Output is correct
6 Correct 1 ms 5468 KB Output is correct
7 Correct 54 ms 16328 KB Output is correct
8 Correct 57 ms 16332 KB Output is correct
9 Correct 2 ms 5468 KB Output is correct
10 Correct 1 ms 5468 KB Output is correct
11 Correct 2 ms 5464 KB Output is correct
12 Correct 2 ms 5468 KB Output is correct
13 Correct 3 ms 5468 KB Output is correct
14 Correct 2 ms 5464 KB Output is correct
15 Correct 2 ms 5464 KB Output is correct
16 Correct 2 ms 5468 KB Output is correct
17 Correct 54 ms 16248 KB Output is correct
18 Correct 55 ms 16204 KB Output is correct
19 Correct 62 ms 16432 KB Output is correct
20 Correct 54 ms 16328 KB Output is correct

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5464 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

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

Subtask #5
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5464 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 14.0

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

Subtask #7
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5464 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 17.0

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

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 5464 KB 2nd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -