제출 #1334451

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

september

#include <bits/stdc++.h>
using namespace std;

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
  vector<vector<int>> C(N);
  for (uint x = 1; x < N; x++)
    C[F[x]].push_back(x);

  set<uint> removed, toberemoved;

  function<void(uint)> dfs = [&](uint n) {
    for (uint c: C[n]) {
      if (toberemoved.count(n) || removed.count(n)) continue;
      toberemoved.insert(n);
      dfs(c);
    }
  };

  uint K = 0;
  uint badfllstate = 0;
  map<uint, uint> FLL;
  for (uint i = 0; i < N - 1; i++) {
    for (uint x = 0; x < M; x++) {
      if (!FLL[S[x][i]]) {
        badfllstate++;
        if (toberemoved.count(S[x][i]))
          toberemoved.erase(S[x][i]);
        removed.insert(S[x][i]);
        dfs(S[x][i]);
      }

      FLL[S[x][i]]++;
      if (FLL[S[x][i]] == M) badfllstate--;
    }

    if (!badfllstate && toberemoved.empty()) {
      K++;
    }
  }

  return K;
}

• 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