Submission #89283

#	Time	Username	Problem	Language	Result	Execution time	Memory
89283		Mouhanad_Hafez	Jakarta Skyscrapers (APIO15_skyscraper)	C++11	10 / 100	3 ms	1076 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
long long int n,m,B[30005],P[30005];
queue< pair<long long,long long> > q;
int vis[30005];
int main(){
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>B[i]>>P[i];
    }
    q.push({0,0});
    while(!q.empty()){
        pair<long long,long long>temp=q.front();
        q.pop();
        long long int loc=temp.second;
        long long int pwr=temp.first;
        if(vis[loc]) continue;
        vis[loc]=1;
        if(B[loc]==B[1]){
            cout<<pwr;
            return 0;
        }
        for(int i=0;i<m;i++){
            if(abs(B[i]-B[loc])%P[loc]==0){
                q.push({(pwr+abs(B[i]-B[loc])/P[loc]),i});
            }
        }
    }
    cout<<-1;
    return 0;
}

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