Submission #43926

#	Time	Username	Problem	Language	Result	Execution time	Memory
43926		Kerim	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	10 / 100	4 ms	3228 KiB

skyscraper

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int arr[MAXN],dis[MAXN];
vector<int>adj[MAXN];
int main(){
    //~ freopen("file.in", "r", stdin);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
		int u,v;
		scanf("%d%d",&u,&v);
		adj[u].pb(v);arr[i]=u;
	}
	priority_queue<pair<int,int> >q;
	q.push(mp(0,arr[1]));dis[0]=0;
	for(int i=1;i<n;i++)
		dis[i]=INF;
	while(!q.empty()){
		int val=-q.top().ff;
		int nd=q.top().ss;
		q.pop();
		if(dis[nd]!=val)
			continue;
		tr(it,adj[nd]){
			int cost=*it;
			for(int i=1;;i++){
				if(nd-cost*i<0 and nd+cost*i>=n)
					break;
				if(nd-cost*i>=0 and umin(dis[nd-cost*i],dis[nd]+i))
					q.push(mp(-dis[nd-cost*i],nd-cost*i));
				if(nd+cost*i<n and umin(dis[nd+cost*i],dis[nd]+i))
					q.push(mp(-dis[nd+cost*i],nd+cost*i));	
			}
		}	
	}
	if(dis[arr[2]]==INF)
		dis[arr[2]]=-1;
	printf("%d\n",dis[arr[2]]);
	return 0;
}

Compilation message (stderr)

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&u,&v);
   ~~~~~^~~~~~~~~~~~~~

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