답안 #28033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
28033 2017-07-15T00:35:01 Z sampriti Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
713 ms 262144 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>, char> > G[30000][LIM + 1];
int D[30000][LIM + 1];

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] = INT_MAX/2;
    }
  }

  set<pair<int, pair<int, int> > > Q;
  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] != INT_MAX/2) {
          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] == INT_MAX/2) {
    cout << -1 << endl;
  }
  else {
    cout << D[B[1]][LIM] << endl;
  }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 127532 KB Output is correct
2 Correct 39 ms 127532 KB Output is correct
3 Correct 29 ms 127532 KB Output is correct
4 Correct 26 ms 127532 KB Output is correct
5 Correct 39 ms 127532 KB Output is correct
6 Correct 19 ms 127532 KB Output is correct
7 Correct 26 ms 127532 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 127532 KB Output is correct
2 Correct 39 ms 127532 KB Output is correct
3 Correct 26 ms 127532 KB Output is correct
4 Correct 36 ms 127532 KB Output is correct
5 Correct 36 ms 127532 KB Output is correct
6 Correct 23 ms 127532 KB Output is correct
7 Correct 36 ms 127532 KB Output is correct
8 Correct 29 ms 127664 KB Output is correct
9 Correct 36 ms 127796 KB Output is correct
10 Correct 36 ms 128060 KB Output is correct
11 Correct 36 ms 128192 KB Output is correct
12 Correct 26 ms 128060 KB Output is correct
13 Correct 29 ms 128060 KB Output is correct
14 Correct 26 ms 128192 KB Output is correct
15 Correct 46 ms 128192 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 127532 KB Output is correct
2 Correct 29 ms 127532 KB Output is correct
3 Correct 23 ms 127532 KB Output is correct
4 Correct 33 ms 127532 KB Output is correct
5 Correct 23 ms 127532 KB Output is correct
6 Correct 23 ms 127532 KB Output is correct
7 Correct 23 ms 127532 KB Output is correct
8 Correct 36 ms 127664 KB Output is correct
9 Correct 33 ms 127796 KB Output is correct
10 Correct 36 ms 128060 KB Output is correct
11 Correct 36 ms 128192 KB Output is correct
12 Correct 43 ms 128060 KB Output is correct
13 Correct 36 ms 128060 KB Output is correct
14 Correct 33 ms 128192 KB Output is correct
15 Correct 36 ms 128192 KB Output is correct
16 Correct 23 ms 128588 KB Output is correct
17 Correct 59 ms 131228 KB Output is correct
18 Correct 59 ms 135716 KB Output is correct
19 Correct 76 ms 136904 KB Output is correct
20 Correct 79 ms 137036 KB Output is correct
21 Correct 46 ms 129380 KB Output is correct
22 Correct 79 ms 135848 KB Output is correct
23 Correct 79 ms 135056 KB Output is correct
24 Correct 69 ms 136508 KB Output is correct
25 Correct 83 ms 137036 KB Output is correct
26 Correct 79 ms 136904 KB Output is correct
27 Correct 69 ms 136904 KB Output is correct
28 Correct 93 ms 137036 KB Output is correct
29 Correct 93 ms 136904 KB Output is correct
30 Correct 66 ms 136904 KB Output is correct
31 Correct 96 ms 136904 KB Output is correct
32 Correct 79 ms 136904 KB Output is correct
33 Correct 106 ms 137036 KB Output is correct
34 Correct 116 ms 137036 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 127532 KB Output is correct
2 Correct 33 ms 127532 KB Output is correct
3 Correct 36 ms 127532 KB Output is correct
4 Correct 43 ms 127532 KB Output is correct
5 Correct 13 ms 127532 KB Output is correct
6 Correct 23 ms 127532 KB Output is correct
7 Correct 26 ms 127532 KB Output is correct
8 Correct 29 ms 127664 KB Output is correct
9 Correct 13 ms 127796 KB Output is correct
10 Correct 29 ms 128060 KB Output is correct
11 Correct 19 ms 128192 KB Output is correct
12 Correct 29 ms 128060 KB Output is correct
13 Correct 33 ms 128060 KB Output is correct
14 Correct 33 ms 128192 KB Output is correct
15 Correct 29 ms 128192 KB Output is correct
16 Correct 33 ms 128588 KB Output is correct
17 Correct 49 ms 131228 KB Output is correct
18 Correct 83 ms 135716 KB Output is correct
19 Correct 76 ms 136904 KB Output is correct
20 Correct 89 ms 137036 KB Output is correct
21 Correct 29 ms 129380 KB Output is correct
22 Correct 79 ms 135848 KB Output is correct
23 Correct 76 ms 135056 KB Output is correct
24 Correct 83 ms 136508 KB Output is correct
25 Correct 96 ms 137036 KB Output is correct
26 Correct 79 ms 136904 KB Output is correct
27 Correct 79 ms 136904 KB Output is correct
28 Correct 79 ms 137036 KB Output is correct
29 Correct 86 ms 136904 KB Output is correct
30 Correct 96 ms 136904 KB Output is correct
31 Correct 69 ms 136904 KB Output is correct
32 Correct 76 ms 136904 KB Output is correct
33 Correct 129 ms 137036 KB Output is correct
34 Correct 116 ms 137036 KB Output is correct
35 Correct 106 ms 135848 KB Output is correct
36 Correct 59 ms 132944 KB Output is correct
37 Correct 136 ms 138356 KB Output is correct
38 Correct 163 ms 139016 KB Output is correct
39 Correct 146 ms 139016 KB Output is correct
40 Correct 136 ms 139016 KB Output is correct
41 Correct 193 ms 139016 KB Output is correct
42 Correct 113 ms 136904 KB Output is correct
43 Correct 93 ms 136904 KB Output is correct
44 Correct 139 ms 137036 KB Output is correct
45 Correct 223 ms 140608 KB Output is correct
46 Correct 209 ms 140608 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 127532 KB Output is correct
2 Correct 33 ms 127532 KB Output is correct
3 Correct 23 ms 127532 KB Output is correct
4 Correct 29 ms 127532 KB Output is correct
5 Correct 33 ms 127532 KB Output is correct
6 Correct 29 ms 127532 KB Output is correct
7 Correct 29 ms 127532 KB Output is correct
8 Correct 39 ms 127664 KB Output is correct
9 Correct 29 ms 127796 KB Output is correct
10 Correct 36 ms 128060 KB Output is correct
11 Correct 29 ms 128192 KB Output is correct
12 Correct 43 ms 128060 KB Output is correct
13 Correct 29 ms 128060 KB Output is correct
14 Correct 26 ms 128192 KB Output is correct
15 Correct 39 ms 128192 KB Output is correct
16 Correct 23 ms 128588 KB Output is correct
17 Correct 49 ms 131228 KB Output is correct
18 Correct 56 ms 135716 KB Output is correct
19 Correct 59 ms 136904 KB Output is correct
20 Correct 89 ms 137036 KB Output is correct
21 Correct 39 ms 129380 KB Output is correct
22 Correct 76 ms 135848 KB Output is correct
23 Correct 79 ms 135056 KB Output is correct
24 Correct 79 ms 136508 KB Output is correct
25 Correct 89 ms 137036 KB Output is correct
26 Correct 86 ms 136904 KB Output is correct
27 Correct 79 ms 136904 KB Output is correct
28 Correct 69 ms 137036 KB Output is correct
29 Correct 123 ms 136904 KB Output is correct
30 Correct 63 ms 136904 KB Output is correct
31 Correct 96 ms 136904 KB Output is correct
32 Correct 79 ms 136904 KB Output is correct
33 Correct 99 ms 137036 KB Output is correct
34 Correct 113 ms 137036 KB Output is correct
35 Correct 109 ms 135848 KB Output is correct
36 Correct 63 ms 132944 KB Output is correct
37 Correct 156 ms 138356 KB Output is correct
38 Correct 146 ms 139016 KB Output is correct
39 Correct 129 ms 139016 KB Output is correct
40 Correct 136 ms 139016 KB Output is correct
41 Correct 186 ms 139016 KB Output is correct
42 Correct 96 ms 136904 KB Output is correct
43 Correct 93 ms 136904 KB Output is correct
44 Correct 86 ms 137036 KB Output is correct
45 Correct 193 ms 140608 KB Output is correct
46 Correct 179 ms 140608 KB Output is correct
47 Correct 639 ms 189836 KB Output is correct
48 Correct 536 ms 237620 KB Output is correct
49 Correct 706 ms 247520 KB Output is correct
50 Correct 673 ms 258872 KB Output is correct
51 Memory limit exceeded 713 ms 262144 KB Memory limit exceeded
52 Halted 0 ms 0 KB -