제출 #83296

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
83296		farukkastamonuda	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	10 / 100	3 ms	1364 KiB

skyscraper

#include <bits/stdc++.h>
#define li 30005
#define inf 100000000009
#define md 1000000007
#define lo long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ii pair<lo int,lo int>
using namespace std;
lo int n,m,B[li],P[li],tut=inf;
queue< pair<lo int , lo int> > q;
int vis[li];
vector<lo int> v[li];
int main(){
	scanf("%lld %lld",&n,&m);
	for(int i=0;i<m;i++){
		scanf("%lld %lld",&B[i],&P[i]);
		//v[B[i]].pb(i);
	}
	q.push(mp(1,0));
	while(!q.empty()){
		ii temp=q.front();
		q.pop();
		lo int seh=temp.se;
		lo int cst=temp.fi;
		//lo int zip=temp.se.se;
		//if(vis[seh][zip]==0) vis[seh][zip]=inf;
		if(vis[seh]) continue;
		//printf("%d %d %d\n",seh,zip,cst);
		//printf("%lld %lld\n",seh,cst);
		vis[seh]=1;
		if(B[seh]==B[1]){
			tut=min(tut,cst);
			continue;
		}
		//~ for(int i=0;i<(int)v[seh].size();i++){
			//~ int ind=v[seh][i];
			//~ if(P[ind]!=zip){
				//~ q.push(mp(cst,mp(seh,P[ind])));
			//~ }
		//~ }
		//~ if(seh+zip<n) q.push(mp(cst+1,mp(seh+zip,zip)));
		//~ if(seh-zip>=0) q.push(mp(cst+1,mp(seh-zip,zip)));
		for(int i=0;i<m;i++){
			if(abs(B[i]-B[seh])%P[seh]==0){
				q.push(mp((cst+abs(B[i]-B[seh])/P[seh]),i));
			}
		}
	}
	if(tut>=inf) tut=0;
	printf("%lld\n",tut-1);
	//printf("-1\n");
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~~~~~
skyscraper.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&B[i],&P[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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