Submission #1179111

#TimeUsernameProblemLanguageResultExecution timeMemory
1179111stdfloatSeptember (APIO24_september)C++20
45 / 100
115 ms7872 KiB
#include <bits/stdc++.h> #include "september.h" // #include "stub.cpp" using namespace std; int solve(int n, int M, vector<int> F, vector<vector<int>> S) { assert(M == 1); vector<int> E[n]; for (int i = 1; i < n; i++) E[F[i]].push_back(i); vector<int> ind(n); for (int i = 0; i < n - 1; i++) ind[S[0][i]] = i; int cnt = 0, r = 0; for (int i = 0; i < n - 1; i++) { r = max(r, i); for (auto j : E[S[0][i]]) r = max(r, ind[j]); cnt += (i == r); } return cnt; }
#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...