Submission #1152040

#	Time	Username	Problem	Language	Result	Execution time	Memory
1152040		ElayV13	September (APIO24_september)	C++20	0 / 100	1095 ms	1114112 KiB

september

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

const int MAX = 1e5 + 5;

int res = 0 , NC;
vector < vector < int > > adj;
vector < int > FC;
vector < vector < int > > SC;
map < int , int > used;

void dfs(int v , int p)
{
      for(int i = 0;i <= NC - 2;i++)
      {
            if(SC[0][i] == v && !used[i]){
                  res++;
                  for(int j = i;j <= NC - 2;j++){
                        used[j] = 1;
                  }
            }
      }
      for(int u : adj[v]){
            if(u == p) continue;
            dfs(u , v);
      }
}

int solve(int N, int M, vector < int > F, vector < vector < int > > S){
      adj.resize(N);
      FC = F;
      SC = S;
      NC = N;
      for(int i = 1;i <= N - 1;i++){
            adj[F[i]].push_back(i);
            adj[i].push_back(F[i]);
      }
      dfs(0 , -1);
      return res;
}

• 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