oj.uz

Submission #28039

# Submission time Handle Problem Language Result Execution time Memory
28039 2017-07-15T00:44:10 Z sampriti Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 261772 KB 
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <climits>

using namespace std;

#define LIM 150

int B[30000], P[30000];
set<int> A[30000];
vector<pair<pair<short, short>, short> > G[30000][LIM + 1];
short D[30000][LIM + 1];
set<pair<short, pair<short, short> > > Q;

int main() {
  int N, M; cin >> N >> M;

  for(int i = 0; i < M; i++) {
    cin >> B[i] >> P[i];
    A[B[i]].insert(P[i]);
  }

  for(int i = 0; i < N; i++) {
    for(int x: A[i]) {
      if(x < LIM) {
        G[i][LIM].push_back({{i, x}, 0});
      }
    }

    for(int x: A[i]) {
      if(x >= LIM) {
        for(int d = 1; i + d * x < N; d++) {
          G[i][LIM].push_back({{i + d * x, LIM}, d});
        }
        for(int d = 1; i - d * x >= 0; d++) {
          G[i][LIM].push_back({{i - d * x, LIM}, d});
        }
      }
    }

    for(int x = 1; x < LIM; x++) {
      G[i][x].push_back({{i, LIM}, 0});

      if(i + x < N) {
        G[i][x].push_back({{i + x, x}, 1});
      }
      if(i - x >= 0) {
        G[i][x].push_back({{i - x, x}, 1});
      }
    }
  }

  for(int i = 0; i < N; i++) {
    for(int j = 0; j <= LIM; j++) {
      D[i][j] = SHRT_MAX;
    }
  }

  Q.insert({0, {B[0], LIM}}); D[B[0]][LIM] = 0;

  while(!Q.empty()) {
    auto it = *Q.begin(); Q.erase(Q.begin());
    int i = it.second.first, j = it.second.second;

    for(auto it2: G[i][j]) {
      int i2 = it2.first.first, j2 = it2.first.second, d = it2.second;
      if(D[i][j] + d < D[i2][j2]) {
        if(D[i2][j2] != SHRT_MAX) {
          Q.erase({D[i2][j2], {i2, j2}});
        }
        D[i2][j2] = D[i][j] + d;
        Q.insert({D[i2][j2], {i2, j2}});
      }
    }
  }

  if(D[B[1]][LIM] == SHRT_MAX) {
    cout << -1 << endl;
  }
  else {
    cout << D[B[1]][LIM] << endl;
  }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 118684 KB Output is correct
2 Correct 23 ms 118684 KB Output is correct
3 Correct 23 ms 118684 KB Output is correct
4 Correct 39 ms 118684 KB Output is correct
5 Correct 19 ms 118684 KB Output is correct
6 Correct 13 ms 118684 KB Output is correct
7 Correct 23 ms 118684 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 118684 KB Output is correct
2 Correct 29 ms 118684 KB Output is correct
3 Correct 33 ms 118684 KB Output is correct
4 Correct 33 ms 118684 KB Output is correct
5 Correct 16 ms 118684 KB Output is correct
6 Correct 29 ms 118684 KB Output is correct
7 Correct 23 ms 118684 KB Output is correct
8 Correct 39 ms 118816 KB Output is correct
9 Correct 26 ms 118948 KB Output is correct
10 Correct 39 ms 119212 KB Output is correct
11 Correct 23 ms 119344 KB Output is correct
12 Correct 26 ms 119212 KB Output is correct
13 Correct 33 ms 119212 KB Output is correct
14 Correct 19 ms 119344 KB Output is correct
15 Correct 39 ms 119344 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 118684 KB Output is correct
2 Correct 26 ms 118684 KB Output is correct
3 Correct 26 ms 118684 KB Output is correct
4 Correct 19 ms 118684 KB Output is correct
5 Correct 46 ms 118684 KB Output is correct
6 Correct 43 ms 118684 KB Output is correct
7 Correct 33 ms 118684 KB Output is correct
8 Correct 26 ms 118816 KB Output is correct
9 Correct 33 ms 118948 KB Output is correct
10 Correct 36 ms 119212 KB Output is correct
11 Correct 29 ms 119344 KB Output is correct
12 Correct 33 ms 119212 KB Output is correct
13 Correct 29 ms 119212 KB Output is correct
14 Correct 36 ms 119344 KB Output is correct
15 Correct 36 ms 119344 KB Output is correct
16 Correct 29 ms 119740 KB Output is correct
17 Correct 46 ms 122248 KB Output is correct
18 Correct 76 ms 126868 KB Output is correct
19 Correct 69 ms 128056 KB Output is correct
20 Correct 69 ms 128188 KB Output is correct
21 Correct 29 ms 120532 KB Output is correct
22 Correct 66 ms 127000 KB Output is correct
23 Correct 69 ms 126208 KB Output is correct
24 Correct 96 ms 127660 KB Output is correct
25 Correct 73 ms 128188 KB Output is correct
26 Correct 66 ms 128056 KB Output is correct
27 Correct 83 ms 128056 KB Output is correct
28 Correct 79 ms 128188 KB Output is correct
29 Correct 99 ms 128056 KB Output is correct
30 Correct 73 ms 128056 KB Output is correct
31 Correct 96 ms 128056 KB Output is correct
32 Correct 96 ms 128056 KB Output is correct
33 Correct 99 ms 128188 KB Output is correct
34 Correct 116 ms 128188 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 118684 KB Output is correct
2 Correct 26 ms 118684 KB Output is correct
3 Correct 19 ms 118684 KB Output is correct
4 Correct 29 ms 118684 KB Output is correct
5 Correct 23 ms 118684 KB Output is correct
6 Correct 36 ms 118684 KB Output is correct
7 Correct 26 ms 118684 KB Output is correct
8 Correct 29 ms 118816 KB Output is correct
9 Correct 33 ms 118948 KB Output is correct
10 Correct 33 ms 119212 KB Output is correct
11 Correct 33 ms 119344 KB Output is correct
12 Correct 29 ms 119212 KB Output is correct
13 Correct 29 ms 119212 KB Output is correct
14 Correct 36 ms 119344 KB Output is correct
15 Correct 23 ms 119344 KB Output is correct
16 Correct 39 ms 119740 KB Output is correct
17 Correct 59 ms 122248 KB Output is correct
18 Correct 76 ms 126868 KB Output is correct
19 Correct 73 ms 128056 KB Output is correct
20 Correct 89 ms 128188 KB Output is correct
21 Correct 26 ms 120532 KB Output is correct
22 Correct 63 ms 127000 KB Output is correct
23 Correct 73 ms 126208 KB Output is correct
24 Correct 69 ms 127660 KB Output is correct
25 Correct 83 ms 128188 KB Output is correct
26 Correct 76 ms 128056 KB Output is correct
27 Correct 73 ms 128056 KB Output is correct
28 Correct 76 ms 128188 KB Output is correct
29 Correct 83 ms 128056 KB Output is correct
30 Correct 73 ms 128056 KB Output is correct
31 Correct 79 ms 128056 KB Output is correct
32 Correct 89 ms 128056 KB Output is correct
33 Correct 99 ms 128188 KB Output is correct
34 Correct 106 ms 128188 KB Output is correct
35 Correct 103 ms 127000 KB Output is correct
36 Correct 56 ms 124096 KB Output is correct
37 Correct 159 ms 129376 KB Output is correct
38 Correct 163 ms 130036 KB Output is correct
39 Correct 153 ms 130036 KB Output is correct
40 Correct 176 ms 130036 KB Output is correct
41 Correct 139 ms 130036 KB Output is correct
42 Correct 93 ms 128056 KB Output is correct
43 Correct 96 ms 128056 KB Output is correct
44 Correct 93 ms 128188 KB Output is correct
45 Correct 226 ms 131496 KB Output is correct
46 Correct 189 ms 131496 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 118684 KB Output is correct
2 Correct 29 ms 118684 KB Output is correct
3 Correct 33 ms 118684 KB Output is correct
4 Correct 33 ms 118684 KB Output is correct
5 Correct 23 ms 118684 KB Output is correct
6 Correct 19 ms 118684 KB Output is correct
7 Correct 29 ms 118684 KB Output is correct
8 Correct 19 ms 118816 KB Output is correct
9 Correct 33 ms 118948 KB Output is correct
10 Correct 23 ms 119212 KB Output is correct
11 Correct 33 ms 119344 KB Output is correct
12 Correct 26 ms 119212 KB Output is correct
13 Correct 26 ms 119212 KB Output is correct
14 Correct 29 ms 119344 KB Output is correct
15 Correct 36 ms 119344 KB Output is correct
16 Correct 33 ms 119740 KB Output is correct
17 Correct 53 ms 122248 KB Output is correct
18 Correct 66 ms 126868 KB Output is correct
19 Correct 73 ms 128056 KB Output is correct
20 Correct 83 ms 128188 KB Output is correct
21 Correct 43 ms 120532 KB Output is correct
22 Correct 73 ms 127000 KB Output is correct
23 Correct 63 ms 126208 KB Output is correct
24 Correct 86 ms 127660 KB Output is correct
25 Correct 69 ms 128188 KB Output is correct
26 Correct 79 ms 128056 KB Output is correct
27 Correct 76 ms 128056 KB Output is correct
28 Correct 79 ms 128188 KB Output is correct
29 Correct 89 ms 128056 KB Output is correct
30 Correct 89 ms 128056 KB Output is correct
31 Correct 89 ms 128056 KB Output is correct
32 Correct 119 ms 128056 KB Output is correct
33 Correct 99 ms 128188 KB Output is correct
34 Correct 109 ms 128188 KB Output is correct
35 Correct 109 ms 127000 KB Output is correct
36 Correct 66 ms 124096 KB Output is correct
37 Correct 153 ms 129376 KB Output is correct
38 Correct 149 ms 130036 KB Output is correct
39 Correct 146 ms 130036 KB Output is correct
40 Correct 143 ms 130036 KB Output is correct
41 Correct 149 ms 130036 KB Output is correct
42 Correct 93 ms 128056 KB Output is correct
43 Correct 99 ms 128056 KB Output is correct
44 Correct 96 ms 128188 KB Output is correct
45 Correct 203 ms 131496 KB Output is correct
46 Correct 193 ms 131496 KB Output is correct
47 Correct 619 ms 180724 KB Output is correct
48 Correct 636 ms 228772 KB Output is correct
49 Correct 686 ms 238672 KB Output is correct
50 Correct 696 ms 250024 KB Output is correct
51 Correct 919 ms 261772 KB Output is correct
52 Execution timed out 1000 ms 261772 KB Execution timed out
53 Halted 0 ms 0 KB -