Submission #1152085

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

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

int solve(int N, int M, vector < int > F, vector < vector < int > > S){
      int res = 0;
      int req = N - 1;
      for(int i = 0;i <= N - 2;i++)
      {
            if(S[0][i] == req){
                  res++;
                  req--;
            }
      }
      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...