# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70683 | Just_Solve_The_Problem | Long Mansion (JOI17_long_mansion) | C++11 | 3005 ms | 89992 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>
using namespace std;
const int N = (int)1e5 + 7;
int n;
int c[N];
vector < int > keys[N];
pair < int, int > lr[N];
int has[N];
main() {
scanf("%d", &n);
for (int i = 1; i < n; i++) {
scanf("%d", &c[i]);
}
for (int i = 1; i <= n; i++) {
int siz;
scanf("%d", &siz);
for (int j = 0; j < siz; j++) {
int x;
scanf("%d", &x);
keys[i].push_back(x);
}
lr[i] = {i, i};
}
for (int i = 1; i <= n; i++) {
int ok = 1;
for (int to : keys[i]) {
Compilation message (stderr)
# | 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... |