oj.uz

답안 #889265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889265 2023-12-19T09:23:00 Z dimashhh Long Mansion (JOI17_long_mansion) C++17
25 / 100
 527 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 12, MOD = 998244353;
typedef long long ll;

int n,q,c[N],b[N];
vector<array<int,3>> res(N);
vector<int> a[N];
int used[N],timer = 0;
unordered_map<int,int> is[N];
vector<pair<int,int>> all;
multiset<pair<int,pair<int,int>>> cur;
vector<int> L[N],R[N];
void go(int l,int r){
    if(l >= r) return;
    int mid = (l + r) >> 1;
    go(l,mid);
    go(mid + 1,r);
    timer++;
    int it = mid;
    for(int j:a[it]){
        used[j] = timer;
    }
    for(int i = mid + 1;i <= r;i++){
        for(int j:a[i]){
            used[j] = timer;
        }
        while(it >= l && used[c[it - 1]] == timer){
            it--;
            for(int j:a[it]){
                used[j] = timer;
            }
        }
        if(used[c[i]] == timer) continue;
        if(it >= l){
            all.push_back({it,i});
            L[it].push_back(i);
            R[i].push_back(it);
        }
    }
    timer++;
    it = mid + 1;
    for(int j:a[it]){
        used[j] = timer;
    }
    for(int i = mid;i >= l;i--){
        for(int j:a[i]){
            used[j] = timer;
        }
        while(it <= r && used[c[it]] == timer){
            it++;
            for(int j:a[it]){
                used[j] = timer;
            }
        }
        if(used[c[i - 1]] == timer) continue;
        if(it <= r){
            all.push_back({i,it});
            R[it].push_back(i);
            L[i].push_back(it);
        }
    }
}

void test(){
    cin >> n;
    for(int i = 1;i <= n - 1;i++){
        cin >> c[i];
    }
    for(int i = 1;i <= n;i++){
        cin >> b[i];
        for(int j = 1;j <=b[i];j++){
            int x;
            cin >> x;
            is[i][x] = 1;
            a[i].push_back(x);
        }
        if(!is[i].count(c[i]) && !is[i].count(c[i - 1])){
            array<int,3> f;
            f = {1,i,i};
            res[i] = f;
            L[i].push_back(i);
            R[i].push_back(i);
            all.push_back({i,i});
        }
    }
    L[1].push_back(n);
    R[n].push_back(1);
    all.push_back({1,n});
    go(1,n);
    for(int i = 1;i <=n;i++){
        for(int j:L[i]){
            cur.insert({j - i + 1,{i,j}});
        }
        res[i][1] = (*cur.begin()).second.first;
        res[i][2] = (*cur.begin()).second.second;
        for(int j:R[i]){
            cur.erase(cur.find({i - j + 1,{j,i}}));
        }
    }
    int q;
    cin >> q;
    while(q--){
        int x,y;
        cin >> x >> y;
        cout << (y >= res[x][1] && y <= res[x][2] ? "YES\n":"NO\n");
    }
}
main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int T = 1; // cin >> T;
    while (T--)
        test();
}

Compilation message

long_mansion.cpp:109:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  109 | main()
      | ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 74844 KB Output is correct
2 Correct 20 ms 74844 KB Output is correct
3 Correct 20 ms 75100 KB Output is correct
4 Correct 19 ms 74488 KB Output is correct
5 Correct 21 ms 74712 KB Output is correct
6 Correct 18 ms 74584 KB Output is correct
7 Correct 24 ms 75096 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 74844 KB Output is correct
2 Correct 20 ms 74844 KB Output is correct
3 Correct 20 ms 75100 KB Output is correct
4 Correct 19 ms 74488 KB Output is correct
5 Correct 21 ms 74712 KB Output is correct
6 Correct 18 ms 74584 KB Output is correct
7 Correct 24 ms 75096 KB Output is correct
8 Correct 89 ms 76200 KB Output is correct
9 Correct 91 ms 76116 KB Output is correct
10 Correct 94 ms 76504 KB Output is correct
11 Correct 91 ms 76884 KB Output is correct
12 Correct 79 ms 76112 KB Output is correct
13 Correct 85 ms 76380 KB Output is correct
14 Correct 84 ms 76368 KB Output is correct
15 Correct 85 ms 76372 KB Output is correct
16 Correct 83 ms 76368 KB Output is correct
17 Correct 85 ms 76224 KB Output is correct
18 Correct 88 ms 76212 KB Output is correct
19 Correct 85 ms 76368 KB Output is correct
20 Correct 85 ms 76368 KB Output is correct
21 Correct 83 ms 76420 KB Output is correct
22 Correct 85 ms 76368 KB Output is correct
23 Correct 88 ms 76564 KB Output is correct
24 Correct 94 ms 76668 KB Output is correct
25 Correct 89 ms 76496 KB Output is correct
26 Correct 91 ms 76496 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 285 ms 111036 KB Output is correct
2 Correct 268 ms 109188 KB Output is correct
3 Correct 281 ms 106436 KB Output is correct
4 Correct 275 ms 110272 KB Output is correct
5 Correct 279 ms 110000 KB Output is correct
6 Correct 192 ms 96772 KB Output is correct
7 Correct 174 ms 96340 KB Output is correct
8 Correct 189 ms 96236 KB Output is correct
9 Correct 170 ms 96420 KB Output is correct
10 Correct 170 ms 96300 KB Output is correct
11 Correct 176 ms 96292 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 74844 KB Output is correct
2 Correct 20 ms 74844 KB Output is correct
3 Correct 20 ms 75100 KB Output is correct
4 Correct 19 ms 74488 KB Output is correct
5 Correct 21 ms 74712 KB Output is correct
6 Correct 18 ms 74584 KB Output is correct
7 Correct 24 ms 75096 KB Output is correct
8 Correct 89 ms 76200 KB Output is correct
9 Correct 91 ms 76116 KB Output is correct
10 Correct 94 ms 76504 KB Output is correct
11 Correct 91 ms 76884 KB Output is correct
12 Correct 79 ms 76112 KB Output is correct
13 Correct 85 ms 76380 KB Output is correct
14 Correct 84 ms 76368 KB Output is correct
15 Correct 85 ms 76372 KB Output is correct
16 Correct 83 ms 76368 KB Output is correct
17 Correct 85 ms 76224 KB Output is correct
18 Correct 88 ms 76212 KB Output is correct
19 Correct 85 ms 76368 KB Output is correct
20 Correct 85 ms 76368 KB Output is correct
21 Correct 83 ms 76420 KB Output is correct
22 Correct 85 ms 76368 KB Output is correct
23 Correct 88 ms 76564 KB Output is correct
24 Correct 94 ms 76668 KB Output is correct
25 Correct 89 ms 76496 KB Output is correct
26 Correct 91 ms 76496 KB Output is correct
27 Correct 285 ms 111036 KB Output is correct
28 Correct 268 ms 109188 KB Output is correct
29 Correct 281 ms 106436 KB Output is correct
30 Correct 275 ms 110272 KB Output is correct
31 Correct 279 ms 110000 KB Output is correct
32 Correct 192 ms 96772 KB Output is correct
33 Correct 174 ms 96340 KB Output is correct
34 Correct 189 ms 96236 KB Output is correct
35 Correct 170 ms 96420 KB Output is correct
36 Correct 170 ms 96300 KB Output is correct
37 Correct 176 ms 96292 KB Output is correct
38 Runtime error 527 ms 262144 KB Execution killed with signal 9
39 Halted 0 ms 0 KB -