oj.uz

Submission #35696

# Submission time Handle Problem Language Result Execution time Memory
35696 2017-11-28T06:44:49 Z funcsr Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 43 ms 32536 KB 
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
typedef pair<int, P> P2;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
const int B = 200;
const int LIM = 30100;

int N, M;
vector<int> G[30000];
int D[30000][B+1];
vector<P> Q[LIM];

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> M;
  rep(i, N) rep(j, B+1) D[i][j] = INF;
  int sx = 0, tx = 0;
  rep(i, M) {
    int b, p;
    cin >> b >> p;
    if      (i == 0) sx = b;
    else if (i == 1) tx = b;
    G[b].pb(p);
  }
  rep(i, N) sort(all(G[i])), uniq(G[i]);

  D[sx][0] = 0;
  Q[0].pb(P(sx, 0));

  rep(r, LIM) {
    while (!Q[r].empty()) {
      int x = Q[r].back()._1, p = Q[r].back()._2;
      Q[r].pop_back();
      if (D[x][p] < r) continue;

      if (p == 0) {
        for (int np : G[x]) {
          if (np <= B) {
            if (D[x][np] > r) {
              D[x][np] = r;
              Q[r].pb(P(x, np));
            }
          }
          else {
            for (int t=x%np; t<N; t+=np) {
              int cost = abs(x-t)/np;
              if (D[t][0] > r+cost) {
                D[t][0] = r+cost;
                Q[r+cost].pb(P(t, 0));
              }
            }
          }
        }
      }
      else {
        if (D[x][0] > r) {
          D[x][0] = r;
          Q[r].pb(P(x, 0));
        }
        if (x-p >= 0) {
          if (D[x-p][p] > r+1) {
            D[x-p][p] = r+1;
            Q[r+1].pb(P(x-p, p));
          }
        }
        if (x+p < N) {
          if (D[x+p][p] > r+1) {
            D[x+p][p] = r+1;
            Q[r+1].pb(P(x+p, p));
          }
        }
      }
    }
  }
  int m = D[tx][0];
  if (m == INF) m = -1;
  cout << m << "\n";
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 27144 KB Output is correct
2 Correct 0 ms 27144 KB Output is correct
3 Correct 0 ms 27144 KB Output is correct
4 Correct 0 ms 27144 KB Output is correct
5 Correct 0 ms 27144 KB Output is correct
6 Correct 0 ms 27144 KB Output is correct
7 Correct 0 ms 27144 KB Output is correct
8 Correct 0 ms 27144 KB Output is correct
9 Correct 0 ms 27144 KB Output is correct
10 Correct 0 ms 27144 KB Output is correct
11 Correct 0 ms 27144 KB Output is correct
12 Correct 0 ms 27144 KB Output is correct
13 Correct 0 ms 27144 KB Output is correct
14 Correct 0 ms 27144 KB Output is correct
15 Correct 0 ms 27144 KB Output is correct
16 Correct 0 ms 27144 KB Output is correct
17 Correct 0 ms 27276 KB Output is correct
18 Correct 3 ms 27144 KB Output is correct
19 Correct 3 ms 27144 KB Output is correct
20 Correct 3 ms 27276 KB Output is correct
21 Correct 0 ms 27144 KB Output is correct
22 Correct 0 ms 27144 KB Output is correct
23 Correct 0 ms 27144 KB Output is correct
24 Correct 3 ms 27276 KB Output is correct
25 Correct 0 ms 27276 KB Output is correct
26 Correct 0 ms 27276 KB Output is correct
27 Correct 3 ms 27276 KB Output is correct
28 Correct 3 ms 27804 KB Output is correct
29 Correct 0 ms 27816 KB Output is correct
30 Correct 0 ms 27408 KB Output is correct
31 Correct 0 ms 27548 KB Output is correct
32 Correct 3 ms 27408 KB Output is correct
33 Correct 6 ms 28264 KB Output is correct
34 Correct 6 ms 28252 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 27144 KB Output is correct
2 Correct 0 ms 27144 KB Output is correct
3 Correct 0 ms 27144 KB Output is correct
4 Correct 0 ms 27144 KB Output is correct
5 Correct 0 ms 27144 KB Output is correct
6 Correct 0 ms 27144 KB Output is correct
7 Correct 0 ms 27144 KB Output is correct
8 Correct 0 ms 27144 KB Output is correct
9 Correct 0 ms 27144 KB Output is correct
10 Correct 0 ms 27144 KB Output is correct
11 Correct 0 ms 27144 KB Output is correct
12 Correct 0 ms 27144 KB Output is correct
13 Correct 0 ms 27144 KB Output is correct
14 Correct 0 ms 27144 KB Output is correct
15 Correct 0 ms 27144 KB Output is correct
16 Correct 0 ms 27144 KB Output is correct
17 Correct 0 ms 27276 KB Output is correct
18 Correct 0 ms 27144 KB Output is correct
19 Correct 0 ms 27144 KB Output is correct
20 Correct 0 ms 27276 KB Output is correct
21 Correct 0 ms 27144 KB Output is correct
22 Correct 0 ms 27144 KB Output is correct
23 Correct 0 ms 27144 KB Output is correct
24 Correct 3 ms 27276 KB Output is correct
25 Correct 0 ms 27276 KB Output is correct
26 Correct 0 ms 27276 KB Output is correct
27 Correct 3 ms 27276 KB Output is correct
28 Correct 3 ms 27804 KB Output is correct
29 Correct 3 ms 27816 KB Output is correct
30 Correct 0 ms 27408 KB Output is correct
31 Correct 3 ms 27548 KB Output is correct
32 Correct 0 ms 27408 KB Output is correct
33 Correct 3 ms 28264 KB Output is correct
34 Correct 9 ms 28252 KB Output is correct
35 Correct 3 ms 27876 KB Output is correct
36 Correct 3 ms 27276 KB Output is correct
37 Correct 13 ms 28544 KB Output is correct
38 Correct 16 ms 28340 KB Output is correct
39 Correct 19 ms 28336 KB Output is correct
40 Correct 16 ms 28316 KB Output is correct
41 Correct 13 ms 28316 KB Output is correct
42 Correct 3 ms 27440 KB Output is correct
43 Correct 3 ms 27440 KB Output is correct
44 Correct 3 ms 27304 KB Output is correct
45 Correct 23 ms 31916 KB Output is correct
46 Correct 23 ms 31780 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 27144 KB Output is correct
2 Correct 0 ms 27144 KB Output is correct
3 Correct 0 ms 27144 KB Output is correct
4 Correct 0 ms 27144 KB Output is correct
5 Correct 0 ms 27144 KB Output is correct
6 Correct 0 ms 27144 KB Output is correct
7 Correct 0 ms 27144 KB Output is correct
8 Correct 0 ms 27144 KB Output is correct
9 Correct 0 ms 27144 KB Output is correct
10 Correct 0 ms 27144 KB Output is correct
11 Correct 0 ms 27144 KB Output is correct
12 Correct 0 ms 27144 KB Output is correct
13 Correct 0 ms 27144 KB Output is correct
14 Correct 0 ms 27144 KB Output is correct
15 Correct 0 ms 27144 KB Output is correct
16 Correct 0 ms 27144 KB Output is correct
17 Correct 0 ms 27276 KB Output is correct
18 Correct 0 ms 27144 KB Output is correct
19 Correct 0 ms 27144 KB Output is correct
20 Correct 3 ms 27276 KB Output is correct
21 Correct 0 ms 27144 KB Output is correct
22 Correct 0 ms 27144 KB Output is correct
23 Correct 3 ms 27144 KB Output is correct
24 Correct 3 ms 27276 KB Output is correct
25 Correct 0 ms 27276 KB Output is correct
26 Correct 0 ms 27276 KB Output is correct
27 Correct 3 ms 27276 KB Output is correct
28 Correct 0 ms 27804 KB Output is correct
29 Correct 3 ms 27816 KB Output is correct
30 Correct 0 ms 27408 KB Output is correct
31 Correct 3 ms 27548 KB Output is correct
32 Correct 0 ms 27408 KB Output is correct
33 Correct 6 ms 28264 KB Output is correct
34 Correct 0 ms 28252 KB Output is correct
35 Correct 13 ms 27876 KB Output is correct
36 Correct 3 ms 27276 KB Output is correct
37 Correct 19 ms 28544 KB Output is correct
38 Correct 16 ms 28340 KB Output is correct
39 Correct 13 ms 28336 KB Output is correct
40 Correct 13 ms 28316 KB Output is correct
41 Correct 13 ms 28316 KB Output is correct
42 Correct 3 ms 27440 KB Output is correct
43 Correct 3 ms 27440 KB Output is correct
44 Correct 3 ms 27304 KB Output is correct
45 Correct 23 ms 31916 KB Output is correct
46 Correct 16 ms 31780 KB Output is correct
47 Correct 43 ms 32536 KB Output is correct
48 Correct 23 ms 27540 KB Output is correct
49 Correct 9 ms 27540 KB Output is correct
50 Correct 13 ms 27408 KB Output is correct
51 Correct 36 ms 30340 KB Output is correct
52 Correct 39 ms 30496 KB Output is correct
53 Runtime error 23 ms 28860 KB Execution killed with signal 11 (could be triggered by violating memory limits)
54 Halted 0 ms 0 KB -