제출 #45913

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

skyscraper

#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair
#define int long long

using namespace std;

typedef long long ll;

const int inf = (int)1e15 + 7;
const int N = (int)2e5 + 7;

int n,m;
int b[N],p[N];
int d[N];

vector <int> vec[N];
vector <pair<int,int> > g[N];
priority_queue<pair<int,int> > q;

bool check (int l,int r,int x) {
      if (abs(r - l) % x == 0)
            return true;
      return false;
}
int f (int l,int r,int x) {
      return (abs(r - l) / x);
}
main () {
      cin >> n >> m;

      for (int i = 1; i <= m; i ++) {
            cin >> b[i] >> p[i];
            b[i] ++;
            vec[b[i]].pb(p[i]);
      }
      for (int i = 1; i <= n; i ++) {
            sort (vec[i].begin(),vec[i].end());
            vec[i].erase(unique(vec[i].begin(),vec[i].end()),vec[i].end());
      }

      for (int i = 1; i <= n; i ++)
            d[i] = inf;

      d[b[1]] = 0;
      q.push({0,b[1]});

      while (!q.empty()) {
            int v = q.top().sc,cur = -q.top().fr;
            q.pop();

            if (cur > d[v])
                  continue;
            if (b[2] == v) {
                  cout << d[v] << endl;
                  return 0;
            }
            for (auto to : vec[v]) {
                  for (int i = 1; to * i + v <= n; i ++) {
                        if (d[v] + i < d[to * i + v]) {
                              d[to * i + v] = d[v] + i;
                              q.push({-d[to * i + v],to * i + v});
                        }
                  }
                  for (int i = 1; to * i <= v; i ++) {
                        if (d[v] + i < d[v - to * i]) {
                              d[v - to * i] = d[v] + i;
                              q.push({-d[v - to * i],v - to * i});
                        }
                  }
            }
      }
      if (d[b[2]] == inf)
            puts("-1");
      else
            cout << d[b[2]] << endl;
}

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

skyscraper.cpp:33:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

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