제출 #695249

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
695249		Mizo_Compiler	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	36 / 100	1098 ms	65320 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define MOEZ ios_base::sync_with_stdio(false);cin.tie(NULL),cout.tie(NULL);
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define all(v) v.begin() , v.end()
#define eb emplace_back
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
#define mem(d , x) memset(d , x , sizeof(d));
#define sz(x) (int)x.size()
const int N = 30005;
//const ll M = 1e9+7;
//const ll inf = 1e18;
//const ld eps = 1e-6;
#define int long long
int n , id[N] , p[N] , m;
vector<pair<int , int>>adj[N];
int d[N];
signed main(){
    MOEZ
    cin >> n >> m;
    for(int i = 0; i < n;i++){
        d[i] = 1e18;
    }
    vector<int>v;
    for(int i = 0; i < m;i++){
        cin >> id[i];
        cin >> p[i];
        v.pb(id[i]);
    }
    sort(all(v));
    for(int i = 0; i < m;i++){
        for(auto x:v){
            if(x >= id[i])break;
            if((id[i]-x)%p[i] == 0){
                adj[id[i]].pb({x , (id[i]-x)/p[i]});
            }
        }
        for(int j = m-1; v[j] > id[i];j--){
            if((v[j]-id[i])%p[i] == 0)adj[id[i]].pb({v[j] , (v[j]-id[i])/p[i]});
        }
    }
    priority_queue<pair<int , int> , vector<pair<int , int>> , greater<>>q;
    q.push({id[0] , 0});
    d[id[0]] = 0;
    while(!q.empty()){
        int u = q.top().F , cost = q.top().S;
        q.pop();
        if(d[u] < cost)continue;
        for(auto x:adj[u]){
            int vv = x.F , nc = cost+x.S;
            if(nc < d[vv]){
                d[vv] = nc;
                q.push({vv , nc});
            }
        }
    }
    cout << (d[id[1]] == 1e18 ? -1 : d[id[1]]);
}

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