oj.uz

Submission #900520

# Submission time Handle Problem Language Result Execution time Memory
900520 2024-01-08T12:15:34 Z vjudge1 Alternating Heights (CCO22_day1problem1) C++17
17 / 25
 1000 ms 13944 KB 
#include <bits/stdc++.h>
#ifndef memset0
#define endl '\n'
#endif
using namespace std;
const int N = 3e3 + 9;
int n, k, q, a[N], ok[N], deg[N];
vector<int> G[N];
bool check(int l, int r) {
  // cerr << "check " << l << " " << r << endl;
  fill_n(deg + 1, n, 0);
  for (int i = 1; i <= n; i++) { G[i].clear(); }
  for (int i = l; i < r; i++) {
    int x = a[i], y = a[i + 1];
    if ((i - l) & 1) swap(x, y);
    G[x].push_back(y);
    deg[y]++;
    // cerr << x << "->" << y << endl;
  }
  static int q[N];
  l = 1, r = 0;
  for (int i = 1; i <= n; i++)
    if (!deg[i]) { q[++r] = i; }
  while (l <= r) {
    int u = q[l++];
    for (int v : G[u]) {
      --deg[v];
      if (!deg[v]) { q[++r] = v; }
    }
  }
  for (int i = 1; i <= n; i++)
    if (deg[i]) return false;
  return true;
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> k >> q;
  for (int i = 1; i <= n; i++) { cin >> a[i]; }
  for (int l, r, mid, i = 1; i <= n; i++) {
    ok[i] = i, l = i + 1, r = n;
    while (l <= r) {
      mid = (l + r) >> 1;
      if (check(i, mid)) {
        ok[i] = mid;
        l = mid + 1;
      } else {
        r = mid - 1;
      }
    }
  }
  for (int l, r, i = 1; i <= q; i++) {
    cin >> l >> r;
    cout << (r <= ok[l] ? "YES" : "NO") << endl;
  }
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 12884 KB Output is correct
2 Correct 394 ms 12788 KB Output is correct
3 Correct 413 ms 13060 KB Output is correct
4 Correct 131 ms 7248 KB Output is correct
5 Correct 123 ms 9296 KB Output is correct
6 Correct 415 ms 12892 KB Output is correct
7 Correct 385 ms 12740 KB Output is correct
8 Correct 386 ms 12864 KB Output is correct
9 Correct 411 ms 12876 KB Output is correct
10 Correct 482 ms 13392 KB Output is correct
11 Correct 645 ms 13944 KB Output is correct
12 Correct 599 ms 13380 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 3448 KB Output is correct
2 Correct 145 ms 11088 KB Output is correct
3 Correct 147 ms 10992 KB Output is correct
4 Correct 115 ms 8272 KB Output is correct
5 Correct 128 ms 9488 KB Output is correct
6 Correct 163 ms 10948 KB Output is correct
7 Correct 146 ms 11028 KB Output is correct
8 Correct 144 ms 11188 KB Output is correct
9 Correct 160 ms 11424 KB Output is correct
10 Correct 151 ms 11908 KB Output is correct
11 Correct 150 ms 11896 KB Output is correct
12 Correct 0 ms 344 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 470 ms 636 KB Output is correct
3 Correct 537 ms 636 KB Output is correct
4 Correct 231 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 444 ms 632 KB Output is correct
8 Correct 664 ms 644 KB Output is correct
9 Correct 789 ms 640 KB Output is correct
10 Correct 828 ms 644 KB Output is correct
11 Correct 936 ms 604 KB Output is correct
12 Correct 762 ms 632 KB Output is correct

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 12884 KB Output is correct
2 Correct 394 ms 12788 KB Output is correct
3 Correct 413 ms 13060 KB Output is correct
4 Correct 131 ms 7248 KB Output is correct
5 Correct 123 ms 9296 KB Output is correct
6 Correct 415 ms 12892 KB Output is correct
7 Correct 385 ms 12740 KB Output is correct
8 Correct 386 ms 12864 KB Output is correct
9 Correct 411 ms 12876 KB Output is correct
10 Correct 482 ms 13392 KB Output is correct
11 Correct 645 ms 13944 KB Output is correct
12 Correct 599 ms 13380 KB Output is correct
13 Correct 148 ms 3448 KB Output is correct
14 Correct 145 ms 11088 KB Output is correct
15 Correct 147 ms 10992 KB Output is correct
16 Correct 115 ms 8272 KB Output is correct
17 Correct 128 ms 9488 KB Output is correct
18 Correct 163 ms 10948 KB Output is correct
19 Correct 146 ms 11028 KB Output is correct
20 Correct 144 ms 11188 KB Output is correct
21 Correct 160 ms 11424 KB Output is correct
22 Correct 151 ms 11908 KB Output is correct
23 Correct 150 ms 11896 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 470 ms 636 KB Output is correct
27 Correct 537 ms 636 KB Output is correct
28 Correct 231 ms 600 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 444 ms 632 KB Output is correct
32 Correct 664 ms 644 KB Output is correct
33 Correct 789 ms 640 KB Output is correct
34 Correct 828 ms 644 KB Output is correct
35 Correct 936 ms 604 KB Output is correct
36 Correct 762 ms 632 KB Output is correct
37 Correct 739 ms 13552 KB Output is correct
38 Correct 659 ms 13448 KB Output is correct
39 Correct 379 ms 12944 KB Output is correct
40 Correct 125 ms 8268 KB Output is correct
41 Correct 141 ms 9820 KB Output is correct
42 Correct 646 ms 13524 KB Output is correct
43 Correct 877 ms 13804 KB Output is correct
44 Correct 638 ms 13552 KB Output is correct
45 Execution timed out 1040 ms 11856 KB Time limit exceeded
46 Halted 0 ms 0 KB -