Submission #27268

#	Time	Username	Problem	Language	Result	Execution time	Memory
27268		TAMREF	Jakarta Skyscrapers (APIO15_skyscraper)	C++11	57 / 100	339 ms	50804 KiB

skyscraper

#include <bits/stdc++.h>
#define va first
#define vb second
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
const int mx=30005, mv=2005;
int B[mx], P[mx], dist[mx];
int mark[mv][mv];
int N,M;
vector<pii> G[mx];
void input(){
    scanf("%d%d",&N,&M);
    for(int i=0;i<N;i++) fill(mark[i],mark[i]+N,(int)1e9);
    for(int i=0;i<M;i++){
        scanf("%d%d",&B[i],&P[i]);
        for(int s=B[i]+P[i];s<N;s+=P[i])
            mark[B[i]][s]=min(mark[B[i]][s],(s-B[i])/P[i]);
        for(int s=B[i]-P[i];s>=0;s-=P[i])
            mark[B[i]][s]=min(mark[B[i]][s],(B[i]-s)/P[i]);
    }
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++)
            if(mark[i][j]<(int)1e9)
                G[i].push_back(mp(mark[i][j],j));
    }
    fill(dist,dist+N,(int)1e9);
}
void dijk(int s){
    priority_queue<pii,vector<pii>,greater<pii>> q;
    q.push(mp(dist[s]=0,s));
    pii t;
    while(!q.empty()){
        t=q.top(); q.pop();
        //printf("now : %d, %d vs %d\n",t.vb,t.va,dist[t.vb]);
        if(t.va>dist[t.vb]) continue;
        //printf("%d\n",t.vb);
        for(pii z : G[t.vb]){
            if(dist[z.vb]>dist[t.vb]+z.va){
                q.push(mp(dist[z.vb]=dist[t.vb]+z.va,z.vb));
            }
        }
    }
}
int main(){
    input();
    dijk(B[0]);
    printf("%d\n",dist[B[1]]==(int)1e9?-1:dist[B[1]]);
}

Compilation message (stderr)

skyscraper.cpp: In function 'void input()':
skyscraper.cpp:13:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&N,&M);
                        ^
skyscraper.cpp:16:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&B[i],&P[i]);
                                  ^

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