提出 #35596646

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>
using mint = atcoder::modint998244353;
using namespace std;

typedef long long ll;
#define rep(i,a,n) for (ll i=a;i<(ll)n;i++)
#define per(i,a,n) for (ll i=n;i-->(ll)a;)

ll read(){ll r;scanf("%lld",&r);return r;}

const int PWR=22;

int fa[300010];
mint cnt[300010][PWR]; // cnt[u][从这向下dep] = 方案数
mint sum[300010][PWR]; // u的子一层 cnt之和

mint toroot(int u,int d,mint x){
  if(d==PWR)return 0;
  if(u==1){
    cnt[u][d]+=x;
    return x;
  }
  int v=fa[u]; // v->
  mint inc = x*(sum[v][d+1]-cnt[u][d]); // sum[v][d+1] = sum( cnt[...child][d+1])
  sum[v][d+1]+=x;
  cnt[u][d]  +=x;
  return toroot(v,d+1,inc);
}

int main(){
  int n = read();
  rep(i,2,n+1) fa[i]=read();
  mint ans=0;
  rep(k,1,n+1){
    ans+=toroot(k,0,1);
    printf("%d\n",ans.val());
  }
  return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘ll read()’:
./Main.cpp:10:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   10 | ll read(){ll r;scanf("%lld",&r);return r;}
      |                ~~~~~^~~~~~~~~~~

ジャッジ結果