oj.uz

Submission #243346

# Submission time Handle Problem Language Result Execution time Memory
243346 2020-07-01T00:14:47 Z neihcr7j Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 417 ms 262148 KB 
#include<bits/stdc++.h>

#define oo 1000000000
#define maxn 30004

using namespace std;
typedef long long ll;

int n, m;

int b[maxn], p[maxn];
vector < pair < int, int > > g[maxn];

set < int > s[maxn];

int d[maxn];

int main(){
  #define TASK "ABC"
  //freopen(TASK".inp", "r", stdin); freopen(TASK".out", "w", stdout);
  ios_base::sync_with_stdio(0);

  cin >> n >> m;

  for (int i = 0; i < m; ++i) {
    cin >> b[i] >> p[i];
    s[b[i]].insert(p[i]);
  }

  for (int i = 0; i < m; ++i)
    for (int  j = b[i] + p[i]; j < n; j += p[i]) {
      g[b[i]].push_back({j, (j - b[i]) / p[i]});
      if (s[j].find(p[i]) != s[j].end())
        break;
    }

  for (int i = 0; i < m; ++i)
    for (int  j = b[i] - p[i]; j >= 0; j -= p[i]) {
      g[b[i]].push_back({j, (b[i] - j) / p[i]});
      if (s[j].find(p[i]) != s[j].end())
        break;
    }

  priority_queue < pair < int, int > > p;

  fill(d, d + n + 1, oo);

  d[b[0]] = 0;

  p.push({0, b[0]});

  while (!p.empty()) {
    int u = p.top().second; p.pop();

    for (auto i : g[u]) {
      int v = i.first, w = i.second;

      if (d[v] > d[u] + w) {
        d[v] = d[u] + w;
        p.push({-d[v], v});
      }
    }
  }

  cout << (d[b[1]] == oo ? -1 : d[b[1]]);

  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2432 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct
3 Correct 6 ms 2432 KB Output is correct
4 Correct 6 ms 2432 KB Output is correct
5 Correct 6 ms 2432 KB Output is correct
6 Correct 6 ms 2432 KB Output is correct
7 Correct 6 ms 2432 KB Output is correct
8 Correct 6 ms 2432 KB Output is correct
9 Correct 6 ms 2432 KB Output is correct
10 Correct 6 ms 2560 KB Output is correct
11 Correct 6 ms 2560 KB Output is correct
12 Correct 10 ms 4728 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 7 ms 2560 KB Output is correct
15 Correct 8 ms 2560 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2432 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct
3 Correct 6 ms 2432 KB Output is correct
4 Correct 6 ms 2432 KB Output is correct
5 Correct 7 ms 2432 KB Output is correct
6 Correct 6 ms 2560 KB Output is correct
7 Correct 6 ms 2432 KB Output is correct
8 Correct 6 ms 2432 KB Output is correct
9 Correct 6 ms 2432 KB Output is correct
10 Correct 6 ms 2560 KB Output is correct
11 Correct 7 ms 2560 KB Output is correct
12 Correct 10 ms 4728 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 7 ms 2560 KB Output is correct
15 Correct 6 ms 2560 KB Output is correct
16 Correct 6 ms 2560 KB Output is correct
17 Correct 7 ms 2816 KB Output is correct
18 Correct 6 ms 2560 KB Output is correct
19 Correct 6 ms 2560 KB Output is correct
20 Correct 7 ms 2688 KB Output is correct
21 Correct 7 ms 2560 KB Output is correct
22 Correct 6 ms 2560 KB Output is correct
23 Correct 7 ms 2688 KB Output is correct
24 Correct 7 ms 2816 KB Output is correct
25 Correct 7 ms 2688 KB Output is correct
26 Correct 76 ms 35644 KB Output is correct
27 Correct 72 ms 35532 KB Output is correct
28 Correct 7 ms 2816 KB Output is correct
29 Correct 8 ms 3328 KB Output is correct
30 Correct 7 ms 2816 KB Output is correct
31 Correct 8 ms 2944 KB Output is correct
32 Correct 7 ms 2816 KB Output is correct
33 Correct 10 ms 3968 KB Output is correct
34 Correct 10 ms 3968 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2432 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct
3 Correct 6 ms 2432 KB Output is correct
4 Correct 6 ms 2432 KB Output is correct
5 Correct 6 ms 2432 KB Output is correct
6 Correct 6 ms 2432 KB Output is correct
7 Correct 6 ms 2432 KB Output is correct
8 Correct 6 ms 2432 KB Output is correct
9 Correct 6 ms 2432 KB Output is correct
10 Correct 6 ms 2432 KB Output is correct
11 Correct 7 ms 2688 KB Output is correct
12 Correct 10 ms 4728 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 6 ms 2560 KB Output is correct
15 Correct 7 ms 2560 KB Output is correct
16 Correct 6 ms 2560 KB Output is correct
17 Correct 7 ms 2816 KB Output is correct
18 Correct 6 ms 2560 KB Output is correct
19 Correct 6 ms 2560 KB Output is correct
20 Correct 7 ms 2688 KB Output is correct
21 Correct 6 ms 2560 KB Output is correct
22 Correct 6 ms 2560 KB Output is correct
23 Correct 7 ms 2688 KB Output is correct
24 Correct 7 ms 2816 KB Output is correct
25 Correct 7 ms 2688 KB Output is correct
26 Correct 81 ms 35516 KB Output is correct
27 Correct 73 ms 35532 KB Output is correct
28 Correct 8 ms 2816 KB Output is correct
29 Correct 8 ms 3328 KB Output is correct
30 Correct 7 ms 2816 KB Output is correct
31 Correct 7 ms 2944 KB Output is correct
32 Correct 7 ms 2816 KB Output is correct
33 Correct 10 ms 3968 KB Output is correct
34 Correct 10 ms 3968 KB Output is correct
35 Correct 22 ms 5120 KB Output is correct
36 Correct 9 ms 2944 KB Output is correct
37 Correct 28 ms 5888 KB Output is correct
38 Correct 29 ms 6272 KB Output is correct
39 Correct 33 ms 6264 KB Output is correct
40 Correct 31 ms 6272 KB Output is correct
41 Correct 30 ms 6144 KB Output is correct
42 Runtime error 417 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2432 KB Output is correct
2 Correct 6 ms 2432 KB Output is correct
3 Correct 6 ms 2432 KB Output is correct
4 Correct 6 ms 2432 KB Output is correct
5 Correct 6 ms 2432 KB Output is correct
6 Correct 6 ms 2432 KB Output is correct
7 Correct 6 ms 2432 KB Output is correct
8 Correct 6 ms 2432 KB Output is correct
9 Correct 6 ms 2432 KB Output is correct
10 Correct 6 ms 2560 KB Output is correct
11 Correct 7 ms 2560 KB Output is correct
12 Correct 11 ms 4728 KB Output is correct
13 Correct 6 ms 2560 KB Output is correct
14 Correct 7 ms 2560 KB Output is correct
15 Correct 6 ms 2560 KB Output is correct
16 Correct 7 ms 2560 KB Output is correct
17 Correct 7 ms 2816 KB Output is correct
18 Correct 8 ms 2560 KB Output is correct
19 Correct 6 ms 2560 KB Output is correct
20 Correct 6 ms 2688 KB Output is correct
21 Correct 6 ms 2560 KB Output is correct
22 Correct 7 ms 2560 KB Output is correct
23 Correct 6 ms 2560 KB Output is correct
24 Correct 8 ms 2688 KB Output is correct
25 Correct 7 ms 2688 KB Output is correct
26 Correct 86 ms 35532 KB Output is correct
27 Correct 74 ms 35532 KB Output is correct
28 Correct 7 ms 2816 KB Output is correct
29 Correct 8 ms 3248 KB Output is correct
30 Correct 9 ms 2816 KB Output is correct
31 Correct 8 ms 2944 KB Output is correct
32 Correct 7 ms 2816 KB Output is correct
33 Correct 11 ms 4096 KB Output is correct
34 Correct 11 ms 3968 KB Output is correct
35 Correct 25 ms 5120 KB Output is correct
36 Correct 9 ms 2944 KB Output is correct
37 Correct 26 ms 5880 KB Output is correct
38 Correct 29 ms 6264 KB Output is correct
39 Correct 32 ms 6272 KB Output is correct
40 Correct 40 ms 6136 KB Output is correct
41 Correct 46 ms 6264 KB Output is correct
42 Runtime error 386 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -