oj.uz

Submission #684322

# Submission time Handle Problem Language Result Execution time Memory
684322 2023-01-20T22:05:47 Z stevancv Long Mansion (JOI17_long_mansion) C++14
10 / 100
 3000 ms 19412 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 5e5 + 2;
const int inf = 1e9;
int c[N], le[N], ri[N], l[N], r[N], lst[N];
vector<int> b[N];
bool Between(int L, int R, int x) {
    return L <= x && x <= R;
}
bool Can(int L, int R, int x) {
    return Between(L, R, le[x]) || Between(L, R, ri[x]);
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n; cin >> n;
    for (int i = 1; i < n; i++) cin >> c[i];
    for (int i = 1; i <= n; i++) {
        int sz; cin >> sz;
        b[i].resize(sz);
        for (int j = 0; j < sz; j++) cin >> b[i][j];
    }
    for (int i = 1; i < n; i++) {
        for (int j : b[i]) lst[j] = i;
        le[i] = lst[c[i]];
    }
    for (int i = 1; i <= n; i++) lst[i] = 0;
    for (int i = n; i > 1; i--) {
        for (int j : b[i]) lst[j] = i;
        ri[i - 1] = lst[c[i - 1]];
    }
    for (int i = 1; i <= n; i++) {
        l[i] = r[i] = i;
        while (1) {
            if (l[i] > 1 && Can(l[i], r[i], l[i] - 1)) {
                l[i] = l[l[i] - 1];
                smax(r[i], r[l[i]]);
            }
            else if (r[i] < n && Can(l[i], r[i], r[i])) r[i]++;
            else break;
        }
    }
    int q; cin >> q;
    while (q--) {
        int x, y;
        cin >> x >> y;
        if (Between(l[x], r[x], y)) cout << "YES" << en;
        else cout << "NO" << en;
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 9 ms 12244 KB Output is correct
3 Correct 17 ms 12364 KB Output is correct
4 Correct 9 ms 12248 KB Output is correct
5 Correct 10 ms 12244 KB Output is correct
6 Correct 10 ms 12244 KB Output is correct
7 Correct 10 ms 12168 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 9 ms 12244 KB Output is correct
3 Correct 17 ms 12364 KB Output is correct
4 Correct 9 ms 12248 KB Output is correct
5 Correct 10 ms 12244 KB Output is correct
6 Correct 10 ms 12244 KB Output is correct
7 Correct 10 ms 12168 KB Output is correct
8 Correct 106 ms 13728 KB Output is correct
9 Correct 97 ms 13616 KB Output is correct
10 Correct 97 ms 13832 KB Output is correct
11 Correct 131 ms 14116 KB Output is correct
12 Correct 89 ms 13832 KB Output is correct
13 Correct 92 ms 13868 KB Output is correct
14 Correct 96 ms 13972 KB Output is correct
15 Correct 92 ms 13936 KB Output is correct
16 Correct 94 ms 14120 KB Output is correct
17 Correct 95 ms 13928 KB Output is correct
18 Correct 115 ms 13900 KB Output is correct
19 Correct 90 ms 13896 KB Output is correct
20 Correct 91 ms 14056 KB Output is correct
21 Correct 95 ms 14140 KB Output is correct
22 Correct 94 ms 13872 KB Output is correct
23 Correct 98 ms 13764 KB Output is correct
24 Correct 96 ms 13740 KB Output is correct
25 Correct 97 ms 13772 KB Output is correct
26 Correct 119 ms 13716 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 733 ms 19260 KB Output is correct
2 Correct 1480 ms 19356 KB Output is correct
3 Correct 2891 ms 19412 KB Output is correct
4 Correct 989 ms 19392 KB Output is correct
5 Correct 1078 ms 19376 KB Output is correct
6 Execution timed out 3015 ms 19312 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 9 ms 12244 KB Output is correct
3 Correct 17 ms 12364 KB Output is correct
4 Correct 9 ms 12248 KB Output is correct
5 Correct 10 ms 12244 KB Output is correct
6 Correct 10 ms 12244 KB Output is correct
7 Correct 10 ms 12168 KB Output is correct
8 Correct 106 ms 13728 KB Output is correct
9 Correct 97 ms 13616 KB Output is correct
10 Correct 97 ms 13832 KB Output is correct
11 Correct 131 ms 14116 KB Output is correct
12 Correct 89 ms 13832 KB Output is correct
13 Correct 92 ms 13868 KB Output is correct
14 Correct 96 ms 13972 KB Output is correct
15 Correct 92 ms 13936 KB Output is correct
16 Correct 94 ms 14120 KB Output is correct
17 Correct 95 ms 13928 KB Output is correct
18 Correct 115 ms 13900 KB Output is correct
19 Correct 90 ms 13896 KB Output is correct
20 Correct 91 ms 14056 KB Output is correct
21 Correct 95 ms 14140 KB Output is correct
22 Correct 94 ms 13872 KB Output is correct
23 Correct 98 ms 13764 KB Output is correct
24 Correct 96 ms 13740 KB Output is correct
25 Correct 97 ms 13772 KB Output is correct
26 Correct 119 ms 13716 KB Output is correct
27 Correct 733 ms 19260 KB Output is correct
28 Correct 1480 ms 19356 KB Output is correct
29 Correct 2891 ms 19412 KB Output is correct
30 Correct 989 ms 19392 KB Output is correct
31 Correct 1078 ms 19376 KB Output is correct
32 Execution timed out 3015 ms 19312 KB Time limit exceeded
33 Halted 0 ms 0 KB -