Submission #1175538

#	Time	Username	Problem	Language	Result	Execution time	Memory
1175538		rafsanamin2020	September (APIO24_september)	C++20	100 / 100	158 ms	12680 KiB

september

#include <bits/stdc++.h>

using namespace std;

const int MAX = 1E6;
int maxidx = 0;

vector<vector<int>> idx;
vector<vector<int>> C_List;
vector<bool> visited;

void dfs(int n, int N, int M)
{
  if (visited[n])
  {
    return;
  }

  for (int i = 0; i < idx.size(); i++)
  {
    maxidx = max(maxidx, idx[i][n]);
  }

  for (int i = 0; i < C_List[n].size(); i++)
  {
    dfs(C_List[n][i], N, M);
  }

  visited[n] = true;
}

int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S)
{

  int ans = 0;
  maxidx = 0;

  idx = vector<vector<int>>(M, vector<int>(N));
  C_List = vector<vector<int>>(N);
  visited = vector<bool>(N, false);

  for (int i = 1; i < N; i++)
  {
    C_List[F[i]].push_back(i);
  }

  for (int i = 0; i < M; i++)
  {
    for (int j = 0; j < N - 1; j++)
    {
      idx[i][S[i][j]] = j;
    }
  }

  for (int i = 0; i < N - 1; i++)
  {
    for (int j = 0; j < M; j++)
    {
      dfs(S[j][i], N, M);
    }
    if (maxidx == i)
    {
      ans++;
    }
  }

  return ans;
};

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