oj.uz

Submission #296270

# Submission time Handle Problem Language Result Execution time Memory
296270 2020-09-10T13:04:38 Z BThero Long Mansion (JOI17_long_mansion) C++17
10 / 100
 167 ms 2556 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)5e3 + 5;

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

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]);
    }
  }
  
  for (int i = 1; i < n; ++i) {
    int p = i + 1;
    
    while (p <= n && find(all(keys[p]), betw[i]) == keys[p].end()) {
      ++p;
    }
    
    B[i] = p;
  }
  
  for (int i = 2; i <= n; ++i) {
    int p = i - 1;
    
    while (p > 0 && find(all(keys[p]), betw[i - 1]) == keys[p].end()) {
      --p;
    }
    
    A[i] = p;
  }
  
  B[0] = n + 1;
  A[n + 1] = 0;
  
  for (int i = 1; i <= n; ++i) {
    R[i] = n + 1;
    L[i] = 0;
  }
  
  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);
    }
  }
  
  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);
    }
  }
  
  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:26:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~
long_mansion.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |     scanf("%d", &betw[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~
long_mansion.cpp:34:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   34 |     scanf("%d", &sz);
      |     ~~~~~^~~~~~~~~~~
long_mansion.cpp:38:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |       scanf("%d", &keys[i][j]);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~
long_mansion.cpp:98:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   98 |   scanf("%d", &q);
      |   ~~~~~^~~~~~~~~~
long_mansion.cpp:102:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  102 |     scanf("%d %d", &a, &b);
      |     ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 19 ms 512 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 19 ms 512 KB Output is correct
8 Correct 154 ms 2060 KB Output is correct
9 Correct 155 ms 2040 KB Output is correct
10 Correct 158 ms 2396 KB Output is correct
11 Correct 157 ms 2424 KB Output is correct
12 Correct 154 ms 2300 KB Output is correct
13 Correct 148 ms 2300 KB Output is correct
14 Correct 152 ms 2388 KB Output is correct
15 Correct 155 ms 2428 KB Output is correct
16 Correct 138 ms 2552 KB Output is correct
17 Correct 149 ms 2300 KB Output is correct
18 Correct 147 ms 2296 KB Output is correct
19 Correct 152 ms 2296 KB Output is correct
20 Correct 146 ms 2424 KB Output is correct
21 Correct 138 ms 2556 KB Output is correct
22 Correct 148 ms 2424 KB Output is correct
23 Correct 161 ms 2168 KB Output is correct
24 Correct 165 ms 2168 KB Output is correct
25 Correct 167 ms 2168 KB Output is correct
26 Correct 163 ms 2168 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5 ms 384 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 19 ms 512 KB Output is correct
8 Correct 154 ms 2060 KB Output is correct
9 Correct 155 ms 2040 KB Output is correct
10 Correct 158 ms 2396 KB Output is correct
11 Correct 157 ms 2424 KB Output is correct
12 Correct 154 ms 2300 KB Output is correct
13 Correct 148 ms 2300 KB Output is correct
14 Correct 152 ms 2388 KB Output is correct
15 Correct 155 ms 2428 KB Output is correct
16 Correct 138 ms 2552 KB Output is correct
17 Correct 149 ms 2300 KB Output is correct
18 Correct 147 ms 2296 KB Output is correct
19 Correct 152 ms 2296 KB Output is correct
20 Correct 146 ms 2424 KB Output is correct
21 Correct 138 ms 2556 KB Output is correct
22 Correct 148 ms 2424 KB Output is correct
23 Correct 161 ms 2168 KB Output is correct
24 Correct 165 ms 2168 KB Output is correct
25 Correct 167 ms 2168 KB Output is correct
26 Correct 163 ms 2168 KB Output is correct
27 Execution timed out 5 ms 384 KB Time limit exceeded (wall clock)
28 Halted 0 ms 0 KB -