Submission #3229169


Source Code Expand

#include <iostream>
#include <algorithm>
#include <queue>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 100005;
struct Edge{
	int to,next,w;
}e[MAXN<<3];
struct E{
	int u,v,c;
	bool operator < (const E &b)const
	{
		return c<b.c;
	}
}t[MAXN<<1];
int head[MAXN<<3],n,m,fa[MAXN],id[MAXN],sz;
bool vis[MAXN<<3];
int getan(int x)
{
	return x==fa[x]?x:fa[x]=getan(fa[x]);
}
int cnt=0;
inline void insert(int u,int v,int w)
{
	e[++cnt].to=v,e[cnt].next=head[u],head[u]=cnt,e[cnt].w=w;
}
inline void work(int l,int r)
{
	for(int i=l;i<=r;++i){
		vis[t[i].u]=vis[t[i].v]=id[t[i].u]=id[t[i].v]=0;
		fa[t[i].u]=t[i].u;
		fa[t[i].v]=t[i].v;
	}
	for(int i=l,x,y;i<=r;++i)
		x=getan(t[i].u),y=getan(t[i].v),fa[x]=y;
	for(int i=l,x,y;i<=r;++i){
		x=getan(t[i].u),y=getan(t[i].v);
		if(!vis[t[i].u]){
			if(!id[x])id[x]=++sz;
			insert(t[i].u,id[x],0);
			insert(id[x],t[i].u,1);
			vis[t[i].u]=1;
		}
		if(!vis[t[i].v]){
			if(!id[y])id[y]=++sz;
			insert(t[i].v,id[y],0);
			insert(id[y],t[i].v,1);
			vis[t[i].v]=1;
		}
	}
}
struct Node{
	int x,v;
	bool operator < (const Node &b)const
	{
		return v>b.v;
	}
};
priority_queue<Node>q;
int d[MAXN<<3];
inline void dij()
{
	memset(vis,0,sizeof(vis));
	memset(d,0x3f,sizeof(d));
	d[1]=0;
	q.push((Node){1,0});
	while(!q.empty()){
		Node x=q.top();
		q.pop();
		int u=x.x;
		if(vis[u])continue;
		vis[u]=true;
		for(int i=head[u];i;i=e[i].next){
			int v=e[i].to;
			if(d[v]>d[u]+e[i].w){
				d[v]=d[u]+e[i].w;
				q.push((Node){v,d[v]});
			}
		}
	}
	cout<<(d[n]==0x3f3f3f3f?-1:d[n])<<endl;
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;++i){
		scanf("%d%d%d",&t[i].u,&t[i].v,&t[i].c);
	}
	sz=n;
	sort(t+1,t+m+1);
	int p=1;
	while(p<=m){
		int r=p;
		while(t[r+1].c==t[r].c)++r;
		work(p,r);
		p=r+1;
	}
	dij();
	return 0;
}

Submission Info

Submission Time
Task E - Snuke's Subway Trip
User DFPMTS
Language C++14 (GCC 5.4.1)
Score 600
Code Size 1899 Byte
Status AC
Exec Time 127 ms
Memory 20856 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:87: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:89:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&t[i].u,&t[i].v,&t[i].c);
                                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status AC
AC × 59
Set Name Test Cases
Sample
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, sample_01.txt, sample_02.txt, sample_03.txt, w1.txt, w10.txt, w11.txt, w12.txt, w13.txt, w14.txt, w15.txt, w16.txt, w17.txt, w18.txt, w2.txt, w3.txt, w4.txt, w5.txt, w6.txt, w7.txt, w8.txt, w9.txt
Case Name Status Exec Time Memory
01.txt AC 4 ms 10496 KB
02.txt AC 61 ms 14592 KB
03.txt AC 115 ms 20476 KB
04.txt AC 67 ms 19712 KB
05.txt AC 101 ms 19324 KB
06.txt AC 44 ms 16640 KB
07.txt AC 62 ms 16896 KB
08.txt AC 127 ms 20476 KB
09.txt AC 63 ms 16768 KB
10.txt AC 64 ms 16768 KB
11.txt AC 73 ms 15736 KB
12.txt AC 46 ms 10496 KB
13.txt AC 60 ms 12928 KB
14.txt AC 75 ms 15736 KB
15.txt AC 70 ms 13688 KB
16.txt AC 74 ms 15736 KB
17.txt AC 79 ms 15736 KB
18.txt AC 53 ms 12672 KB
19.txt AC 72 ms 15736 KB
20.txt AC 77 ms 17784 KB
21.txt AC 110 ms 20472 KB
22.txt AC 83 ms 17784 KB
23.txt AC 95 ms 17276 KB
24.txt AC 84 ms 15736 KB
25.txt AC 46 ms 10496 KB
26.txt AC 57 ms 12928 KB
27.txt AC 71 ms 17784 KB
28.txt AC 75 ms 17784 KB
29.txt AC 72 ms 17784 KB
30.txt AC 72 ms 15736 KB
31.txt AC 55 ms 12672 KB
32.txt AC 70 ms 15736 KB
33.txt AC 69 ms 17784 KB
34.txt AC 68 ms 13688 KB
35.txt AC 47 ms 10496 KB
36.txt AC 55 ms 12928 KB
37.txt AC 69 ms 15736 KB
38.txt AC 67 ms 13688 KB
sample_01.txt AC 4 ms 10496 KB
sample_02.txt AC 4 ms 10496 KB
sample_03.txt AC 3 ms 6400 KB
w1.txt AC 79 ms 15736 KB
w10.txt AC 76 ms 19712 KB
w11.txt AC 51 ms 10496 KB
w12.txt AC 56 ms 12544 KB
w13.txt AC 65 ms 14592 KB
w14.txt AC 70 ms 18944 KB
w15.txt AC 48 ms 10496 KB
w16.txt AC 49 ms 10496 KB
w17.txt AC 52 ms 12544 KB
w18.txt AC 61 ms 12544 KB
w2.txt AC 78 ms 15736 KB
w3.txt AC 84 ms 17784 KB
w4.txt AC 74 ms 15736 KB
w5.txt AC 113 ms 20856 KB
w6.txt AC 97 ms 19324 KB
w7.txt AC 83 ms 20096 KB
w8.txt AC 84 ms 19840 KB
w9.txt AC 80 ms 19840 KB