Submission #1198531

#	Time	Username	Problem	Language	Result	Execution time	Memory
1198531		reyleigh	September (APIO24_september)	C++20	0 / 100	2 ms	5188 KiB

september

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

const int N = 2e5 + 7;
vector<int> g[N];
set<int> st;
bool vis[N];

void dfs(int u) {
  vis[u] = true;
  st.insert(u);
  for (auto v: g[u]) {
    if (!vis[v]) {
      dfs(v);
    }
  }
}

int solve(int n, int m, vector<int> f, vector<vector<int>> s) {
  for (int i = 1; i < n; i++) {
    g[f[i]].push_back(i);
  }
  int ans = 0;
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < n - 1; j++) {
      if (!vis[s[i][j]]) {
        if (st.empty()) ans++;
        dfs(s[i][j]);
      }
      st.erase(j);
    }
  }
  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