oj.uz

Submission #66653

# Submission time Handle Problem Language Result Execution time Memory
66653 2018-08-12T00:31:48 Z tincamatei Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 56980 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];

int dijkstra(int n, int src, int dest) {
  priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq;
  memset(dist, 0x3f3f3f3f, sizeof(dist));
  dist[src] = 0;
  pq.push(make_pair(0, src));
  while(!pq.empty()) {
    int nod = pq.top().second, distNod = pq.top().first;
    pq.pop();

    if(dist[nod] == distNod) {
      if(nod == dest)
        return distNod;
      for(auto it: graph[nod])
      if(distNod + it.second < dist[it.first]) {
        dist[it.first] = distNod + it.second;
        pq.push(make_pair(dist[it.first], it.first));
      }
    }
  }

  return -1;
}

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 1148 KB Output is correct
2 Correct 3 ms 1148 KB Output is correct
3 Correct 4 ms 1340 KB Output is correct
4 Correct 3 ms 1340 KB Output is correct
5 Correct 3 ms 1340 KB Output is correct
6 Correct 4 ms 1340 KB Output is correct
7 Correct 4 ms 1340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1340 KB Output is correct
2 Correct 3 ms 1380 KB Output is correct
3 Correct 3 ms 1380 KB Output is correct
4 Correct 2 ms 1380 KB Output is correct
5 Correct 3 ms 1384 KB Output is correct
6 Correct 3 ms 1384 KB Output is correct
7 Correct 3 ms 1384 KB Output is correct
8 Correct 3 ms 1384 KB Output is correct
9 Correct 3 ms 1384 KB Output is correct
10 Correct 3 ms 1508 KB Output is correct
11 Correct 6 ms 1764 KB Output is correct
12 Correct 3 ms 1764 KB Output is correct
13 Correct 4 ms 1764 KB Output is correct
14 Correct 7 ms 1764 KB Output is correct
15 Correct 6 ms 1928 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1928 KB Output is correct
2 Correct 3 ms 1928 KB Output is correct
3 Correct 3 ms 1928 KB Output is correct
4 Correct 3 ms 1928 KB Output is correct
5 Correct 3 ms 1928 KB Output is correct
6 Correct 3 ms 1928 KB Output is correct
7 Correct 3 ms 1928 KB Output is correct
8 Correct 3 ms 1928 KB Output is correct
9 Correct 3 ms 1928 KB Output is correct
10 Correct 4 ms 1928 KB Output is correct
11 Correct 6 ms 1928 KB Output is correct
12 Correct 3 ms 1928 KB Output is correct
13 Correct 3 ms 1928 KB Output is correct
14 Correct 5 ms 1928 KB Output is correct
15 Correct 6 ms 1928 KB Output is correct
16 Correct 4 ms 1928 KB Output is correct
17 Correct 10 ms 2492 KB Output is correct
18 Correct 7 ms 2492 KB Output is correct
19 Correct 4 ms 2492 KB Output is correct
20 Correct 5 ms 2492 KB Output is correct
21 Correct 4 ms 2492 KB Output is correct
22 Correct 7 ms 2492 KB Output is correct
23 Correct 5 ms 2492 KB Output is correct
24 Correct 10 ms 2492 KB Output is correct
25 Correct 7 ms 2492 KB Output is correct
26 Correct 7 ms 2492 KB Output is correct
27 Correct 7 ms 2492 KB Output is correct
28 Correct 12 ms 3068 KB Output is correct
29 Correct 43 ms 6012 KB Output is correct
30 Correct 12 ms 6012 KB Output is correct
31 Correct 20 ms 6012 KB Output is correct
32 Correct 13 ms 6012 KB Output is correct
33 Correct 99 ms 10364 KB Output is correct
34 Correct 119 ms 10364 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10364 KB Output is correct
2 Correct 4 ms 10364 KB Output is correct
3 Correct 3 ms 10364 KB Output is correct
4 Correct 3 ms 10364 KB Output is correct
5 Correct 3 ms 10364 KB Output is correct
6 Correct 3 ms 10364 KB Output is correct
7 Correct 3 ms 10364 KB Output is correct
8 Correct 3 ms 10364 KB Output is correct
9 Correct 3 ms 10364 KB Output is correct
10 Correct 3 ms 10364 KB Output is correct
11 Correct 5 ms 10364 KB Output is correct
12 Correct 3 ms 10364 KB Output is correct
13 Correct 4 ms 10364 KB Output is correct
14 Correct 6 ms 10364 KB Output is correct
15 Correct 6 ms 10364 KB Output is correct
16 Correct 4 ms 10364 KB Output is correct
17 Correct 9 ms 10364 KB Output is correct
18 Correct 8 ms 10364 KB Output is correct
19 Correct 4 ms 10364 KB Output is correct
20 Correct 4 ms 10364 KB Output is correct
21 Correct 3 ms 10364 KB Output is correct
22 Correct 4 ms 10364 KB Output is correct
23 Correct 5 ms 10364 KB Output is correct
24 Correct 9 ms 10364 KB Output is correct
25 Correct 6 ms 10364 KB Output is correct
26 Correct 6 ms 10364 KB Output is correct
27 Correct 5 ms 10364 KB Output is correct
28 Correct 11 ms 10364 KB Output is correct
29 Correct 35 ms 10364 KB Output is correct
30 Correct 10 ms 10364 KB Output is correct
31 Correct 17 ms 10364 KB Output is correct
32 Correct 19 ms 10364 KB Output is correct
33 Correct 120 ms 10444 KB Output is correct
34 Correct 91 ms 10492 KB Output is correct
35 Correct 77 ms 10492 KB Output is correct
36 Correct 11 ms 10492 KB Output is correct
37 Correct 154 ms 14332 KB Output is correct
38 Correct 177 ms 14332 KB Output is correct
39 Correct 171 ms 14332 KB Output is correct
40 Correct 147 ms 14332 KB Output is correct
41 Correct 144 ms 14332 KB Output is correct
42 Correct 12 ms 14332 KB Output is correct
43 Correct 10 ms 14332 KB Output is correct
44 Correct 13 ms 14332 KB Output is correct
45 Correct 751 ms 36220 KB Output is correct
46 Correct 804 ms 36220 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 36220 KB Output is correct
2 Correct 3 ms 36220 KB Output is correct
3 Correct 3 ms 36220 KB Output is correct
4 Correct 3 ms 36220 KB Output is correct
5 Correct 3 ms 36220 KB Output is correct
6 Correct 3 ms 36220 KB Output is correct
7 Correct 3 ms 36220 KB Output is correct
8 Correct 3 ms 36220 KB Output is correct
9 Correct 3 ms 36220 KB Output is correct
10 Correct 4 ms 36220 KB Output is correct
11 Correct 7 ms 36220 KB Output is correct
12 Correct 4 ms 36220 KB Output is correct
13 Correct 3 ms 36220 KB Output is correct
14 Correct 6 ms 36220 KB Output is correct
15 Correct 5 ms 36220 KB Output is correct
16 Correct 4 ms 36220 KB Output is correct
17 Correct 9 ms 36220 KB Output is correct
18 Correct 6 ms 36220 KB Output is correct
19 Correct 4 ms 36220 KB Output is correct
20 Correct 5 ms 36220 KB Output is correct
21 Correct 4 ms 36220 KB Output is correct
22 Correct 5 ms 36220 KB Output is correct
23 Correct 6 ms 36220 KB Output is correct
24 Correct 9 ms 36220 KB Output is correct
25 Correct 6 ms 36220 KB Output is correct
26 Correct 7 ms 36220 KB Output is correct
27 Correct 5 ms 36220 KB Output is correct
28 Correct 12 ms 36220 KB Output is correct
29 Correct 37 ms 36220 KB Output is correct
30 Correct 11 ms 36220 KB Output is correct
31 Correct 19 ms 36220 KB Output is correct
32 Correct 13 ms 36220 KB Output is correct
33 Correct 88 ms 36220 KB Output is correct
34 Correct 81 ms 36220 KB Output is correct
35 Correct 127 ms 36220 KB Output is correct
36 Correct 12 ms 36220 KB Output is correct
37 Correct 154 ms 36220 KB Output is correct
38 Correct 153 ms 36220 KB Output is correct
39 Correct 159 ms 36220 KB Output is correct
40 Correct 161 ms 36220 KB Output is correct
41 Correct 157 ms 36220 KB Output is correct
42 Correct 12 ms 36220 KB Output is correct
43 Correct 17 ms 36220 KB Output is correct
44 Correct 18 ms 36220 KB Output is correct
45 Correct 675 ms 36220 KB Output is correct
46 Correct 599 ms 36232 KB Output is correct
47 Execution timed out 1082 ms 56980 KB Time limit exceeded
48 Halted 0 ms 0 KB -