Submission #1152061

#	Time	Username	Problem	Language	Result	Execution time	Memory
1152061		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;
const int inf = 1e9;

int res = 0 , NC;
vector < vector < int > > adj;
vector < int > idx;
int cur = inf;

void dfs(int v ,int p)
{
      if(idx[v] < cur){
            res++;
            cur = idx[v];
      }
      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){
      idx.resize(N);
      adj.resize(N);
      for(int i = 1;i <= N - 1;i++){
            adj[i].push_back(F[i]);
            adj[F[i]].push_back(i);
      }
      NC = N;
      for(int i = 0;i <= N - 2;i++)
      {
            idx[S[0][i]] = i;
      }
      dfs(1 , -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