제출 #651754

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
651754		pauloamed	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1081 ms	79616 KiB

skyscraper

#include<bits/stdc++.h>
using namespace std;

#define int long long

const int MAXN = 30010;

vector<int> p2bs[MAXN];
vector<pair<int,int>> p2d[MAXN];
vector<int> col2p[MAXN];

vector<pair<int,int>> ans[MAXN];

// void print(){
//   for(int i = 0; i < MAXN; ++i){
//     if(ans[i].empty()) continue;
//     cout << i << ":\n";
//     for(auto [x, val] : ans[i]){
//       cout << "\t" << x << ": " << val << "\n";
//     }
//   }
//   cout << "================\n";
// }

int& ans_at(int p, int x){
  // cout << p << " " << x << " : \n";
  // for(auto [a, b] : ans[p + 1]) cout << a << " " << b << ", ";
  // cout << endl;

  return lower_bound(ans[p+1].begin(), ans[p+1].end(), make_pair(x, 0LL))->second;
}

int32_t main(){
  cin.tie(NULL)->sync_with_stdio(false);

  int n, m; cin >> n >> m;

  int B[2], P[2];
  cin >> B[0] >> P[0];
  cin >> B[1] >> P[1];

  for(int i = 2; i < m; ++i){
    int b, p; cin >> b >> p;
    p2bs[p].push_back(b);
  }

  for(int p = 1; p < MAXN; ++p){
    map<int, int> D;

    sort(p2bs[p].begin(), p2bs[p].end());
    p2bs[p].erase(unique(p2bs[p].begin(), p2bs[p].end()), p2bs[p].end());

    queue<int> q;
    for(auto b : p2bs[p]){
      col2p[b].push_back(p);
      q.push(b);
      D[b] = 0;
    }
    while(q.size()){
      auto x = q.front(); q.pop();

      if(x - p >= 0 && D.count(x - p) == 0){
        D[x - p] = D[x] + 1;
        q.push(x - p);
      }
      if(x + p < n && D.count(x + p) == 0){
        D[x + p] = D[x] + 1;
        q.push(x + p);
      }
    }

    vector<pair<int,int>> v;
    for(auto [a, b] : D){
      v.push_back({a, b});
      ans[p+1].push_back({a, LLONG_MAX});
    }
    p2d[p] = move(v);
  }


  struct Node{
    int i, x;
    // se i == -1, eh col
    int cost;
    bool operator<(const Node &n) const{
      return cost > n.cost;
    }
  };

  for(int i = 0; i < n; ++i){
    ans[0].push_back({i, LLONG_MAX});
  }

  priority_queue<Node> pq;
  deque<Node> q;
  for(int i = (B[0] % P[0]); i < n; i += P[0]){
    int dist = abs(i - B[0]) / P[0];
    pq.push({-1, i, ans_at(-1, i) = dist});
  }

  // print();

  while(pq.size() + q.size() > 0){
    auto qry_p2d = [&](int p, int x){
      return lower_bound(p2d[p].begin(), p2d[p].end(), make_pair(x, 0LL))->second;
    };

    auto maybe_update = [&](int p, int x, int val, int d){
      if(ans_at(p, x) > val){
        Node X = {p, x, ans_at(p, x) = val};
        
        if(d == 0) q.push_front(X);
        else if(d == 1) q.push_back(X);
        else pq.push(X);
      }
    };


    Node nxt;
    {
      if(q.size()){
        nxt = q.front();
        q.pop_front();
      }else{
        nxt = pq.top(); pq.pop();
      }
    }
    auto [i, x, cost] = nxt;
    if(cost > ans_at(i, x)) continue;

    // cout << i << " " << x << " " << cost << "\n";

    if(i == -1){
      for(auto p : col2p[x]){
        maybe_update(p, x, cost + qry_p2d(p, x), 2);
      }
    }else{
      // sou power i na coluna x
      maybe_update(-1, x, cost, 0);

      if(x + i < n){
        maybe_update(i, x + i, cost + 1, 1);
      }

      if(x - i >= 0){
        maybe_update(i, x - i, cost + 1, 1);
      }
    }

    // print();
  }

  // print();
  if(lower_bound(ans[0].begin(), ans[0].end(), make_pair(B[1], 0LL)) == ans[0].end())
    cout << "-1\n";
  else cout << ((ans_at(-1, B[1]) == LLONG_MAX)? -1 : ans_at(-1, B[1])) << "\n";
}

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