# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
538073 | fhvirus | Long Mansion (JOI17_long_mansion) | C++17 | 279 ms | 43384 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.
// jiaqiyang orz
// solution adapted from his/her submission
#include<bits/stdc++.h>
using namespace std;
const int kN = 500005;
int N, Q, C[kN], B[kN];
vector<int> A[kN];
int prv[kN], nxt[kN], occ[kN];
int lb[kN], rb[kN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> N;
for (int i = 1; i < N; ++i)
cin >> C[i];
for (int i = 1; i <= N; ++i) {
cin >> B[i];
A[i].resize(B[i]);
for (int& a: A[i])
cin >> a;
}
for (int i = 1; i < N; ++i) {
for (const int& a: A[i])
occ[a] = i;
prv[i] = occ[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... |