Submission #1152077

#TimeUsernameProblemLanguageResultExecution timeMemory
1152077ElayV13September (APIO24_september)C++20
0 / 100
0 ms400 KiB
#include "september.h"
#include <bits/stdc++.h>
using namespace std;

const int MAX = 1e5 + 5;
const int inf = 1e9;

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

void dfs(int v)
{
      if(v == 0) return;
      if(idx[v] > cur){
            res++;
            cur = idx[v];
      }
      dfs(v - 1);
}

int solve(int N, int M, vector < int > F, vector < vector < int > > S){
      cur = -inf;
      idx.resize(N);
      NC = N;
      for(int i = 0;i <= N - 2;i++)
      {
            idx[S[0][i]] = i;
      }
      dfs(N - 1);
      return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...