제출 #853124

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

skyscraper

#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
void solve(){
    int n, m;
    cin >> n >> m;
    int b[m], p;
    vector<int> h[n], sm[n];
    int s = 10000;
    for(int i = 0;i < m;i++){
        cin >> b[i] >> p;
        if(p>=s) h[b[i]].push_back(p);
        else sm[b[i]].push_back(p);
    }
    int d[n][s];
    for(int i = 0;i < n;i++) for(int j = 0;j < s;j++) d[i][j] = INT_MAX;
    d[b[0]][0] = 0;
    priority_queue<pair<int, pair<int, int>>> q;
    q.push({0, {b[0], 0}});
    while(!q.empty()){
        int wi = q.top().second.first;
        int po = q.top().second.second;
        if(q.top().first > d[wi][po]) {
            q.pop();
            continue;
        }
        q.pop();
        if(po){
            if(wi+po < n && d[wi+po][po] > 1+d[wi][po]){
                d[wi+po][po] = 1+d[wi][po];
                q.push({d[wi+po][po], {wi+po, po}});
                if(1+d[wi][po] < d[wi+po][0]){
                    d[wi+po][0] = 1+d[wi][po];
                    q.push({d[wi+po][0], {wi+po, 0}});
                }
            }
            if(wi-po >= 0 && d[wi-po][po] > 1+d[wi][po]){
                d[wi-po][po] = 1+d[wi][po];
                q.push({d[wi-po][po], {wi-po, po}});
                if(1+d[wi][po] < d[wi-po][0]){
                    d[wi-po][0] = 1+d[wi][po];
                    q.push({d[wi-po][0], {wi-po, 0}});
                }
            }
            continue;
        }
        for(int u : h[wi]){
            for(int j = wi+u,c=1;j < n;j += u,c++) {
                if(d[j][0] > d[wi][0]+c){
                    d[j][0] = d[wi][0]+c;
                    q.push({d[j][0], {j, 0}});
                }
            }
            for(int j = wi-u,c=1;j >= 0;j -= u,c++) {
                if(d[j][0] > d[wi][0]+c){
                    d[j][0] = d[wi][0]+c;
                    q.push({d[j][0], {j, 0}});
                }
            }
        }
        for(int po : sm[wi]){
            d[wi][po] = d[wi][0];
            if(wi+po < n && d[wi+po][po] > 1+d[wi][po]){
                d[wi+po][po] = 1+d[wi][po];
                q.push({d[wi+po][po], {wi+po, po}});
                if(1+d[wi][po] < d[wi+po][0]){
                    d[wi+po][0] = 1+d[wi][po];
                    q.push({d[wi+po][0], {wi+po, 0}});
                }
            }
            if(wi-po >= 0 && d[wi-po][po] > 1+d[wi][po]){
                d[wi-po][po] = 1+d[wi][po];
                q.push({d[wi-po][po], {wi-po, po}});
                if(1+d[wi][po] < d[wi-po][0]){
                    d[wi-po][0] = 1+d[wi][po];
                    q.push({d[wi-po][0], {wi-po, 0}});
                }
            }
        }
    }
    if(d[b[1]][0] == INT_MAX) cout << "-1\n";
    else cout << d[b[1]][0] << '\n';

}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    solve();
}

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