提出 #884106

---

ソースコード 拡げる

#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define FILL(a,x) memset(a,x,sizeof(a))
#define foreach( gg,ii ) for( typeof(gg.begin()) ii=gg.begin();ii!=gg.end();ii++)
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define sz(a) int((a).size())
#define N 100010
#define MAX 30
#define mod 1000000007
#define REP(i,a) for(int i=0;i<a;++i)
#define REPP(i,a,b) for(int i=a;i<b;++i)
#define all(a) a.begin(),a.end()
const ll INF = 1e18+1;
 
unordered_map <int, int> dis[N];
vector <int> G[N][2];
priority_queue < pair <int, pii> , vector < pair <int, pii> > , greater < pair <int, pii> > > s;
 
void djikstra(int a)
{
	dis[a][-1]=0;
	int v,i,len,x,y,z,col,add,curr;
	pii tmp;
	s.push(mp(0,mp(-1,a)));
	while(!s.empty())
	{
		x=s.top().X;
		y=s.top().Y.Y;
		z=s.top().Y.X;
		s.pop();
		v=y;
		len=G[v][0].size();
		curr=x;
		col=z;
		if (curr>dis[v][col]) continue;
		for(i=0;i<len;i++)
		{
			x=G[v][0][i];
			y=G[v][1][i];
			tmp=mp(y,x);
			if (y==col) add=0;
			else add=1;
			z=dis[x][y];
			if (!z||z>curr+add)
			{
				dis[x][y]=curr+add;
				s.push(mp(curr+add,tmp));
			}
		}
	}
}
 
int main()
{
	int n,m,p,q,c,ans=mod;
	scanf("%d%d",&n,&m);
	REP(i,m)
	{
		scanf("%d%d%d",&p,&q,&c);
		p--;
		q--;
		G[p][0].pb(q);
		G[p][1].pb(c);
		G[q][0].pb(p);
		G[q][1].pb(c);
	}
	djikstra(0);
	REP(i,sz(G[n-1][0]))
	{
		if (dis[n-1][G[n-1][1][i]])
			ans=min(ans,dis[n-1][G[n-1][1][i]]);
	}
	if (ans==mod) printf("-1\n");
	else printf("%d\n",ans);
return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:65:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:68:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&p,&q,&c);
                           ^

ジャッジ結果