#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
//const ll mod = 1000000009;
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
ll dp[100000][2][2],dp2[100000][2][2];
vector<int> g[100000];
ll L[100000],R[100000];
long long place_police(vector<int> p, vector<long long> c, vector<long long> w){
  n=p.size()+1;
  rever(c);
  c.pb(0);
  rever(c);
  vector<ll> d(n);
  for(int i=0;i<n-1;i++){
    d[i+1]++;
    d[p[i]]++;
    g[p[i]].pb(i+1);
  }
  ll k=w.size();
  vector<ll> r(n);
  k=0;
  for(int i=0;i<n;i++){
    if(d[i]==1){
      r[i]=w[k];
      k++;
    }
  }
  auto dfs = [&](int v,auto dfs) -> void{
    vector<int> ch;
    for(auto e:g[v]){
      dfs(e,dfs);
      ch.pb(e);
    }
    if(ch.size()==0){
      L[v]=R[v]=v;
      dp[v][0][1]=dp[v][1][0]=dp[v][1][1]=inf;
      return;
    }
    else{
      L[v]=L[ch[0]];
      R[v]=R[ch.back()];
      for(int i=0;i<2;i++){
        for(int j=0;j<2;j++){
          dp[v][i][j]=inf;
          chmin(dp[v][i][j],dp[ch[0]][i][j]+c[ch[0]]);
          chmin(dp[v][i][j],dp[ch[0]][i^1][j^1]);
        }
      }
    }
    for(int i=1;i<ch.size();i++){
      for(int j=0;j<2;j++){
        for(int k=0;k<2;k++){
          dp2[v][j][k]=inf;
        }
      }
      //ch[i] を直接つなげる、つまり反転させる場合
      for(int j=0;j<2;j++){
        for(int k=0;k<2;k++){
          for(int l=0;l<2;l++){
            for(int h=0;h<2;h++){
              ll cost=dp[v][j][k]+dp[ch[i]][1^l][1^h];
              if(k==l&&i) cost+=r[R[ch[i-1]]];
              chmin(dp2[v][j][h],cost);
            }
          }
        }
      }
      //else
      for(int j=0;j<2;j++){
        for(int k=0;k<2;k++){
          for(int l=0;l<2;l++){
            for(int h=0;h<2;h++){
              ll cost=dp[v][j][k]+dp[ch[i]][l][h]+c[ch[i]];
              if(k==l&&i) cost+=r[R[ch[i-1]]];
              chmin(dp2[v][j][h],cost);
            }
          }
        }
      }
      swap(dp[v],dp2[v]);
    }
    if(v==0){
      dp[v][0][0]+=w.back();
      dp[v][1][1]+=w.back();
    }
  };
  dfs(0,dfs);
  ll ans=inf;
  for(int i=0;i<2;i++){
    for(int j=0;j<2;j++){
      chmin(ans,dp[0][i][j]);
    }
  }
  return ans;
}

answer.code: In function ‘long long int place_police(std::vector<int>, std::vector<long long int>, std::vector<long long int>)’:
answer.code:80:3: error: ‘n’ was not declared in this scope
   80 |   n=p.size()+1;
      |   ^