# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1121434 | ezzzay | September (APIO24_september) | C++17 | 132 ms | 37564 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int MN=1e6+5;
vector<int>v[MN];
bool vis[MN];
int par[MN];
int pos[MN];
int mx=-1;
void dfs(int a){
vis[a]=1;
mx=max(mx,pos[a]);
for(auto b:v[a]){
if(vis[b]==1)continue;
dfs(b);
}
}
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
mx=0;
for(int i=0;i<N;i++){
v[i].clear();
vis[i]=0;
}
for(int i=1;i<N;i++){
par[i]=F[i];
v[F[i]].pb(i);
}
int k=0;
for(int i=0;i<N-1;i++){
pos[S[0][i]]=i;
}
int i=0;
while(i<N-1){
bool u=0;
while(i<=mx){
int a=S[0][i];
if(vis[a]==0){
dfs(a);
}
i++;
u=1;
}
mx++;
k++;
}
return k;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |