# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
909489 | IBory | Long Mansion (JOI17_long_mansion) | C++17 | 431 ms | 75992 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>
#define pii pair<int, int>
using namespace std;
const int MAX = 500005;
int C[MAX], L[MAX], R[MAX];
pii E[MAX];
vector<int> K[MAX];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int N, Q;
cin >> N;
for (int i = 1; i < N; ++i) cin >> C[i];
for (int i = 1; i <= N; ++i) {
int M;
cin >> M;
K[i].resize(M);
for (int& n : K[i]) cin >> n;
}
vector<int> in(N + 1);
for (int i = 1; i < N; ++i) {
for (int k : K[i]) in[k] = i;
L[i] = in[C[i]];
}
fill(in.begin(), in.end(), N + 1);
for (int i = N - 1; i > 0; --i) {
for (int k : K[i + 1]) in[k] = i + 1;
R[i] = in[C[i]];
# | 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... |