oj.uz

답안 #684330

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
684330 2023-01-20T22:19:45 Z stevancv Long Mansion (JOI17_long_mansion) C++14
25 / 100
 3000 ms 40928 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 = 0; j < b[i].size(); j++) lst[b[i][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 = 0; j < b[i].size(); j++) lst[b[i][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;
}

Compilation message

long_mansion.cpp: In function 'int main()':
long_mansion.cpp:31:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         for (int j = 0; j < b[i].size(); j++) lst[b[i][j]] = i;
      |                         ~~^~~~~~~~~~~~~
long_mansion.cpp:36:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for (int j = 0; j < b[i].size(); j++) lst[b[i][j]] = i;
      |                         ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12244 KB Output is correct
2 Correct 10 ms 12244 KB Output is correct
3 Correct 16 ms 12320 KB Output is correct
4 Correct 9 ms 12244 KB Output is correct
5 Correct 9 ms 12244 KB Output is correct
6 Correct 9 ms 12132 KB Output is correct
7 Correct 8 ms 12244 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12244 KB Output is correct
2 Correct 10 ms 12244 KB Output is correct
3 Correct 16 ms 12320 KB Output is correct
4 Correct 9 ms 12244 KB Output is correct
5 Correct 9 ms 12244 KB Output is correct
6 Correct 9 ms 12132 KB Output is correct
7 Correct 8 ms 12244 KB Output is correct
8 Correct 99 ms 13856 KB Output is correct
9 Correct 92 ms 13636 KB Output is correct
10 Correct 105 ms 13820 KB Output is correct
11 Correct 119 ms 14108 KB Output is correct
12 Correct 86 ms 13900 KB Output is correct
13 Correct 94 ms 13964 KB Output is correct
14 Correct 88 ms 13936 KB Output is correct
15 Correct 91 ms 14024 KB Output is correct
16 Correct 98 ms 14132 KB Output is correct
17 Correct 91 ms 13868 KB Output is correct
18 Correct 95 ms 13900 KB Output is correct
19 Correct 92 ms 13888 KB Output is correct
20 Correct 93 ms 14020 KB Output is correct
21 Correct 90 ms 14132 KB Output is correct
22 Correct 91 ms 13900 KB Output is correct
23 Correct 107 ms 13780 KB Output is correct
24 Correct 92 ms 13728 KB Output is correct
25 Correct 96 ms 13800 KB Output is correct
26 Correct 95 ms 13696 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 659 ms 19292 KB Output is correct
2 Correct 1197 ms 19412 KB Output is correct
3 Correct 2459 ms 19408 KB Output is correct
4 Correct 868 ms 19324 KB Output is correct
5 Correct 977 ms 19288 KB Output is correct
6 Correct 2484 ms 19336 KB Output is correct
7 Correct 133 ms 19436 KB Output is correct
8 Correct 132 ms 19528 KB Output is correct
9 Correct 148 ms 19644 KB Output is correct
10 Correct 140 ms 19516 KB Output is correct
11 Correct 125 ms 19500 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12244 KB Output is correct
2 Correct 10 ms 12244 KB Output is correct
3 Correct 16 ms 12320 KB Output is correct
4 Correct 9 ms 12244 KB Output is correct
5 Correct 9 ms 12244 KB Output is correct
6 Correct 9 ms 12132 KB Output is correct
7 Correct 8 ms 12244 KB Output is correct
8 Correct 99 ms 13856 KB Output is correct
9 Correct 92 ms 13636 KB Output is correct
10 Correct 105 ms 13820 KB Output is correct
11 Correct 119 ms 14108 KB Output is correct
12 Correct 86 ms 13900 KB Output is correct
13 Correct 94 ms 13964 KB Output is correct
14 Correct 88 ms 13936 KB Output is correct
15 Correct 91 ms 14024 KB Output is correct
16 Correct 98 ms 14132 KB Output is correct
17 Correct 91 ms 13868 KB Output is correct
18 Correct 95 ms 13900 KB Output is correct
19 Correct 92 ms 13888 KB Output is correct
20 Correct 93 ms 14020 KB Output is correct
21 Correct 90 ms 14132 KB Output is correct
22 Correct 91 ms 13900 KB Output is correct
23 Correct 107 ms 13780 KB Output is correct
24 Correct 92 ms 13728 KB Output is correct
25 Correct 96 ms 13800 KB Output is correct
26 Correct 95 ms 13696 KB Output is correct
27 Correct 659 ms 19292 KB Output is correct
28 Correct 1197 ms 19412 KB Output is correct
29 Correct 2459 ms 19408 KB Output is correct
30 Correct 868 ms 19324 KB Output is correct
31 Correct 977 ms 19288 KB Output is correct
32 Correct 2484 ms 19336 KB Output is correct
33 Correct 133 ms 19436 KB Output is correct
34 Correct 132 ms 19528 KB Output is correct
35 Correct 148 ms 19644 KB Output is correct
36 Correct 140 ms 19516 KB Output is correct
37 Correct 125 ms 19500 KB Output is correct
38 Correct 217 ms 35504 KB Output is correct
39 Correct 265 ms 40928 KB Output is correct
40 Correct 194 ms 30008 KB Output is correct
41 Execution timed out 3068 ms 35804 KB Time limit exceeded
42 Halted 0 ms 0 KB -