oj.uz

Submission #1046474

# Submission time Handle Problem Language Result Execution time Memory
1046474 2024-08-06T15:29:37 Z Trustfulcomic Beech Tree (IOI23_beechtree) C++17
0 / 100
 2000 ms 19272 KB 
#include "beechtree.h"

#include<bits/stdc++.h>
using namespace std;

int n,m;
vector<int> p,c;
vector<vector<int>> g;

int good(int r){
    vector<int> ch;
    queue<int> q; q.push(r);
    while(!q.empty()){
        int n = q.front(); q.pop();
        ch.push_back(n);
        for (int i : g[n]) q.push(i);
    }

    if (ch.size() == 1) return 1;
    
    bool jupi = false;
    do {
        vector<int> count(m, 0);
        vector<int> is(ch.size(), -1);
        is[0] = r;
        bool good = true;

        for (int i = 0; i<ch.size() && good; i++){
            if (ch[i] == r) continue;
            if (p[ch[i]] != is[count[c[ch[i]]]]) good = false;
            count[c[ch[i]]]++;
            is[i+1]=ch[i];
        }

        if (good){
            jupi = true;
        }

    } while(next_permutation(ch.begin(), ch.end()));

    if (jupi) return 1;
    return 0;
}

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

    vector<int> res(n);
    for (int i = 0; i<n; i++){
        res[i] = good(i);
    }
    return res;
}

Compilation message

beechtree.cpp: In function 'int good(int)':
beechtree.cpp:28:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         for (int i = 0; i<ch.size() && good; i++){
      |                         ~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 9.0

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

Subtask #2
0.0 / 5.0

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

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2067 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Execution timed out 2092 ms 19272 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

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

Subtask #6
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Runtime error 0 ms 348 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -

Subtask #7
0.0 / 12.0

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

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Runtime error 0 ms 348 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

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