Submission #882583

#	Time	Username	Problem	Language	Result	Execution time	Memory
882583		vjudge1	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	10 / 100	1 ms	1368 KiB

skyscraper

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// PUT IT BEFORE THE INCLUDE
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const int M = 3e4 + 7;
void solve(){
    int n, m;
    cin >> n >> m;
    pair < int , int > doge[m];
    vector < int > root[M];
    for(int i = 0;i<m;i++){
        cin >> doge[i].first >> doge[i].second;
        root[doge[i].first].push_back(doge[i].second);
    }
    set < pair < int , int > > vis;//konum zıplayış
    priority_queue < pair < int , pair < int , int > > > pq;//dist , konum , zıplayış
    pq.push({0,{doge[0].first,0}});
    while(pq.size()){
        pair < int , pair < int , int  > > tmp = pq.top();
        pq.pop();
        if(vis.count({tmp.second.first,tmp.second.second})){
            continue;
        }
        if(tmp.second.first == doge[1].first){
            cout << tmp.first << endl;
            return;
        }
        vis.insert({tmp.second.first,tmp.second.second});
        if(tmp.second.first + tmp.second.second < n)pq.push({tmp.first + 1 , {tmp.second.first + tmp.second.second , tmp.second.second}});
        if(tmp.second.first - tmp.second.second >= 0)pq.push({tmp.first + 1 , {tmp.second.first - tmp.second.second , tmp.second.second}});
        for(auto itr : root[tmp.second.first]){
            if(tmp.second.first + itr < n)pq.push({tmp.first + 1 , {tmp.second.first + itr , itr}});
            if(tmp.second.first - itr >= 0)pq.push({tmp.first + 1 , {tmp.second.first - itr , itr}});
        }
    }
    cout << -1 << endl;
}
signed main(){  
    ios_base::sync_with_stdio(0);cin.tie(0);
    int testcase = 1;//cin >> testcase;
    while(testcase--)solve();
}

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