Submission #1152058

#TimeUsernameProblemLanguageResultExecution timeMemory
1152058ElayV13September (APIO24_september)C++20
0 / 100
1 ms776 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 > FC; vector < vector < int > > SC; vector < int > idx; int cur = inf; void dfs(int v) { if(idx[v] < cur){ res++; cur = idx[v]; } if(v + 1 <= NC - 1) dfs(v + 1); } int solve(int N, int M, vector < int > F, vector < vector < int > > S){ idx.resize(N); FC = F; SC = S; NC = N; for(int i = 0;i <= N - 2;i++) { idx[S[0][i]] = i; } dfs(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...