Submission #1201750

#TimeUsernameProblemLanguageResultExecution timeMemory
1201750noopSeptember (APIO24_september)C++20
45 / 100
69 ms2496 KiB
#include <bits/stdc++.h> using namespace std; vector<int> g; vector<bool> s; int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) { g.resize(N,0); s.resize(N,0); int ans=0,t=0,c,p; for (int i=1; i<N; i++){ g[F[i]]++; } for (int i=0; i<S[0].size(); i++){ c=S[0][i]; if (g[c]){ t++; s[c]=1; } p=F[c]; g[p]--; if (!g[p] and s[p]){ t--; s[p]=0; } if (!t){ ans++; } } return ans; }
#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...