oj.uz

Submission #521114

# Submission time Handle Problem Language Result Execution time Memory
521114 2022-01-31T18:56:00 Z Alex_tz307 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 500 ms 26324 KB 
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f

using namespace std;

const int SQRT = 175;

void minSelf(int &x, int y) {
  if (y < x) {
    x = y;
  }
}

void testCase() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> g(n);
  int s = 0, t = 0;
  for (int i = 0; i < m; ++i) {
    int b, p;
    cin >> b >> p;
    if (0 <= b - p || b + p < n) {
      g[b].emplace_back(p);
    }
    if (i == 0) {
      s = b;
    }
    if (i == 1) {
      t = b;
    }
  }
  if (s == t) {
    cout << "0\n";
    return;
  }
  for (int v = 0; v < n; ++v) {
    sort(g[v].begin(), g[v].end());
    g[v].erase(unique(g[v].begin(), g[v].end()), g[v].end());
  }
  queue<pair<int, int>> q;
  vector<vector<int>> dp(n, vector<int>(SQRT, INF));
  vector<vector<bool>> inQ(n, vector<bool>(SQRT));
  dp[s][0] = 0;
  q.emplace(s, 0);
  inQ[s][0] = true;
  while (!q.empty()) {
    int u, p;
    tie(u, p) = q.front();
    q.pop();
    inQ[u][p] = false;
    if (p == 0) {
      for (int pp : g[u]) {
        if (pp < SQRT) {
          if (dp[u][pp] > dp[u][0]) {
            dp[u][pp] = dp[u][0];
            if (!inQ[u][pp]) {
              q.emplace(u, pp);
            }
          }
        } else {
          int cost = 0;
          for (int v = u - pp; v >= 0; v -= pp) {
            cost += 1;
            if (dp[v][0] > dp[u][0] + cost) {
              dp[v][0] = dp[u][0] + cost;
              if (!inQ[v][0]) {
                q.emplace(v, 0);
              }
            }
          }
          cost = 0;
          for (int v = u + pp; v < n; v += pp) {
            cost += 1;
            if (dp[v][0] > dp[u][0] + cost) {
              dp[v][0] = dp[u][0] + cost;
              if (!inQ[v][0]) {
                q.emplace(v, 0);
              }
            }
          }
        }
      }
    } else {
      if (dp[u][0] > dp[u][p]) {
        dp[u][0] = dp[u][p];
        if (!inQ[u][0]) {
          q.emplace(u, 0);
        }
      }
      for (int sgn : {-1, 1}) {
        int v = u + sgn * p;
        if (0 <= v && v < n && dp[v][p] > dp[u][p] + 1) {
          dp[v][p] = dp[u][p] + 1;
          if (!inQ[v][p]) {
            q.emplace(v, p);
          }
        }
      }
    }
  }
  if (dp[t][0] == INF) {
    cout << "-1\n";
  } else {
    cout << dp[t][0] << '\n';
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 316 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 2 ms 972 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 2 ms 1996 KB Output is correct
21 Correct 1 ms 572 KB Output is correct
22 Correct 2 ms 1724 KB Output is correct
23 Correct 2 ms 1612 KB Output is correct
24 Correct 3 ms 1868 KB Output is correct
25 Correct 2 ms 1996 KB Output is correct
26 Correct 2 ms 1868 KB Output is correct
27 Correct 3 ms 1856 KB Output is correct
28 Correct 3 ms 1984 KB Output is correct
29 Correct 3 ms 1868 KB Output is correct
30 Correct 2 ms 1868 KB Output is correct
31 Correct 3 ms 1868 KB Output is correct
32 Correct 2 ms 1868 KB Output is correct
33 Correct 5 ms 1984 KB Output is correct
34 Correct 5 ms 1996 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 312 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 2 ms 972 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 2 ms 1976 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 1 ms 1740 KB Output is correct
23 Correct 2 ms 1612 KB Output is correct
24 Correct 3 ms 1868 KB Output is correct
25 Correct 2 ms 1984 KB Output is correct
26 Correct 3 ms 1868 KB Output is correct
27 Correct 2 ms 1868 KB Output is correct
28 Correct 2 ms 1996 KB Output is correct
29 Correct 3 ms 1868 KB Output is correct
30 Correct 2 ms 1848 KB Output is correct
31 Correct 3 ms 1996 KB Output is correct
32 Correct 2 ms 1868 KB Output is correct
33 Correct 5 ms 1996 KB Output is correct
34 Correct 5 ms 2000 KB Output is correct
35 Correct 8 ms 1848 KB Output is correct
36 Correct 3 ms 1288 KB Output is correct
37 Correct 10 ms 2252 KB Output is correct
38 Correct 12 ms 2408 KB Output is correct
39 Correct 13 ms 2376 KB Output is correct
40 Correct 12 ms 2384 KB Output is correct
41 Correct 18 ms 2368 KB Output is correct
42 Correct 6 ms 2188 KB Output is correct
43 Correct 6 ms 2252 KB Output is correct
44 Correct 10 ms 2248 KB Output is correct
45 Correct 21 ms 2364 KB Output is correct
46 Correct 15 ms 2476 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 432 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 2 ms 972 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 2 ms 1852 KB Output is correct
20 Correct 3 ms 1984 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 2 ms 1724 KB Output is correct
23 Correct 2 ms 1612 KB Output is correct
24 Correct 3 ms 1868 KB Output is correct
25 Correct 2 ms 1928 KB Output is correct
26 Correct 2 ms 1868 KB Output is correct
27 Correct 2 ms 1868 KB Output is correct
28 Correct 2 ms 1996 KB Output is correct
29 Correct 4 ms 1980 KB Output is correct
30 Correct 2 ms 1868 KB Output is correct
31 Correct 3 ms 1848 KB Output is correct
32 Correct 2 ms 1868 KB Output is correct
33 Correct 6 ms 1996 KB Output is correct
34 Correct 5 ms 1996 KB Output is correct
35 Correct 8 ms 1760 KB Output is correct
36 Correct 3 ms 1148 KB Output is correct
37 Correct 11 ms 2244 KB Output is correct
38 Correct 13 ms 2380 KB Output is correct
39 Correct 13 ms 2368 KB Output is correct
40 Correct 13 ms 2352 KB Output is correct
41 Correct 13 ms 2380 KB Output is correct
42 Correct 6 ms 2252 KB Output is correct
43 Correct 6 ms 2236 KB Output is correct
44 Correct 6 ms 2276 KB Output is correct
45 Correct 15 ms 2448 KB Output is correct
46 Correct 17 ms 2380 KB Output is correct
47 Correct 73 ms 11248 KB Output is correct
48 Correct 18 ms 19908 KB Output is correct
49 Correct 21 ms 21712 KB Output is correct
50 Correct 19 ms 23760 KB Output is correct
51 Correct 96 ms 26000 KB Output is correct
52 Correct 80 ms 25904 KB Output is correct
53 Correct 27 ms 25400 KB Output is correct
54 Correct 21 ms 24988 KB Output is correct
55 Correct 19 ms 24864 KB Output is correct
56 Correct 26 ms 26056 KB Output is correct
57 Correct 63 ms 25036 KB Output is correct
58 Correct 27 ms 25216 KB Output is correct
59 Correct 27 ms 25292 KB Output is correct
60 Correct 32 ms 25268 KB Output is correct
61 Correct 29 ms 25284 KB Output is correct
62 Correct 44 ms 25668 KB Output is correct
63 Correct 61 ms 26068 KB Output is correct
64 Correct 68 ms 26144 KB Output is correct
65 Correct 145 ms 26324 KB Output is correct
66 Correct 500 ms 26060 KB Output is correct
67 Correct 313 ms 26040 KB Output is correct