#include "september.h"
#include<bits/stdc++.h>
using namespace std;
int rem=0;
struct tree{
vector<int>adj[100005];
int vis[100005];
void dfs_add(int u,int p=-1){
if(vis[u])return;
rem++;
vis[u]=1;
for(auto v:adj[u])dfs_add(v,u);
}
void remove(int u){
rem--;
}
}tr[10];
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
for(int i=0;i<M;i++){
for(int j=1;j<N;j++){
tr[i].adj[F[j]].push_back(j);
}
}
int ans=0;
for(int i=0;i<N-1;i++){
for(int j=0;j<M;j++){
tr[j].dfs_add(S[j][i]);
tr[j].remove(S[j][i]);
}
if(rem==0)ans++;
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
27224 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
27224 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
27484 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
27224 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
27484 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
27224 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
27484 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
27224 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
27484 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
27224 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |