제출 #1152073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1152073		ElayV13	September (APIO24_september)	C++20	0 / 100	0 ms	324 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 < int > idx;
int cur = inf;

void dfs(int v)
{
      if(v == NC) 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(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