제출 #1241376

#제출 시각아이디문제언어결과실행 시간메모리
1241376dosts참나무 (IOI23_beechtree)C++20
컴파일 에러
0 ms0 KiB
#include "beechtree.h"
#include <bits/stdc++.h>
//#define int long long
#define pii pair<int,int> 
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " << 
#define all(x) x.begin(),x.end()
using namespace std;

const int LIM = 2e5+1;
vector<pii> edges[LIM];
vi ans(LIM,0),C,P;
vi stuf;

void dfss(int node) {
    stuf.push_back(node);
    for (auto it : edges[node]) dfss(it.ff);
}

vi ctr(N,0);
int N;


int dfs(int node) {
    for (auto it : edges[node]) dfs(it.ff);
    if (edges[node].empty()) ans[node] = 1;
    else {
        if (ans[edges[node][0].ff] == 0) {
            ans[node] = 0;
        }
        else {
            ans[node] = 1;
            ans[node]&=ctr[edges[node][0].ss] == node;
        }
    }
    return ans[node];
}

std::vector<int> beechtree(int N_, int M, std::vector<int> P_, std::vector<int> C_)
{
    N = N_;
    P = P_,C = C_;
    ans.assign(N_,0);
    for (int i = 0;i<N;i++) edges[i].clear(); 
    vi v;
    for (auto it : C) v.push_back(it);
    sort(all(v));
    v.erase(unique(all(v)),v.end());
    for (auto& it : C) it = lower_bound(all(v),it)-v.begin();
    for (int i = 1;i<N;i++) {
        edges[P[i]].push_back({i,C[i]});
    }
    dfs(0);
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

beechtree.cpp:22:8: error: 'N' was not declared in this scope
   22 | vi ctr(N,0);
      |        ^