oj.uz

Submission #66649

# Submission time Handle Problem Language Result Execution time Memory
66649 2018-08-12T00:06:10 Z tincamatei Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 56508 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 30000;

vector<pair<int, int> > graph[MAX_N];
map<pair<int, int>, bool> doges;

int dist[MAX_N];
bool inQueue[MAX_N];

int dijkstra(int n, int src, int dest) {
  deque<int> pq;
  memset(dist, 0x3f3f3f3f, sizeof(dist));
  dist[src] = 0;
  pq.push_back(src);
  while(!pq.empty()) {
    int nod = pq.front();
    pq.pop_front();

    for(auto it: graph[nod])
      if(dist[nod] + it.second < dist[it.first]) {
        dist[it.first] = dist[nod] + it.second;
        pq.push_back(it.first);
      }
  }

  if(dist[dest] == 0x3f3f3f3f)
    return -1;
  else
    return dist[dest];
}

int main() {
  int n, m, b, p, src, dest;
  scanf("%d%d", &n, &m);

  for(int i = 0; i < m; ++i) {
    scanf("%d%d", &b, &p);
    if(i == 0)
      src = b;
    if(i == 1)
      dest = b;
    doges[make_pair(b, p)] = true;
  }

  for(auto it: doges) {
    pair<int, int> doge = it.first;
    if(it.second) {
      int poz = doge.first - doge.second, cost = 1;
      bool foundSimilar = false;
      while(poz >= 0 && !foundSimilar) {
        graph[doge.first].push_back(make_pair(poz, cost++));
        if(doges[make_pair(poz, doge.second)])
          foundSimilar = true;
        poz -= doge.second;
      }

      poz = doge.first + doge.second, cost = 1;
      foundSimilar = false;
      while(poz < n && !foundSimilar) {
        graph[doge.first].push_back(make_pair(poz, cost++));
        if(doges[make_pair(poz, doge.second)])
          foundSimilar = true;
        poz += doge.second;
      }
    }
  }

  printf("%d", dijkstra(n, src, dest));
  return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:37: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:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &b, &p);
     ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:71:9: warning: 'dest' may be used uninitialized in this function [-Wmaybe-uninitialized]
   printf("%d", dijkstra(n, src, dest));
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:71:9: warning: 'src' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 2 ms 1144 KB Output is correct
3 Correct 2 ms 1200 KB Output is correct
4 Correct 2 ms 1236 KB Output is correct
5 Correct 3 ms 1252 KB Output is correct
6 Correct 3 ms 1252 KB Output is correct
7 Correct 3 ms 1252 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1312 KB Output is correct
2 Correct 3 ms 1312 KB Output is correct
3 Correct 2 ms 1312 KB Output is correct
4 Correct 3 ms 1388 KB Output is correct
5 Correct 3 ms 1388 KB Output is correct
6 Correct 3 ms 1388 KB Output is correct
7 Correct 2 ms 1388 KB Output is correct
8 Correct 2 ms 1388 KB Output is correct
9 Correct 4 ms 1388 KB Output is correct
10 Correct 3 ms 1516 KB Output is correct
11 Correct 5 ms 1648 KB Output is correct
12 Correct 3 ms 1648 KB Output is correct
13 Correct 3 ms 1648 KB Output is correct
14 Correct 5 ms 1772 KB Output is correct
15 Correct 8 ms 1772 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1772 KB Output is correct
2 Correct 3 ms 1772 KB Output is correct
3 Correct 3 ms 1772 KB Output is correct
4 Correct 3 ms 1772 KB Output is correct
5 Correct 3 ms 1772 KB Output is correct
6 Correct 3 ms 1772 KB Output is correct
7 Correct 2 ms 1772 KB Output is correct
8 Correct 3 ms 1772 KB Output is correct
9 Correct 3 ms 1772 KB Output is correct
10 Correct 3 ms 1772 KB Output is correct
11 Correct 5 ms 1772 KB Output is correct
12 Correct 4 ms 1772 KB Output is correct
13 Correct 3 ms 1772 KB Output is correct
14 Correct 6 ms 1788 KB Output is correct
15 Correct 7 ms 1792 KB Output is correct
16 Correct 5 ms 1792 KB Output is correct
17 Correct 10 ms 2556 KB Output is correct
18 Correct 6 ms 2556 KB Output is correct
19 Correct 4 ms 2556 KB Output is correct
20 Correct 5 ms 2556 KB Output is correct
21 Correct 4 ms 2556 KB Output is correct
22 Correct 5 ms 2556 KB Output is correct
23 Correct 6 ms 2556 KB Output is correct
24 Correct 11 ms 2556 KB Output is correct
25 Correct 9 ms 2556 KB Output is correct
26 Correct 6 ms 2556 KB Output is correct
27 Correct 5 ms 2556 KB Output is correct
28 Correct 12 ms 3068 KB Output is correct
29 Correct 36 ms 5884 KB Output is correct
30 Correct 10 ms 5884 KB Output is correct
31 Correct 16 ms 5884 KB Output is correct
32 Correct 12 ms 5884 KB Output is correct
33 Correct 114 ms 10108 KB Output is correct
34 Correct 113 ms 10108 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 10108 KB Output is correct
2 Correct 3 ms 10108 KB Output is correct
3 Correct 3 ms 10108 KB Output is correct
4 Correct 3 ms 10108 KB Output is correct
5 Correct 3 ms 10108 KB Output is correct
6 Correct 4 ms 10108 KB Output is correct
7 Correct 3 ms 10108 KB Output is correct
8 Correct 3 ms 10108 KB Output is correct
9 Correct 3 ms 10108 KB Output is correct
10 Correct 3 ms 10108 KB Output is correct
11 Correct 6 ms 10108 KB Output is correct
12 Correct 3 ms 10108 KB Output is correct
13 Correct 4 ms 10108 KB Output is correct
14 Correct 7 ms 10108 KB Output is correct
15 Correct 5 ms 10108 KB Output is correct
16 Correct 4 ms 10108 KB Output is correct
17 Correct 9 ms 10108 KB Output is correct
18 Correct 6 ms 10108 KB Output is correct
19 Correct 6 ms 10108 KB Output is correct
20 Correct 4 ms 10108 KB Output is correct
21 Correct 4 ms 10108 KB Output is correct
22 Correct 6 ms 10108 KB Output is correct
23 Correct 6 ms 10108 KB Output is correct
24 Correct 8 ms 10108 KB Output is correct
25 Correct 7 ms 10108 KB Output is correct
26 Correct 6 ms 10108 KB Output is correct
27 Correct 6 ms 10108 KB Output is correct
28 Correct 12 ms 10108 KB Output is correct
29 Correct 46 ms 10108 KB Output is correct
30 Correct 10 ms 10108 KB Output is correct
31 Correct 18 ms 10108 KB Output is correct
32 Correct 12 ms 10108 KB Output is correct
33 Correct 95 ms 10184 KB Output is correct
34 Correct 88 ms 10184 KB Output is correct
35 Correct 91 ms 10184 KB Output is correct
36 Correct 13 ms 10184 KB Output is correct
37 Correct 165 ms 14204 KB Output is correct
38 Correct 152 ms 14204 KB Output is correct
39 Correct 163 ms 14204 KB Output is correct
40 Correct 139 ms 14204 KB Output is correct
41 Correct 170 ms 14204 KB Output is correct
42 Correct 12 ms 14204 KB Output is correct
43 Correct 10 ms 14204 KB Output is correct
44 Correct 10 ms 14204 KB Output is correct
45 Correct 734 ms 35816 KB Output is correct
46 Correct 538 ms 35952 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 35952 KB Output is correct
2 Correct 3 ms 35952 KB Output is correct
3 Correct 4 ms 35952 KB Output is correct
4 Correct 4 ms 35952 KB Output is correct
5 Correct 3 ms 35952 KB Output is correct
6 Correct 4 ms 35952 KB Output is correct
7 Correct 3 ms 35952 KB Output is correct
8 Correct 3 ms 35952 KB Output is correct
9 Correct 4 ms 35952 KB Output is correct
10 Correct 4 ms 35952 KB Output is correct
11 Correct 5 ms 35952 KB Output is correct
12 Correct 4 ms 35952 KB Output is correct
13 Correct 4 ms 35952 KB Output is correct
14 Correct 5 ms 35952 KB Output is correct
15 Correct 5 ms 35952 KB Output is correct
16 Correct 5 ms 35952 KB Output is correct
17 Correct 11 ms 35952 KB Output is correct
18 Correct 5 ms 35952 KB Output is correct
19 Correct 4 ms 35952 KB Output is correct
20 Correct 6 ms 35952 KB Output is correct
21 Correct 4 ms 35952 KB Output is correct
22 Correct 7 ms 35952 KB Output is correct
23 Correct 5 ms 35952 KB Output is correct
24 Correct 9 ms 35952 KB Output is correct
25 Correct 6 ms 35952 KB Output is correct
26 Correct 5 ms 35952 KB Output is correct
27 Correct 5 ms 35952 KB Output is correct
28 Correct 13 ms 35952 KB Output is correct
29 Correct 33 ms 35952 KB Output is correct
30 Correct 9 ms 35952 KB Output is correct
31 Correct 18 ms 35952 KB Output is correct
32 Correct 13 ms 35952 KB Output is correct
33 Correct 106 ms 35952 KB Output is correct
34 Correct 82 ms 35952 KB Output is correct
35 Correct 79 ms 35952 KB Output is correct
36 Correct 13 ms 35952 KB Output is correct
37 Correct 204 ms 35952 KB Output is correct
38 Correct 165 ms 35952 KB Output is correct
39 Correct 138 ms 35952 KB Output is correct
40 Correct 169 ms 35952 KB Output is correct
41 Correct 148 ms 35952 KB Output is correct
42 Correct 19 ms 35952 KB Output is correct
43 Correct 10 ms 35952 KB Output is correct
44 Correct 12 ms 35952 KB Output is correct
45 Correct 655 ms 35952 KB Output is correct
46 Correct 707 ms 35952 KB Output is correct
47 Execution timed out 1067 ms 56508 KB Time limit exceeded
48 Halted 0 ms 0 KB -