oj.uz

Submission #296289

# Submission time Handle Problem Language Result Execution time Memory
296289 2020-09-10T13:14:31 Z BThero Long Mansion (JOI17_long_mansion) C++17
25 / 100
 3000 ms 48248 KB 
// chrono::system_clock::now().time_since_epoch().count()
#include<bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = (int)5e5 + 5;

vector<int> group[MAXN];
vector<int> keys[MAXN];
int betw[MAXN];
int A[MAXN], B[MAXN];
int L[MAXN], R[MAXN];
int n, q;

void calcB() {
  B[0] = n + 1;
  
  for (int i = 1; i <= n; ++i) {
    group[i].clear();
    B[i] = n + 1;
  }
  
  for (int i = 2; i <= n; ++i) {
    group[betw[i - 1]].pb(i - 1);
    
    for (int x : keys[i]) {
      for (int y : group[x]) {
        B[y] = i;
      }
      
      group[x].clear();
    }
  }
}

void calcA() {
  A[n + 1] = 0;
  
  for (int i = 1; i <= n; ++i) {
    group[i].clear();
    A[i] = 0;
  }
  
  for (int i = n - 1; i > 0; --i) {
    group[betw[i]].pb(i + 1);
    
    for (int x : keys[i]) {
      for (int y : group[x]) {
        A[y] = i;
      }
      
      group[x].clear();
    }
  }
}

void calcR() {
  for (int i = 1; i <= n; ++i) {
    R[i] = n + 1;
  }
  
  for (int r = 1; r <= n; ++r) {
    // A[r + 1] < l
    int l = A[r + 1] + 1;
    // B[l - 1] > r
    
    while (l <= r && B[l - 1] <= r) {
      ++l;
    }
    
    for (int i = l; i <= r; ++i) {
      R[i] = min(R[i], r);
    }
  }
}

void calcL() {
  for (int i = 1; i <= n; ++i) {
    L[i] = 0;
  }
  
  for (int l = n; l > 0; --l) {
    // B[l - 1] > r
    int r = B[l - 1] - 1;
    // A[r + 1] < l
    
    while (l <= r && A[r + 1] >= l) {
      --r;
    }
    
    for (int i = l; i <= r; ++i) {
      L[i] = max(L[i], l);
    }
  }
}

void solve() {
  scanf("%d", &n);
  
  for (int i = 1; i < n; ++i) {
    scanf("%d", &betw[i]);
  }
  
  for (int i = 1; i <= n; ++i) {
    int sz;
    scanf("%d", &sz);
    keys[i].resize(sz);
    
    for (int j = 0; j < sz; ++j) {
      scanf("%d", &keys[i][j]);
    }
  }
  
  calcB();
  calcA();
  calcR();
  calcL();
  
  scanf("%d", &q);
  
  for (int i = 1; i <= q; ++i) {
    int a, b;
    scanf("%d %d", &a, &b);
    // a -> b
    bool ans = 1;
    
    if (a < b) {
      if (R[a] < b) {
        ans = 0;
      }
    }
    else {
      if (L[a] > b) {
        ans = 0;
      }
    }
    
    if (ans) {
      printf("YES\n");
    }
    else {
      printf("NO\n");
    }
  }
}

int main() {
  int tt = 1;
  
  while (tt--) {
    solve();
  }

  return 0;
}

Compilation message

long_mansion.cpp: In function 'void solve()':
long_mansion.cpp:109:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  109 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
long_mansion.cpp:112:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  112 |     scanf("%d", &betw[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~
long_mansion.cpp:117:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  117 |     scanf("%d", &sz);
      |     ~~~~~^~~~~~~~~~~
long_mansion.cpp:121:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  121 |       scanf("%d", &keys[i][j]);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~
long_mansion.cpp:130:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  130 |   scanf("%d", &q);
      |   ~~~~~^~~~~~~~~~
long_mansion.cpp:134:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  134 |     scanf("%d %d", &a, &b);
      |     ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23936 KB Output is correct
2 Correct 20 ms 24064 KB Output is correct
3 Correct 21 ms 24064 KB Output is correct
4 Correct 21 ms 24040 KB Output is correct
5 Correct 21 ms 23936 KB Output is correct
6 Correct 22 ms 23936 KB Output is correct
7 Correct 22 ms 24020 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23936 KB Output is correct
2 Correct 20 ms 24064 KB Output is correct
3 Correct 21 ms 24064 KB Output is correct
4 Correct 21 ms 24040 KB Output is correct
5 Correct 21 ms 23936 KB Output is correct
6 Correct 22 ms 23936 KB Output is correct
7 Correct 22 ms 24020 KB Output is correct
8 Correct 192 ms 25500 KB Output is correct
9 Correct 200 ms 25496 KB Output is correct
10 Correct 194 ms 25684 KB Output is correct
11 Correct 185 ms 25976 KB Output is correct
12 Correct 178 ms 25720 KB Output is correct
13 Correct 179 ms 25720 KB Output is correct
14 Correct 178 ms 25724 KB Output is correct
15 Correct 177 ms 25720 KB Output is correct
16 Correct 166 ms 25924 KB Output is correct
17 Correct 188 ms 25692 KB Output is correct
18 Correct 191 ms 25748 KB Output is correct
19 Correct 174 ms 25784 KB Output is correct
20 Correct 188 ms 25976 KB Output is correct
21 Correct 191 ms 25976 KB Output is correct
22 Correct 182 ms 25848 KB Output is correct
23 Correct 179 ms 25592 KB Output is correct
24 Correct 205 ms 25592 KB Output is correct
25 Correct 186 ms 25592 KB Output is correct
26 Correct 193 ms 25592 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 37528 KB Output is correct
2 Correct 360 ms 37964 KB Output is correct
3 Correct 349 ms 37748 KB Output is correct
4 Correct 305 ms 37880 KB Output is correct
5 Correct 305 ms 37880 KB Output is correct
6 Correct 252 ms 37128 KB Output is correct
7 Correct 254 ms 36956 KB Output is correct
8 Correct 247 ms 36984 KB Output is correct
9 Correct 246 ms 36984 KB Output is correct
10 Correct 236 ms 36984 KB Output is correct
11 Correct 241 ms 36984 KB Output is correct

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23936 KB Output is correct
2 Correct 20 ms 24064 KB Output is correct
3 Correct 21 ms 24064 KB Output is correct
4 Correct 21 ms 24040 KB Output is correct
5 Correct 21 ms 23936 KB Output is correct
6 Correct 22 ms 23936 KB Output is correct
7 Correct 22 ms 24020 KB Output is correct
8 Correct 192 ms 25500 KB Output is correct
9 Correct 200 ms 25496 KB Output is correct
10 Correct 194 ms 25684 KB Output is correct
11 Correct 185 ms 25976 KB Output is correct
12 Correct 178 ms 25720 KB Output is correct
13 Correct 179 ms 25720 KB Output is correct
14 Correct 178 ms 25724 KB Output is correct
15 Correct 177 ms 25720 KB Output is correct
16 Correct 166 ms 25924 KB Output is correct
17 Correct 188 ms 25692 KB Output is correct
18 Correct 191 ms 25748 KB Output is correct
19 Correct 174 ms 25784 KB Output is correct
20 Correct 188 ms 25976 KB Output is correct
21 Correct 191 ms 25976 KB Output is correct
22 Correct 182 ms 25848 KB Output is correct
23 Correct 179 ms 25592 KB Output is correct
24 Correct 205 ms 25592 KB Output is correct
25 Correct 186 ms 25592 KB Output is correct
26 Correct 193 ms 25592 KB Output is correct
27 Correct 332 ms 37528 KB Output is correct
28 Correct 360 ms 37964 KB Output is correct
29 Correct 349 ms 37748 KB Output is correct
30 Correct 305 ms 37880 KB Output is correct
31 Correct 305 ms 37880 KB Output is correct
32 Correct 252 ms 37128 KB Output is correct
33 Correct 254 ms 36956 KB Output is correct
34 Correct 247 ms 36984 KB Output is correct
35 Correct 246 ms 36984 KB Output is correct
36 Correct 236 ms 36984 KB Output is correct
37 Correct 241 ms 36984 KB Output is correct
38 Execution timed out 3036 ms 48248 KB Time limit exceeded
39 Halted 0 ms 0 KB -