oj.uz

Submission #717152

# Submission time Handle Problem Language Result Execution time Memory
717152 2023-04-01T09:31:14 Z arush_agu Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 240 ms 12828 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9 + 10;
const ld EPS = 1e-9;

const int SQRTN = 40;

// Saw Solution

void solve() {
  int n, m; cin >> n >> m;
  vii ds(m); for (auto &[b, p] : ds) cin >> b >> p;

  vvi bds(n); for (auto &[b, p] : ds) bds[b].push_back(p);
  for (int i=0; i<n; i++) sort(all(bds[i]));

  int source = ds[0].first, target = ds[1].first;
  vvi dist(n, vi(SQRTN, INF));
  vector<vb> vis(n, vb(SQRTN));
  
  dist[source][0] = 0;

  typedef pair<int, ii> T;
  priority_queue<T, vector<T>, greater<T>> pq; pq.push({0, {source, 0}});

  auto add = [&](int b, int p, int d) {
    if (dist[b][p] > d) {
      dist[b][p] = d;
      pq.push({d, {b, p}});
    }
  };

  while (!pq.empty()) {
    auto [dist, bbpp] = pq.top(); pq.pop();
    auto [bb, pp] = bbpp;

    if (vis[bb][pp]) continue;
    vis[bb][pp] = 1;

    add(bb, 0, dist);
    if (pp == 0) {
      for (auto np : bds[bb]) {
        if (np < SQRTN) {
          add(bb, np, dist);
          continue;
        }
        for (int j = bb % np; j < n; j += np)
          add(j, 0, dist + abs(bb - j) / np);
      }
    } else {
        if (bb >= pp)
          add(bb - pp, pp, dist + 1);
        if (bb + pp < n)
          add(bb + pp, pp, dist + 1);
    }
  }

  cout << (dist[target][0] >= INF ? -1 : dist[target][0]) << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();
  int test_cases = 1;

  /* cin >> test_cases; */

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:150:11: warning: unused variable 'start' [-Wunused-variable]
  150 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 3 ms 852 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 2 ms 852 KB Output is correct
28 Correct 2 ms 852 KB Output is correct
29 Correct 8 ms 980 KB Output is correct
30 Correct 3 ms 852 KB Output is correct
31 Correct 4 ms 980 KB Output is correct
32 Correct 2 ms 980 KB Output is correct
33 Correct 10 ms 1108 KB Output is correct
34 Correct 11 ms 1108 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 1 ms 852 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 8 ms 980 KB Output is correct
30 Correct 3 ms 852 KB Output is correct
31 Correct 4 ms 980 KB Output is correct
32 Correct 2 ms 980 KB Output is correct
33 Correct 10 ms 1108 KB Output is correct
34 Correct 10 ms 1108 KB Output is correct
35 Correct 10 ms 1108 KB Output is correct
36 Correct 3 ms 724 KB Output is correct
37 Correct 12 ms 1236 KB Output is correct
38 Correct 13 ms 1364 KB Output is correct
39 Correct 18 ms 1364 KB Output is correct
40 Correct 14 ms 1340 KB Output is correct
41 Correct 13 ms 1364 KB Output is correct
42 Correct 5 ms 1236 KB Output is correct
43 Correct 5 ms 1236 KB Output is correct
44 Correct 5 ms 1236 KB Output is correct
45 Correct 16 ms 1556 KB Output is correct
46 Correct 17 ms 1556 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 852 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 2 ms 852 KB Output is correct
28 Correct 2 ms 852 KB Output is correct
29 Correct 10 ms 980 KB Output is correct
30 Correct 3 ms 852 KB Output is correct
31 Correct 4 ms 992 KB Output is correct
32 Correct 2 ms 980 KB Output is correct
33 Correct 10 ms 1108 KB Output is correct
34 Correct 11 ms 1116 KB Output is correct
35 Correct 11 ms 1076 KB Output is correct
36 Correct 3 ms 724 KB Output is correct
37 Correct 12 ms 1236 KB Output is correct
38 Correct 13 ms 1336 KB Output is correct
39 Correct 13 ms 1364 KB Output is correct
40 Correct 13 ms 1364 KB Output is correct
41 Correct 13 ms 1364 KB Output is correct
42 Correct 6 ms 1236 KB Output is correct
43 Correct 5 ms 1236 KB Output is correct
44 Correct 6 ms 1232 KB Output is correct
45 Correct 16 ms 1588 KB Output is correct
46 Correct 17 ms 1556 KB Output is correct
47 Correct 55 ms 4884 KB Output is correct
48 Correct 13 ms 7636 KB Output is correct
49 Correct 13 ms 8276 KB Output is correct
50 Correct 12 ms 8788 KB Output is correct
51 Correct 56 ms 10320 KB Output is correct
52 Correct 57 ms 10312 KB Output is correct
53 Correct 22 ms 9728 KB Output is correct
54 Correct 11 ms 8916 KB Output is correct
55 Correct 12 ms 8936 KB Output is correct
56 Correct 17 ms 10196 KB Output is correct
57 Correct 119 ms 9936 KB Output is correct
58 Correct 20 ms 9352 KB Output is correct
59 Correct 19 ms 9272 KB Output is correct
60 Correct 19 ms 9300 KB Output is correct
61 Correct 21 ms 9356 KB Output is correct
62 Correct 28 ms 10140 KB Output is correct
63 Correct 55 ms 11084 KB Output is correct
64 Correct 57 ms 11088 KB Output is correct
65 Correct 76 ms 12660 KB Output is correct
66 Correct 240 ms 12620 KB Output is correct
67 Correct 237 ms 12828 KB Output is correct