Submission #882659

#	Time	Username	Problem	Language	Result	Execution time	Memory
882659		vjudge1	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1061 ms	89256 KiB

skyscraper

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// PUT IT BEFORE THE INCLUDE
#include <iostream>
#include <vector>    
#include <unordered_set>    
#include <queue>
using namespace std;
const unsigned short M = 3e4 + 7;
unsigned short n , m;
pair < int , pair < unsigned short , unsigned short  > > tmp;
void solve(){
    cin >> n >> m;
    pair < unsigned short , unsigned short > doge[m];
    vector < unsigned short > root[M];
    for(unsigned short i = 0;i<m;i++){
        cin >> doge[i].first >> doge[i].second;
        root[doge[i].first].push_back(doge[i].second);
    }
    unordered_set < unsigned short > vis[n];
    queue < pair < int , pair < unsigned short , unsigned short > > > pq;//dist , konum , zıplayış
    pq.push({0,{doge[0].first,0}});
    while(pq.size()){
        tmp = pq.front();
        pq.pop();
        if(vis[tmp.second.first].count(tmp.second.second)){
            continue;
        }
        if(tmp.second.first == doge[1].first){
            cout << tmp.first << '\n';
            return;
        }
        vis[tmp.second.first].insert(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(int 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 << '\n';
}
int main(){  
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    unsigned short testcase = 1;//cin >> testcase;
    while(testcase--)solve();
}

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