제출 #1087538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1087538		veehj	9월 (APIO24_september)	C++17	0 / 100	1 ms	348 KiB

september

#include "september.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (ll) a.size()
#define all(x) (x).begin(), (x).end()
vector<int> vist, nchild, pa;
set<int> call, tagged;
vector<vector<int>> child;

void pop(int nw){
  if(nchild[nw]!=0 || nw==0) return;
  tagged.erase(nw);
  nchild[pa[nw]]--;
  pop(pa[nw]);
}

int solve(int n, int m, std::vector<int> f, std::vector<std::vector<int>> s) {
  int ans=0;
  pa=f;
  vist.assign(n, 0);
  nchild.assign(n, 0);
  call={}; tagged={};
  child.assign(n, vector<int>(0));
  for(int i=1; i<n; i++){
    child[pa[i]].pb(i);
    nchild[pa[i]]++;
  }
  for(int i=0; i<n-1; i++){
    for(int j=0; j<m; j++){
      vist[s[j][i]]++;
      if(vist[s[j][i]]!=m){ call.insert(s[j][i]); continue; }
      call.erase(s[j][i]);
      if(nchild[s[j][i]]==0) pop(s[j][i]);
      else tagged.insert(s[j][i]);
    }
    ans+=(tagged.empty() && call.empty());
  }
  return ans;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 5
• Subtask 4: 0 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16