제출 #393796

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
393796		loctildore	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1089 ms	35504 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define x first
#define y second
#define elif else if
#define endl '\n'
#define all(x) begin(x), end(x)
#define k 100
template <typename T>
ostream& operator << (ostream& os, const vector<T>& a) {
    os << '[';
    bool E = false;
    for(const T& x : a) {
        if(E) os << ' ';
        os << x;
        E = true;
    }
    return os << ']';
}
int n,m;
int b[30069],p[30069];
bool done[30069];
set<pair<int,int>> st;
vector<int> grph[30069];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin>>n>>m;
  for (int i = 0; i < m; i++) {
    cin>>b[i]>>p[i];
    grph[b[i]].push_back(p[i]);
  }
  pq.push({0,b[0]});
  while (pq.size()) {
    auto temp=pq.top();
    pq.pop();
    if (done[temp.s]) {
      continue;
    }
    done[temp.s]=true;
    if (temp.s==b[1]) {
      cout<<temp.f<<endl;
      return 0;
    }
    for (int i:grph[temp.s]) {
      if (st.find({temp.s%i,i})!=st.end()) {
        continue;
      }
      st.insert({temp.s%i,i});
      for (int j = temp.s%i; j < n; j+=i) {
        pq.push({temp.f+abs(j-temp.s)/i,j});
      }
    }
  }
  cout<<-1<<endl;
  return 0;
}

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