oj.uz

Submission #941258

# Submission time Handle Problem Language Result Execution time Memory
941258 2024-03-08T11:48:17 Z WanWan Beech Tree (IOI23_beechtree) C++17
0 / 100
 82 ms 27172 KB 
#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
const int MAXN = 200005;
const int inf=1000000500ll;
const long long oo =1000000000000000500ll;
const int MOD = (int)1e9+7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int> pi; 
int par[MAXN];
vector<int>childs[MAXN];
int st[MAXN],en[MAXN];
int TIME;
bool isleaf[MAXN];
bool child(int par, int child){
    if(st[par]<=st[child] && en[par]>=en[child])return 1;
    return 0;
}
void dfs(int x, int p){
    st[x]=TIME++;
    par[x]=p;
    isleaf[x]=1;
    for(auto v:childs[x]){
        isleaf[x]=0;
        dfs(v,x);
    }
    en[x]=TIME-1;
}
std::vector<int> beechtree(int n, int M, std::vector<int> P, std::vector<int> C)
{
    vector<int> res=vector<int>(n,0);
    for(int i=1;i<n;i++){
        childs[P[i]].push_back(i);
    }
    dfs(0,-1);
    for(int i=0;i<n;i++){ // check for this guy
        if(isleaf[i]){
            res[i]=1;
            continue;
        }
        int nonleafs=0;
        for(auto x:childs[i]){
            if(!isleaf[x])nonleafs++;
        }
        if(nonleafs>1){ 
            res[i]=0;
            continue;
        }
        int leaf=-1;
        for(auto x:childs[i]){
            if(!isleaf[x])leaf=x;
        }
        if(leaf == -1){
            // everyone is a leaf. just check that they are all different
            unordered_set<int>os;
            for(auto x:childs[i]){
                os.insert(C[x]);
            }
            if(os.size() == childs[i].size()){
                res[i]=1;
            } else{
                res[i]=0;
            }
        } else{
            // 1 leaf. 
            bool bad=0;
            vector<int> vs1;
            vector<int> vs2;
            for(auto x:childs[i]){
                vs1.push_back(C[x]);
            }
            for(auto x:childs[leaf]){
                if(!isleaf[x])bad=1;
                vs2.push_back(C[x]);
            }
            sort(vs1.begin(),vs1.end());
            sort(vs2.begin(),vs2.end());
            if(!bad && vs1==vs2){
                res[i]=1;
            }else{
                res[i]=0;
            }
        }
    }
    return res;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 9.0

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

Subtask #2
0.0 / 5.0

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

Subtask #3
0.0 / 9.0

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

Subtask #4
0.0 / 8.0

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

Subtask #5
0.0 / 14.0

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

Subtask #6
0.0 / 14.0

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

Subtask #7
0.0 / 12.0

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

Subtask #8
0.0 / 17.0

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

Subtask #9
0.0 / 12.0

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