oj.uz

Submission #355207

# Submission time Handle Problem Language Result Execution time Memory
355207 2021-01-22T10:14:00 Z Pety Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 2 ms 1908 KB 
#include <bits/stdc++.h>

using namespace std;

int n, m, dist[30002], poz;
set<int>s[30002];
bool viz[30002];

int main()
{
  cin >> n >> m;
  priority_queue<pair<int, int> > q;
  for (int i = 0; i < m; i++) {
    int b, p;
    cin >> b >> p;
    if (i == 1)
      poz = b;
    s[b].insert(p);
    if (i == 0)
      q.push({0, b});
  }
  fill(dist + 1, dist + n + 1, 1e9);
  dist[q.top().second] = 0;
  while (!q.empty()) {
    auto x = q.top();
    q.pop();
    if (x.second == poz)
      break;
    for (auto it : s[x.second]) {
      for (int i = x.second; i <= n; i += it) {
        if (s[i].size() && dist[i] > dist[x.second] + (i - x.second) / it) {
          dist[i] = dist[x.second] + (i - x.second) / it;
          q.push({dist[i], i});
        }
      }
      for (int i = x.second; i >= 1; i -= it) {
        if (s[i].size() && dist[i] > dist[x.second] + (x.second) - i / it) {
          dist[i] = dist[x.second] + (x.second - i) / it;
          q.push({dist[i], i});
        }
      }
    }
  }
  if (dist[poz] == 1e9)
    dist[poz] = -1;
  cout << dist[poz];
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1772 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 1 ms 1772 KB Output is correct
4 Correct 2 ms 1908 KB Output is correct
5 Correct 2 ms 1772 KB Output is correct
6 Correct 1 ms 1772 KB Output is correct
7 Correct 1 ms 1772 KB Output is correct
8 Correct 1 ms 1772 KB Output is correct
9 Incorrect 2 ms 1772 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1772 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 2 ms 1772 KB Output is correct
4 Correct 1 ms 1772 KB Output is correct
5 Correct 2 ms 1772 KB Output is correct
6 Correct 2 ms 1772 KB Output is correct
7 Correct 1 ms 1772 KB Output is correct
8 Correct 1 ms 1772 KB Output is correct
9 Incorrect 2 ms 1772 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1772 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 1 ms 1772 KB Output is correct
4 Correct 1 ms 1772 KB Output is correct
5 Correct 1 ms 1772 KB Output is correct
6 Correct 1 ms 1772 KB Output is correct
7 Correct 1 ms 1772 KB Output is correct
8 Correct 2 ms 1772 KB Output is correct
9 Incorrect 2 ms 1908 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1776 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 1 ms 1772 KB Output is correct
4 Correct 1 ms 1772 KB Output is correct
5 Correct 1 ms 1772 KB Output is correct
6 Correct 2 ms 1772 KB Output is correct
7 Correct 2 ms 1772 KB Output is correct
8 Correct 2 ms 1772 KB Output is correct
9 Incorrect 2 ms 1772 KB Output isn't correct
10 Halted 0 ms 0 KB -