Submission #1069201

#	Time	Username	Problem	Language	Result	Execution time	Memory
1069201		Luvidi	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	22 / 100	389 ms	262144 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

void solve() {
    int n,m;
    cin>>n>>m;
    pii a[m];
    vector<pii> adj[n*m+n];
    for(int i=0;i<m;i++){
        int b,p;
        cin>>b>>p;
        a[i]={b,p};
        for(int x=b%p;x<n;x++){
            adj[n*i+x].pb({n*m+x,0});
        }
        adj[n*m+b].pb({n*i+b,0});
        for(int x=b%p;x+p<n;x++){
            adj[n*i+x].pb({n*i+x+p,1});
            adj[n*i+x+p].pb({n*i+x,1});
        }
    }
    int dist[n*m+n];
    bool vis[n*m+n];
    for(int i=0;i<n*m+n;i++){
        dist[i]=1e9;
        vis[i]=0;
    }
    dist[a[0].fs]=0;
    priority_queue<pii> pq;
    pq.push({0,a[0].fs});
    while(!pq.empty()){
        int v=pq.top().sc;
        pq.pop();
        if(vis[v])continue;
        vis[v]=1;
        for(auto[u,w]:adj[v])if(!vis[u]){
            dist[u]=min(dist[u],dist[v]+w);
            pq.push({-dist[u],u});
        }
    }
    int ans=dist[n+a[1].fs];
    if(ans==1e9)ans=-1;
    cout<<ans;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
}

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