oj.uz

Submission #684323

# Submission time Handle Problem Language Result Execution time Memory
684323 2023-01-20T22:06:34 Z stevancv Long Mansion (JOI17_long_mansion) C++14
25 / 100
 3000 ms 41008 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 11 ms 12176 KB Output is correct
3 Correct 18 ms 12360 KB Output is correct
4 Correct 7 ms 12244 KB Output is correct
5 Correct 7 ms 12244 KB Output is correct
6 Correct 8 ms 12124 KB Output is correct
7 Correct 9 ms 12232 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 11 ms 12176 KB Output is correct
3 Correct 18 ms 12360 KB Output is correct
4 Correct 7 ms 12244 KB Output is correct
5 Correct 7 ms 12244 KB Output is correct
6 Correct 8 ms 12124 KB Output is correct
7 Correct 9 ms 12232 KB Output is correct
8 Correct 96 ms 13644 KB Output is correct
9 Correct 95 ms 13628 KB Output is correct
10 Correct 100 ms 13908 KB Output is correct
11 Correct 107 ms 14136 KB Output is correct
12 Correct 91 ms 13852 KB Output is correct
13 Correct 92 ms 13912 KB Output is correct
14 Correct 97 ms 13904 KB Output is correct
15 Correct 93 ms 14032 KB Output is correct
16 Correct 92 ms 14100 KB Output is correct
17 Correct 92 ms 13880 KB Output is correct
18 Correct 94 ms 13868 KB Output is correct
19 Correct 92 ms 13960 KB Output is correct
20 Correct 94 ms 14028 KB Output is correct
21 Correct 92 ms 14188 KB Output is correct
22 Correct 93 ms 13968 KB Output is correct
23 Correct 98 ms 13728 KB Output is correct
24 Correct 98 ms 13896 KB Output is correct
25 Correct 98 ms 13736 KB Output is correct
26 Correct 98 ms 13656 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 718 ms 19236 KB Output is correct
2 Correct 1426 ms 19364 KB Output is correct
3 Correct 2842 ms 19376 KB Output is correct
4 Correct 942 ms 19296 KB Output is correct
5 Correct 1062 ms 19428 KB Output is correct
6 Correct 2940 ms 19408 KB Output is correct
7 Correct 125 ms 19488 KB Output is correct
8 Correct 128 ms 19484 KB Output is correct
9 Correct 131 ms 19532 KB Output is correct
10 Correct 126 ms 19548 KB Output is correct
11 Correct 130 ms 19532 KB Output is correct

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12244 KB Output is correct
2 Correct 11 ms 12176 KB Output is correct
3 Correct 18 ms 12360 KB Output is correct
4 Correct 7 ms 12244 KB Output is correct
5 Correct 7 ms 12244 KB Output is correct
6 Correct 8 ms 12124 KB Output is correct
7 Correct 9 ms 12232 KB Output is correct
8 Correct 96 ms 13644 KB Output is correct
9 Correct 95 ms 13628 KB Output is correct
10 Correct 100 ms 13908 KB Output is correct
11 Correct 107 ms 14136 KB Output is correct
12 Correct 91 ms 13852 KB Output is correct
13 Correct 92 ms 13912 KB Output is correct
14 Correct 97 ms 13904 KB Output is correct
15 Correct 93 ms 14032 KB Output is correct
16 Correct 92 ms 14100 KB Output is correct
17 Correct 92 ms 13880 KB Output is correct
18 Correct 94 ms 13868 KB Output is correct
19 Correct 92 ms 13960 KB Output is correct
20 Correct 94 ms 14028 KB Output is correct
21 Correct 92 ms 14188 KB Output is correct
22 Correct 93 ms 13968 KB Output is correct
23 Correct 98 ms 13728 KB Output is correct
24 Correct 98 ms 13896 KB Output is correct
25 Correct 98 ms 13736 KB Output is correct
26 Correct 98 ms 13656 KB Output is correct
27 Correct 718 ms 19236 KB Output is correct
28 Correct 1426 ms 19364 KB Output is correct
29 Correct 2842 ms 19376 KB Output is correct
30 Correct 942 ms 19296 KB Output is correct
31 Correct 1062 ms 19428 KB Output is correct
32 Correct 2940 ms 19408 KB Output is correct
33 Correct 125 ms 19488 KB Output is correct
34 Correct 128 ms 19484 KB Output is correct
35 Correct 131 ms 19532 KB Output is correct
36 Correct 126 ms 19548 KB Output is correct
37 Correct 130 ms 19532 KB Output is correct
38 Correct 210 ms 35448 KB Output is correct
39 Correct 221 ms 41008 KB Output is correct
40 Correct 194 ms 30028 KB Output is correct
41 Execution timed out 3061 ms 35980 KB Time limit exceeded
42 Halted 0 ms 0 KB -