제출 #717139

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
717139		arush_agu	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	0 / 100	1 ms	288 KiB

skyscraper

#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;
const ld EPS = 1e-9;

void solve() {
  int n, m; cin >> n >> m;
  vi b(m), p(m); for (int i=0; i<m; i++) cin >> b[i] >> p[i];

  vvi doges_at_build(n);
  for (int i=0; i<m; i++) doges_at_build[b[i]].push_back(i);

  if (b[0] == b[1]) {
    cout << "0\n"; return;
  }

  vi dist(n, INF);
  vb vis(m), qa(m);
  dist[b[0]] = 0;
  priority_queue<ii, vii, greater<ii>> q; q.push({0, 0});
  while (!q.empty()) {
    auto &[_, curr] = q.top(); q.pop();
    if (vis[curr]) continue;
    vis[curr] = 1;
    qa[curr] = 1;

    if (curr == 1) {
      cout << dist[b[curr]] << "\n";
      return;
    }

    for (int i=b[curr] - p[curr], cnt = 1; i>=0; i -= p[curr], cnt++)
      if (!vis[i] && dist[i] > dist[b[curr]] + cnt) {
        dist[i] = dist[b[curr]] + cnt;
        for (int &x : doges_at_build[i]) if (!qa[x]) q.push({dist[i], x}), qa[x] = 1;
      }

    for (int i=b[curr] + p[curr], cnt = 1; i < n; i += p[curr], cnt++)
      if (!vis[i] && dist[i] > dist[b[curr]] + cnt) {
        dist[i] = dist[b[curr]] + cnt;
        for (int &x : doges_at_build[i]) if (!qa[x]) q.push({dist[i], x}), qa[x] = 1;
      }
  }
  cout << "-1\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;
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 0 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43