oj.uz

답안 #229620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229620 2020-05-05T11:43:47 Z Nightlight Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 901 ms 56564 KB 
#include <queue>
#include <cstdio>
#include <tuple>
#include <cstring>
#include <iostream>
#define pii pair<int, int>
#define piii tuple<int, int, int>
#define mt make_tuple
#define push_back emplace_back
using namespace std;

int N, M;
pii A[30005];
int dist[30005][180];
int vis[30005][180];
vector<pii> adj[30005];
vector<int> dog[30005];

void BFS() {
  priority_queue <piii, vector<piii>, greater<piii>> pq; 
  memset(dist, 0x3f3f3f3f, sizeof(dist));
  pq.push(make_tuple(0, A[0].first, 0));
  dist[A[0].first][0] = 0;
  int u, mov; int trav;
  while(!pq.empty()) {
    tie(trav, u, mov) = pq.top();
    pq.pop();
    if(dist[u][mov] < trav) continue;
    if(mov != 0) {
      if(u - mov >= 0 && trav + 1 < dist[u - mov][mov]) {
        dist[u - mov][mov] = trav + 1;
        pq.push(make_tuple(trav + 1, u - mov, mov));
      }
      if(u + mov <= N && trav + 1 < dist[u + mov][mov]) {
        dist[u + mov][mov] = trav + 1;
        pq.push(make_tuple(trav + 1, u + mov, mov));
      }
      if(dist[u][0] > trav) {
        dist[u][0] = trav;
        pq.push(make_tuple(trav, u, 0));
      }
    }else {
      int v, w;
      for(pii now : adj[u]) {
        v = now.first, w = now.second + trav;
        if(w < dist[v][0]) {
          dist[v][0] = w;
          pq.push(make_tuple(w, v, 0));
        }
      }
      for(int v : dog[u]) {
        if(trav < dist[u][v]) {
          dist[u][v] = trav;
          pq.push(make_tuple(trav, u, v));
        }
      }
    }
  }
  if(dist[A[1].first][0] == 0x3f3f3f3f) puts("-1");
  else printf("%d\n", dist[A[1].first][0]);
}

int main() {
//  freopen("out.txt", "w", stdout);
  scanf("%d %d", &N, &M);
  int pos, mov;
  for(int i = 0; i < M; i++) {
    scanf("%d %d", &pos, &mov);
    A[i] = make_pair(pos, mov);
    if(mov * mov > N) {
      for(int i = pos - mov, j = 1; i >= 0; i -= mov, j++) {
        adj[pos].push_back(i, j);
      }
      for(int i = pos + mov, j = 1; i <= N; i += mov, j++) {
        adj[pos].push_back(i, j);
      }
    }else {
      dog[pos].push_back(mov);
    }
  }
  BFS();
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:65:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &N, &M);
   ~~~~~^~~~~~~~~~~~~~~~~
skyscraper.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &pos, &mov);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 22912 KB Output is correct
2 Correct 18 ms 22912 KB Output is correct
3 Correct 17 ms 22912 KB Output is correct
4 Correct 17 ms 22912 KB Output is correct
5 Correct 17 ms 22912 KB Output is correct
6 Correct 17 ms 22912 KB Output is correct
7 Correct 16 ms 22912 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 22912 KB Output is correct
2 Correct 16 ms 22912 KB Output is correct
3 Correct 17 ms 22912 KB Output is correct
4 Correct 18 ms 22944 KB Output is correct
5 Correct 17 ms 22912 KB Output is correct
6 Correct 17 ms 22912 KB Output is correct
7 Correct 17 ms 22912 KB Output is correct
8 Correct 18 ms 22912 KB Output is correct
9 Correct 17 ms 22912 KB Output is correct
10 Correct 18 ms 22912 KB Output is correct
11 Correct 17 ms 22912 KB Output is correct
12 Correct 17 ms 22912 KB Output is correct
13 Correct 17 ms 22936 KB Output is correct
14 Correct 18 ms 22912 KB Output is correct
15 Correct 18 ms 22912 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 22912 KB Output is correct
2 Correct 18 ms 22912 KB Output is correct
3 Correct 17 ms 22912 KB Output is correct
4 Correct 18 ms 22912 KB Output is correct
5 Correct 17 ms 22912 KB Output is correct
6 Correct 17 ms 22912 KB Output is correct
7 Correct 17 ms 22912 KB Output is correct
8 Correct 17 ms 22912 KB Output is correct
9 Correct 16 ms 22912 KB Output is correct
10 Correct 17 ms 22912 KB Output is correct
11 Correct 18 ms 22944 KB Output is correct
12 Correct 18 ms 22912 KB Output is correct
13 Correct 19 ms 22912 KB Output is correct
14 Correct 18 ms 23040 KB Output is correct
15 Correct 18 ms 22912 KB Output is correct
16 Correct 17 ms 22912 KB Output is correct
17 Correct 18 ms 23040 KB Output is correct
18 Correct 17 ms 22912 KB Output is correct
19 Correct 17 ms 22912 KB Output is correct
20 Correct 19 ms 23040 KB Output is correct
21 Correct 17 ms 22912 KB Output is correct
22 Correct 17 ms 22912 KB Output is correct
23 Correct 18 ms 22912 KB Output is correct
24 Correct 19 ms 23040 KB Output is correct
25 Correct 19 ms 22912 KB Output is correct
26 Correct 18 ms 23040 KB Output is correct
27 Correct 18 ms 22912 KB Output is correct
28 Correct 18 ms 23040 KB Output is correct
29 Correct 23 ms 22912 KB Output is correct
30 Correct 19 ms 22912 KB Output is correct
31 Correct 22 ms 22960 KB Output is correct
32 Correct 19 ms 23040 KB Output is correct
33 Correct 28 ms 23552 KB Output is correct
34 Correct 29 ms 23552 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 22912 KB Output is correct
2 Correct 18 ms 22912 KB Output is correct
3 Correct 17 ms 22912 KB Output is correct
4 Correct 17 ms 22912 KB Output is correct
5 Correct 17 ms 22912 KB Output is correct
6 Correct 17 ms 22912 KB Output is correct
7 Correct 17 ms 22912 KB Output is correct
8 Correct 17 ms 22912 KB Output is correct
9 Correct 18 ms 22912 KB Output is correct
10 Correct 17 ms 22912 KB Output is correct
11 Correct 19 ms 22912 KB Output is correct
12 Correct 18 ms 22912 KB Output is correct
13 Correct 18 ms 22912 KB Output is correct
14 Correct 20 ms 23040 KB Output is correct
15 Correct 18 ms 22912 KB Output is correct
16 Correct 18 ms 22912 KB Output is correct
17 Correct 19 ms 23040 KB Output is correct
18 Correct 17 ms 22912 KB Output is correct
19 Correct 17 ms 22912 KB Output is correct
20 Correct 19 ms 23016 KB Output is correct
21 Correct 18 ms 22912 KB Output is correct
22 Correct 17 ms 22912 KB Output is correct
23 Correct 18 ms 22912 KB Output is correct
24 Correct 18 ms 23040 KB Output is correct
25 Correct 18 ms 22912 KB Output is correct
26 Correct 18 ms 22912 KB Output is correct
27 Correct 18 ms 22912 KB Output is correct
28 Correct 18 ms 23040 KB Output is correct
29 Correct 23 ms 22912 KB Output is correct
30 Correct 18 ms 22912 KB Output is correct
31 Correct 21 ms 22912 KB Output is correct
32 Correct 19 ms 23040 KB Output is correct
33 Correct 28 ms 23552 KB Output is correct
34 Correct 28 ms 23552 KB Output is correct
35 Correct 29 ms 24064 KB Output is correct
36 Correct 19 ms 23040 KB Output is correct
37 Correct 35 ms 24576 KB Output is correct
38 Correct 37 ms 24568 KB Output is correct
39 Correct 35 ms 24568 KB Output is correct
40 Correct 35 ms 24576 KB Output is correct
41 Correct 35 ms 24568 KB Output is correct
42 Correct 24 ms 23680 KB Output is correct
43 Correct 24 ms 23552 KB Output is correct
44 Correct 23 ms 23552 KB Output is correct
45 Correct 41 ms 27392 KB Output is correct
46 Correct 41 ms 27384 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 22912 KB Output is correct
2 Correct 17 ms 22912 KB Output is correct
3 Correct 17 ms 22912 KB Output is correct
4 Correct 17 ms 22912 KB Output is correct
5 Correct 17 ms 22912 KB Output is correct
6 Correct 18 ms 22912 KB Output is correct
7 Correct 17 ms 22912 KB Output is correct
8 Correct 17 ms 22912 KB Output is correct
9 Correct 16 ms 22912 KB Output is correct
10 Correct 18 ms 22912 KB Output is correct
11 Correct 18 ms 22912 KB Output is correct
12 Correct 18 ms 22912 KB Output is correct
13 Correct 17 ms 22912 KB Output is correct
14 Correct 17 ms 22912 KB Output is correct
15 Correct 17 ms 22912 KB Output is correct
16 Correct 17 ms 22912 KB Output is correct
17 Correct 18 ms 23040 KB Output is correct
18 Correct 18 ms 22912 KB Output is correct
19 Correct 17 ms 22912 KB Output is correct
20 Correct 17 ms 23040 KB Output is correct
21 Correct 17 ms 22912 KB Output is correct
22 Correct 17 ms 22912 KB Output is correct
23 Correct 18 ms 22912 KB Output is correct
24 Correct 19 ms 23040 KB Output is correct
25 Correct 20 ms 22912 KB Output is correct
26 Correct 17 ms 23040 KB Output is correct
27 Correct 18 ms 22912 KB Output is correct
28 Correct 19 ms 23168 KB Output is correct
29 Correct 24 ms 22912 KB Output is correct
30 Correct 19 ms 22912 KB Output is correct
31 Correct 21 ms 22912 KB Output is correct
32 Correct 19 ms 23040 KB Output is correct
33 Correct 29 ms 23552 KB Output is correct
34 Correct 29 ms 23552 KB Output is correct
35 Correct 29 ms 23928 KB Output is correct
36 Correct 19 ms 23040 KB Output is correct
37 Correct 33 ms 24576 KB Output is correct
38 Correct 35 ms 24576 KB Output is correct
39 Correct 35 ms 24568 KB Output is correct
40 Correct 35 ms 24576 KB Output is correct
41 Correct 35 ms 24576 KB Output is correct
42 Correct 23 ms 23552 KB Output is correct
43 Correct 24 ms 23552 KB Output is correct
44 Correct 25 ms 23544 KB Output is correct
45 Correct 40 ms 27384 KB Output is correct
46 Correct 42 ms 27648 KB Output is correct
47 Correct 102 ms 28088 KB Output is correct
48 Correct 28 ms 24448 KB Output is correct
49 Correct 27 ms 24192 KB Output is correct
50 Correct 24 ms 23936 KB Output is correct
51 Correct 71 ms 25596 KB Output is correct
52 Correct 83 ms 25656 KB Output is correct
53 Correct 31 ms 23552 KB Output is correct
54 Correct 17 ms 22912 KB Output is correct
55 Correct 17 ms 22912 KB Output is correct
56 Correct 28 ms 24320 KB Output is correct
57 Correct 93 ms 23040 KB Output is correct
58 Correct 25 ms 23416 KB Output is correct
59 Correct 28 ms 23680 KB Output is correct
60 Correct 32 ms 23800 KB Output is correct
61 Correct 28 ms 23808 KB Output is correct
62 Correct 47 ms 25720 KB Output is correct
63 Correct 100 ms 48048 KB Output is correct
64 Correct 119 ms 56564 KB Output is correct
65 Correct 392 ms 55216 KB Output is correct
66 Correct 887 ms 50604 KB Output is correct
67 Correct 901 ms 50736 KB Output is correct