Submission #1201736

#	Time	Username	Problem	Language	Result	Execution time	Memory
1201736		noop	September (APIO24_september)	C++20	45 / 100	74 ms	2496 KiB

september

#include <bits/stdc++.h>
using namespace std;
vector<int> g;
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
  g.resize(N,0);
  int ans=0;
  unordered_set<int> s;
  for (int i=1; i<N; i++){
    g[F[i]]++;
  }
  for (int i=0; i<S[0].size(); i++){
    if (g[S[0][i]]){
      s.insert(S[0][i]);
    }
    g[F[S[0][i]]]--;
    if (!g[F[S[0][i]]]){
      s.erase(F[S[0][i]]);
    }
    if (!s.size()){
      ans++;
    }
  }
  return ans;
}

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