oj.uz

Submission #550139

# Submission time Handle Problem Language Result Execution time Memory
550139 2022-04-17T10:37:23 Z Soumya1 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 923 ms 55832 KB 
#include <bits/stdc++.h>
#ifdef __LOCAL__
#include <debug_local.h>
#endif
using namespace std;
const int mxN = 30'000;
vector<int> all[mxN], init[mxN], l[mxN];
vector<int> dist[mxN];
bool vis[mxN];
int idx(int i, int j) {
  if (j < 200) return j;
  return 200 + lower_bound(all[i].begin(), all[i].end(), j) - all[i].begin();
}
void testCase() {
  int n, m;
  cin >> n >> m;
  vector<int> v;
  while (m--) {
    int b, p;
    cin >> b >> p;
    v.push_back(b);
    init[b].push_back(p);
    l[b % p].push_back(p);
  }
  for (int i = 0; i < n; i++) {
    sort(l[i].begin(), l[i].end());
    sort(init[i].begin(), init[i].end());
    init[i].erase(unique(init[i].begin(), init[i].end()), init[i].end());
    l[i].erase(unique(l[i].begin(), l[i].end()), l[i].end());
  }
  for (int i = 0; i < n; i++) {
    for (int j : l[i]) {
      if (j < 200) continue;
      for (int k = i; k < n; k += j) {
        all[k].push_back(j);
      }
    }
    sort(all[i].begin(), all[i].end());
    dist[i].assign(all[i].size() + 200, 1e9);
  }
  queue<tuple<int, int, int>> q;
  for (auto p : init[v[0]]) {
    vis[v[0]] = true;
    int vv = idx(v[0], p);
    q.push({v[0], p, vv});
    dist[v[0]][vv] = 0;
  }
  while (!q.empty()) {
    auto [u, p, id] = q.front();
    q.pop();
    int i;
    if (u + p < n) i = idx(u + p, p);
    if (u + p < n && dist[u + p][i] == 1e9) {
      dist[u + p][i] = dist[u][id] + 1;
      q.push({u + p, p, i});
    }
    if (u + p < n && !vis[u + p]) {
      vis[u + p] = true;
      for (int pp : init[u + p]) {
        i = idx(u + p, pp);
        if (dist[u + p][i] == 1e9) {
          dist[u + p][i] = dist[u][id] + 1;
          q.push({u + p, pp, i});
        }
      }
    }
    if (u - p >= 0) i = idx(u - p, p);
    if (u - p >= 0 && dist[u - p][i] == 1e9) {
      dist[u - p][i] = dist[u][id] + 1;
      q.push({u - p, p, i});
    }
    if (u - p >= 0 && !vis[u - p]) {
      vis[u - p] = true;
      for (int pp : init[u - p]) {
        i = idx(u - p, pp);
        if (dist[u - p][i] == 1e9) {
          dist[u - p][i] = dist[u][id] + 1;
          q.push({u - p, pp, i});
        }
      }
    }
  }
  int ans = *min_element(dist[v[1]].begin(), dist[v[1]].end());
  cout << (ans == 1e9 ? -1 : ans) << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3156 KB Output is correct
5 Correct 3 ms 3156 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3156 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 2 ms 3156 KB Output is correct
10 Correct 2 ms 3156 KB Output is correct
11 Correct 2 ms 3284 KB Output is correct
12 Correct 2 ms 3156 KB Output is correct
13 Correct 2 ms 3156 KB Output is correct
14 Correct 3 ms 3284 KB Output is correct
15 Correct 4 ms 3284 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 3 ms 3028 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 2 ms 3132 KB Output is correct
10 Correct 2 ms 3156 KB Output is correct
11 Correct 3 ms 3284 KB Output is correct
12 Correct 2 ms 3156 KB Output is correct
13 Correct 2 ms 3156 KB Output is correct
14 Correct 2 ms 3284 KB Output is correct
15 Correct 2 ms 3284 KB Output is correct
16 Correct 2 ms 3284 KB Output is correct
17 Correct 3 ms 3796 KB Output is correct
18 Correct 3 ms 4564 KB Output is correct
19 Correct 3 ms 4692 KB Output is correct
20 Correct 3 ms 4820 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 3 ms 4576 KB Output is correct
23 Correct 3 ms 4436 KB Output is correct
24 Correct 4 ms 4824 KB Output is correct
25 Correct 4 ms 4820 KB Output is correct
26 Correct 4 ms 4692 KB Output is correct
27 Correct 4 ms 4692 KB Output is correct
28 Correct 5 ms 4820 KB Output is correct
29 Correct 5 ms 4696 KB Output is correct
30 Correct 3 ms 4692 KB Output is correct
31 Correct 3 ms 4692 KB Output is correct
32 Correct 3 ms 4692 KB Output is correct
33 Correct 5 ms 4692 KB Output is correct
34 Correct 5 ms 4692 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 1 ms 3028 KB Output is correct
4 Correct 2 ms 3156 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3156 KB Output is correct
7 Correct 2 ms 3156 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 3 ms 3156 KB Output is correct
10 Correct 2 ms 3156 KB Output is correct
11 Correct 3 ms 3284 KB Output is correct
12 Correct 2 ms 3156 KB Output is correct
13 Correct 2 ms 3156 KB Output is correct
14 Correct 3 ms 3284 KB Output is correct
15 Correct 3 ms 3284 KB Output is correct
16 Correct 2 ms 3284 KB Output is correct
17 Correct 4 ms 3832 KB Output is correct
18 Correct 3 ms 4564 KB Output is correct
19 Correct 3 ms 4692 KB Output is correct
20 Correct 3 ms 4820 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 3 ms 4564 KB Output is correct
23 Correct 3 ms 4436 KB Output is correct
24 Correct 4 ms 4820 KB Output is correct
25 Correct 4 ms 4820 KB Output is correct
26 Correct 3 ms 4692 KB Output is correct
27 Correct 4 ms 4692 KB Output is correct
28 Correct 4 ms 4820 KB Output is correct
29 Correct 4 ms 4692 KB Output is correct
30 Correct 3 ms 4640 KB Output is correct
31 Correct 4 ms 4692 KB Output is correct
32 Correct 3 ms 4692 KB Output is correct
33 Correct 7 ms 4692 KB Output is correct
34 Correct 6 ms 4692 KB Output is correct
35 Correct 19 ms 5496 KB Output is correct
36 Correct 5 ms 4176 KB Output is correct
37 Correct 18 ms 5972 KB Output is correct
38 Correct 22 ms 6460 KB Output is correct
39 Correct 22 ms 6484 KB Output is correct
40 Correct 20 ms 6368 KB Output is correct
41 Correct 23 ms 6460 KB Output is correct
42 Correct 7 ms 5076 KB Output is correct
43 Correct 8 ms 5076 KB Output is correct
44 Correct 8 ms 5076 KB Output is correct
45 Correct 25 ms 6488 KB Output is correct
46 Correct 25 ms 6524 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3156 KB Output is correct
7 Correct 2 ms 3028 KB Output is correct
8 Correct 2 ms 3156 KB Output is correct
9 Correct 2 ms 3156 KB Output is correct
10 Correct 2 ms 3156 KB Output is correct
11 Correct 2 ms 3284 KB Output is correct
12 Correct 3 ms 3156 KB Output is correct
13 Correct 3 ms 3156 KB Output is correct
14 Correct 3 ms 3284 KB Output is correct
15 Correct 4 ms 3284 KB Output is correct
16 Correct 2 ms 3284 KB Output is correct
17 Correct 3 ms 3796 KB Output is correct
18 Correct 5 ms 4564 KB Output is correct
19 Correct 3 ms 4692 KB Output is correct
20 Correct 4 ms 4820 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 3 ms 4564 KB Output is correct
23 Correct 3 ms 4436 KB Output is correct
24 Correct 4 ms 4692 KB Output is correct
25 Correct 4 ms 4820 KB Output is correct
26 Correct 3 ms 4692 KB Output is correct
27 Correct 3 ms 4692 KB Output is correct
28 Correct 4 ms 4872 KB Output is correct
29 Correct 4 ms 4692 KB Output is correct
30 Correct 3 ms 4692 KB Output is correct
31 Correct 3 ms 4692 KB Output is correct
32 Correct 3 ms 4692 KB Output is correct
33 Correct 6 ms 4692 KB Output is correct
34 Correct 7 ms 4692 KB Output is correct
35 Correct 15 ms 5460 KB Output is correct
36 Correct 4 ms 4180 KB Output is correct
37 Correct 21 ms 6040 KB Output is correct
38 Correct 23 ms 6496 KB Output is correct
39 Correct 23 ms 6460 KB Output is correct
40 Correct 20 ms 6368 KB Output is correct
41 Correct 23 ms 6488 KB Output is correct
42 Correct 8 ms 5036 KB Output is correct
43 Correct 8 ms 5064 KB Output is correct
44 Correct 8 ms 5076 KB Output is correct
45 Correct 23 ms 6492 KB Output is correct
46 Correct 25 ms 6552 KB Output is correct
47 Correct 103 ms 17308 KB Output is correct
48 Correct 31 ms 24004 KB Output is correct
49 Correct 29 ms 25556 KB Output is correct
50 Correct 36 ms 27192 KB Output is correct
51 Correct 69 ms 30336 KB Output is correct
52 Correct 70 ms 30416 KB Output is correct
53 Correct 40 ms 29008 KB Output is correct
54 Correct 17 ms 27076 KB Output is correct
55 Correct 18 ms 27096 KB Output is correct
56 Correct 24 ms 28244 KB Output is correct
57 Correct 38 ms 27220 KB Output is correct
58 Correct 21 ms 27496 KB Output is correct
59 Correct 28 ms 27456 KB Output is correct
60 Correct 36 ms 27792 KB Output is correct
61 Correct 31 ms 28000 KB Output is correct
62 Correct 83 ms 31396 KB Output is correct
63 Correct 709 ms 53188 KB Output is correct
64 Correct 923 ms 55832 KB Output is correct
65 Correct 776 ms 54440 KB Output is correct
66 Correct 465 ms 42448 KB Output is correct
67 Correct 371 ms 42404 KB Output is correct