oj.uz

Submission #28040

# Submission time Handle Problem Language Result Execution time Memory
28040 2017-07-15T00:46:50 Z sampriti Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 999 ms 261112 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++) {
          if(A[i + d * x].size() == 0) continue;
          G[i][LIM].push_back({{i + d * x, LIM}, d});
        }
        for(int d = 1; i - d * x >= 0; d++) {
          if(A[i - d * x].size() == 0) continue;
          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 36 ms 118684 KB Output is correct
2 Correct 19 ms 118684 KB Output is correct
3 Correct 33 ms 118684 KB Output is correct
4 Correct 36 ms 118684 KB Output is correct
5 Correct 29 ms 118684 KB Output is correct
6 Correct 29 ms 118684 KB Output is correct
7 Correct 26 ms 118684 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.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 23 ms 118684 KB Output is correct
4 Correct 39 ms 118684 KB Output is correct
5 Correct 29 ms 118684 KB Output is correct
6 Correct 26 ms 118684 KB Output is correct
7 Correct 29 ms 118684 KB Output is correct
8 Correct 26 ms 118816 KB Output is correct
9 Correct 19 ms 118948 KB Output is correct
10 Correct 26 ms 119212 KB Output is correct
11 Correct 23 ms 119344 KB Output is correct
12 Correct 36 ms 119212 KB Output is correct
13 Correct 36 ms 119212 KB Output is correct
14 Correct 26 ms 119344 KB Output is correct
15 Correct 33 ms 119344 KB Output is correct
16 Correct 36 ms 119740 KB Output is correct
17 Correct 53 ms 122248 KB Output is correct
18 Correct 69 ms 126868 KB Output is correct
19 Correct 66 ms 128056 KB Output is correct
20 Correct 83 ms 128188 KB Output is correct
21 Correct 33 ms 120532 KB Output is correct
22 Correct 66 ms 127000 KB Output is correct
23 Correct 73 ms 126208 KB Output is correct
24 Correct 89 ms 127660 KB Output is correct
25 Correct 99 ms 128188 KB Output is correct
26 Correct 73 ms 128056 KB Output is correct
27 Correct 109 ms 128056 KB Output is correct
28 Correct 69 ms 128188 KB Output is correct
29 Correct 86 ms 128056 KB Output is correct
30 Correct 96 ms 128056 KB Output is correct
31 Correct 89 ms 128056 KB Output is correct
32 Correct 89 ms 128056 KB Output is correct
33 Correct 103 ms 128188 KB Output is correct
34 Correct 126 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 39 ms 118684 KB Output is correct
3 Correct 29 ms 118684 KB Output is correct
4 Correct 29 ms 118684 KB Output is correct
5 Correct 29 ms 118684 KB Output is correct
6 Correct 33 ms 118684 KB Output is correct
7 Correct 23 ms 118684 KB Output is correct
8 Correct 16 ms 118816 KB Output is correct
9 Correct 43 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 39 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 43 ms 119344 KB Output is correct
16 Correct 39 ms 119740 KB Output is correct
17 Correct 53 ms 122248 KB Output is correct
18 Correct 69 ms 126868 KB Output is correct
19 Correct 76 ms 128056 KB Output is correct
20 Correct 83 ms 128188 KB Output is correct
21 Correct 46 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 79 ms 127660 KB Output is correct
25 Correct 86 ms 128188 KB Output is correct
26 Correct 89 ms 128056 KB Output is correct
27 Correct 69 ms 128056 KB Output is correct
28 Correct 93 ms 128188 KB Output is correct
29 Correct 96 ms 128056 KB Output is correct
30 Correct 76 ms 128056 KB Output is correct
31 Correct 73 ms 128056 KB Output is correct
32 Correct 83 ms 128056 KB Output is correct
33 Correct 99 ms 128188 KB Output is correct
34 Correct 83 ms 128188 KB Output is correct
35 Correct 99 ms 127000 KB Output is correct
36 Correct 79 ms 124096 KB Output is correct
37 Correct 123 ms 129376 KB Output is correct
38 Correct 133 ms 130036 KB Output is correct
39 Correct 163 ms 130036 KB Output is correct
40 Correct 153 ms 130036 KB Output is correct
41 Correct 153 ms 130036 KB Output is correct
42 Correct 96 ms 128056 KB Output is correct
43 Correct 79 ms 128056 KB Output is correct
44 Correct 103 ms 128188 KB Output is correct
45 Correct 186 ms 130036 KB Output is correct
46 Correct 183 ms 130036 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 118684 KB Output is correct
2 Correct 16 ms 118684 KB Output is correct
3 Correct 26 ms 118684 KB Output is correct
4 Correct 36 ms 118684 KB Output is correct
5 Correct 36 ms 118684 KB Output is correct
6 Correct 29 ms 118684 KB Output is correct
7 Correct 29 ms 118684 KB Output is correct
8 Correct 23 ms 118816 KB Output is correct
9 Correct 33 ms 118948 KB Output is correct
10 Correct 29 ms 119212 KB Output is correct
11 Correct 39 ms 119344 KB Output is correct
12 Correct 23 ms 119212 KB Output is correct
13 Correct 26 ms 119212 KB Output is correct
14 Correct 23 ms 119344 KB Output is correct
15 Correct 39 ms 119344 KB Output is correct
16 Correct 36 ms 119740 KB Output is correct
17 Correct 43 ms 122248 KB Output is correct
18 Correct 76 ms 126868 KB Output is correct
19 Correct 89 ms 128056 KB Output is correct
20 Correct 76 ms 128188 KB Output is correct
21 Correct 33 ms 120532 KB Output is correct
22 Correct 59 ms 127000 KB Output is correct
23 Correct 76 ms 126208 KB Output is correct
24 Correct 66 ms 127660 KB Output is correct
25 Correct 83 ms 128188 KB Output is correct
26 Correct 89 ms 128056 KB Output is correct
27 Correct 63 ms 128056 KB Output is correct
28 Correct 73 ms 128188 KB Output is correct
29 Correct 99 ms 128056 KB Output is correct
30 Correct 99 ms 128056 KB Output is correct
31 Correct 103 ms 128056 KB Output is correct
32 Correct 83 ms 128056 KB Output is correct
33 Correct 106 ms 128188 KB Output is correct
34 Correct 113 ms 128188 KB Output is correct
35 Correct 123 ms 127000 KB Output is correct
36 Correct 79 ms 124096 KB Output is correct
37 Correct 153 ms 129376 KB Output is correct
38 Correct 129 ms 130036 KB Output is correct
39 Correct 149 ms 130036 KB Output is correct
40 Correct 149 ms 130036 KB Output is correct
41 Correct 173 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 93 ms 128188 KB Output is correct
45 Correct 186 ms 130036 KB Output is correct
46 Correct 199 ms 130036 KB Output is correct
47 Correct 726 ms 180328 KB Output is correct
48 Correct 646 ms 228508 KB Output is correct
49 Correct 673 ms 238408 KB Output is correct
50 Correct 666 ms 249628 KB Output is correct
51 Correct 839 ms 261112 KB Output is correct
52 Correct 946 ms 261112 KB Output is correct
53 Correct 759 ms 259924 KB Output is correct
54 Correct 773 ms 258340 KB Output is correct
55 Correct 673 ms 258340 KB Output is correct
56 Correct 753 ms 260716 KB Output is correct
57 Correct 999 ms 258604 KB Output is correct
58 Incorrect 796 ms 258340 KB Output isn't correct
59 Halted 0 ms 0 KB -