답안 #28044 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
28044	2017-07-15T02:58:27 Z	sampriti	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	969 ms	261800 KB

skyscraper

#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>, unsigned char> > G[30000][LIM + 1];
unsigned short D[30000][LIM + 1];
set<pair<unsigned short, pair<short, short> > > Q;

int main() {
  ios::sync_with_stdio(false); cin.tie(0);

  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] = USHRT_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;

    if(i == B[1] && j == LIM) break;

    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] != USHRT_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] == USHRT_MAX) {
    cout << -1 << endl;
  }
  else {
    cout << D[B[1]][LIM] << endl;
  }
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	26 ms	118844 KB	Output is correct
2	Correct	29 ms	118844 KB	Output is correct
3	Correct	36 ms	118844 KB	Output is correct
4	Correct	29 ms	118844 KB	Output is correct
5	Correct	23 ms	118844 KB	Output is correct
6	Correct	33 ms	118844 KB	Output is correct
7	Correct	26 ms	118844 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	118844 KB	Output is correct
2	Correct	19 ms	118844 KB	Output is correct
3	Correct	29 ms	118844 KB	Output is correct
4	Correct	36 ms	118844 KB	Output is correct
5	Correct	23 ms	118844 KB	Output is correct
6	Correct	29 ms	118844 KB	Output is correct
7	Correct	16 ms	118844 KB	Output is correct
8	Correct	36 ms	118976 KB	Output is correct
9	Correct	23 ms	119108 KB	Output is correct
10	Correct	19 ms	119372 KB	Output is correct
11	Correct	39 ms	119372 KB	Output is correct
12	Correct	33 ms	119240 KB	Output is correct
13	Correct	33 ms	119240 KB	Output is correct
14	Correct	29 ms	119504 KB	Output is correct
15	Correct	33 ms	119504 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	118844 KB	Output is correct
2	Correct	29 ms	118844 KB	Output is correct
3	Correct	16 ms	118844 KB	Output is correct
4	Correct	19 ms	118844 KB	Output is correct
5	Correct	23 ms	118844 KB	Output is correct
6	Correct	26 ms	118844 KB	Output is correct
7	Correct	29 ms	118844 KB	Output is correct
8	Correct	29 ms	118976 KB	Output is correct
9	Correct	26 ms	119108 KB	Output is correct
10	Correct	26 ms	119372 KB	Output is correct
11	Correct	39 ms	119372 KB	Output is correct
12	Correct	36 ms	119240 KB	Output is correct
13	Correct	29 ms	119240 KB	Output is correct
14	Correct	29 ms	119504 KB	Output is correct
15	Correct	23 ms	119504 KB	Output is correct
16	Correct	23 ms	119768 KB	Output is correct
17	Correct	56 ms	122408 KB	Output is correct
18	Correct	66 ms	127028 KB	Output is correct
19	Correct	59 ms	128216 KB	Output is correct
20	Correct	53 ms	128216 KB	Output is correct
21	Correct	29 ms	120692 KB	Output is correct
22	Correct	76 ms	127160 KB	Output is correct
23	Correct	63 ms	126368 KB	Output is correct
24	Correct	73 ms	127820 KB	Output is correct
25	Correct	83 ms	128216 KB	Output is correct
26	Correct	83 ms	128084 KB	Output is correct
27	Correct	76 ms	128084 KB	Output is correct
28	Correct	76 ms	128216 KB	Output is correct
29	Correct	99 ms	128216 KB	Output is correct
30	Correct	76 ms	128084 KB	Output is correct
31	Correct	79 ms	128216 KB	Output is correct
32	Correct	83 ms	128216 KB	Output is correct
33	Correct	119 ms	128348 KB	Output is correct
34	Correct	89 ms	128348 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	118844 KB	Output is correct
2	Correct	29 ms	118844 KB	Output is correct
3	Correct	23 ms	118844 KB	Output is correct
4	Correct	39 ms	118844 KB	Output is correct
5	Correct	49 ms	118844 KB	Output is correct
6	Correct	36 ms	118844 KB	Output is correct
7	Correct	26 ms	118844 KB	Output is correct
8	Correct	26 ms	118976 KB	Output is correct
9	Correct	26 ms	119108 KB	Output is correct
10	Correct	33 ms	119372 KB	Output is correct
11	Correct	36 ms	119372 KB	Output is correct
12	Correct	49 ms	119240 KB	Output is correct
13	Correct	36 ms	119240 KB	Output is correct
14	Correct	29 ms	119504 KB	Output is correct
15	Correct	29 ms	119504 KB	Output is correct
16	Correct	26 ms	119768 KB	Output is correct
17	Correct	53 ms	122408 KB	Output is correct
18	Correct	73 ms	127028 KB	Output is correct
19	Correct	89 ms	128216 KB	Output is correct
20	Correct	76 ms	128216 KB	Output is correct
21	Correct	33 ms	120692 KB	Output is correct
22	Correct	83 ms	127160 KB	Output is correct
23	Correct	69 ms	126368 KB	Output is correct
24	Correct	66 ms	127820 KB	Output is correct
25	Correct	83 ms	128216 KB	Output is correct
26	Correct	56 ms	128084 KB	Output is correct
27	Correct	69 ms	128084 KB	Output is correct
28	Correct	73 ms	128216 KB	Output is correct
29	Correct	106 ms	128216 KB	Output is correct
30	Correct	83 ms	128084 KB	Output is correct
31	Correct	99 ms	128216 KB	Output is correct
32	Correct	86 ms	128216 KB	Output is correct
33	Correct	103 ms	128348 KB	Output is correct
34	Correct	89 ms	128348 KB	Output is correct
35	Correct	79 ms	127160 KB	Output is correct
36	Correct	59 ms	124124 KB	Output is correct
37	Correct	93 ms	129536 KB	Output is correct
38	Correct	93 ms	130064 KB	Output is correct
39	Correct	96 ms	130064 KB	Output is correct
40	Correct	96 ms	130064 KB	Output is correct
41	Correct	93 ms	130064 KB	Output is correct
42	Correct	79 ms	128084 KB	Output is correct
43	Correct	89 ms	128084 KB	Output is correct
44	Correct	99 ms	128216 KB	Output is correct
45	Correct	173 ms	130196 KB	Output is correct
46	Correct	116 ms	130196 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	33 ms	118844 KB	Output is correct
2	Correct	29 ms	118844 KB	Output is correct
3	Correct	29 ms	118844 KB	Output is correct
4	Correct	23 ms	118844 KB	Output is correct
5	Correct	23 ms	118844 KB	Output is correct
6	Correct	26 ms	118844 KB	Output is correct
7	Correct	29 ms	118844 KB	Output is correct
8	Correct	19 ms	118976 KB	Output is correct
9	Correct	26 ms	119108 KB	Output is correct
10	Correct	33 ms	119372 KB	Output is correct
11	Correct	16 ms	119372 KB	Output is correct
12	Correct	33 ms	119240 KB	Output is correct
13	Correct	33 ms	119240 KB	Output is correct
14	Correct	36 ms	119504 KB	Output is correct
15	Correct	26 ms	119504 KB	Output is correct
16	Correct	26 ms	119768 KB	Output is correct
17	Correct	39 ms	122408 KB	Output is correct
18	Correct	73 ms	127028 KB	Output is correct
19	Correct	79 ms	128216 KB	Output is correct
20	Correct	69 ms	128216 KB	Output is correct
21	Correct	29 ms	120692 KB	Output is correct
22	Correct	73 ms	127160 KB	Output is correct
23	Correct	56 ms	126368 KB	Output is correct
24	Correct	73 ms	127820 KB	Output is correct
25	Correct	69 ms	128216 KB	Output is correct
26	Correct	66 ms	128084 KB	Output is correct
27	Correct	79 ms	128084 KB	Output is correct
28	Correct	86 ms	128216 KB	Output is correct
29	Correct	86 ms	128216 KB	Output is correct
30	Correct	76 ms	128084 KB	Output is correct
31	Correct	79 ms	128216 KB	Output is correct
32	Correct	83 ms	128216 KB	Output is correct
33	Correct	113 ms	128348 KB	Output is correct
34	Correct	89 ms	128348 KB	Output is correct
35	Correct	83 ms	127160 KB	Output is correct
36	Correct	53 ms	124124 KB	Output is correct
37	Correct	99 ms	129536 KB	Output is correct
38	Correct	96 ms	130064 KB	Output is correct
39	Correct	106 ms	130064 KB	Output is correct
40	Correct	106 ms	130064 KB	Output is correct
41	Correct	106 ms	130064 KB	Output is correct
42	Correct	89 ms	128084 KB	Output is correct
43	Correct	79 ms	128084 KB	Output is correct
44	Correct	83 ms	128216 KB	Output is correct
45	Correct	169 ms	130196 KB	Output is correct
46	Correct	149 ms	130196 KB	Output is correct
47	Correct	366 ms	180488 KB	Output is correct
48	Correct	616 ms	228668 KB	Output is correct
49	Correct	666 ms	238436 KB	Output is correct
50	Correct	726 ms	249788 KB	Output is correct
51	Correct	763 ms	261272 KB	Output is correct
52	Correct	969 ms	261272 KB	Output is correct
53	Correct	806 ms	259952 KB	Output is correct
54	Correct	766 ms	258500 KB	Output is correct
55	Correct	686 ms	258500 KB	Output is correct
56	Correct	713 ms	260876 KB	Output is correct
57	Correct	706 ms	258632 KB	Output is correct
58	Correct	833 ms	258500 KB	Output is correct
59	Correct	779 ms	258500 KB	Output is correct
60	Correct	809 ms	258500 KB	Output is correct
61	Correct	786 ms	258632 KB	Output is correct
62	Incorrect	843 ms	261800 KB	Output isn't correct
63	Halted	0 ms	0 KB	-

답안 #28044

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0