이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "september.h"
#include <bits/stdc++.h>
using namespace std;
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
vector<vector<int>> adj(N);
for (int i = 1; i < N; i++)
adj[F[i]].push_back(i);
vector<vector<int>> inv_S(M, vector<int>(N));
for (int i = 0; i < M; i++) {
for (int j = 0; j < N - 1; j++) {
inv_S[i][S[i][j]] = j;
}
}
vector<bool> visited(N);
auto dfs = [&](auto &&dfs, int record, int node) -> int {
if (visited[node])
return -1;
visited[node] = true;
int ans = inv_S[record][node];
for (auto x: adj[node])
ans = max(ans, dfs(dfs, record, x));
return ans;
};
int curr_l = 0, k = 0;
while (curr_l != N - 1) {
k++;
int curr_r = curr_l + 1;
for (; curr_l < curr_r; curr_l++) {
for (int i = 0; i < M; i++) {
curr_r = max(curr_r, dfs(dfs, i, S[i][curr_l]) + 1);
}
}
}
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... |