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 "september.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
	vector<int> D(N);
	vector<int> vis(N), cur;
	for (int i = 1; i < N; i++) D[F[i]]++;
	int k = 0, cnt = 0, del = 0;
	for (int i = 0; i < N - 1; i++) {
		bool flag = false;
		for (int j = 0; j < M; j++) {
			vis[S[j][i]]++;
			cur.push_back(S[j][i]);
			if (j == M - 1) {
				if (vis[S[j][i]] != M) flag = true;
				cnt++;
			}
			if (vis[S[j][i]] == 1) {
				int now = S[j][i];
				while (now != -1 && D[now] == 0 && vis[now] >= 1) {
					D[F[now]]--;
					del++;
					now = F[now];
				}
			}
		}
		if (flag || cnt != del) continue;
		k++;
		for (auto x : cur) vis[x] = 0;
		cur.clear();
	}
	return k;
}
| # | 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... |