oj.uz

Submission #44539

# Submission time Handle Problem Language Result Execution time Memory
44539 2018-04-03T04:16:28 Z vatsalsharma376 Sightseeing (NOI14_sightseeing) C++14
15 / 25
 3500 ms 194080 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define pb  push_back
#define mp  make_pair
#define ll  long long
#define int long long
#define F   first
#define S   second
#define itr ::iterator 
 
typedef pair<int,int> pii;
 
const int MAX=6e5+99;

vector<pii> vec[MAX];

int V,E,Q,X,Y,Z,res[MAX];

void dijkstra()
{
	pii cur;
	priority_queue<pii> pq;
	pq.push(mp(MAX,1));
	res[1]=MAX;
	while(! pq.empty())
	{
		cur=pq.top();
		pq.pop();
		if(cur.first < res[cur.second])
		continue;
		for(auto A:vec[cur.second])
		if(min(cur.first,A.second)>res[A.first])
		{
			res[A.first]=min(cur.first,A.second);
			pq.push(mp(res[A.first],A.first));
		}
	}
	return ;
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin>>V>>E>>Q;
	while(E--)
	{
		cin>>X>>Y>>Z;
		vec[X].pb(mp(Y,Z));
		vec[Y].pb(mp(X,Z));
	}
	dijkstra();
	while(Q--)
	{
		cin>>X;
		cout<<res[X]<<"\n";
	}
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 14456 KB Output is correct
2 Correct 13 ms 14568 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 14696 KB Output is correct
2 Correct 13 ms 14696 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 17888 KB Output is correct
2 Correct 50 ms 17888 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3548 ms 194080 KB Time limit exceeded
2 Halted 0 ms 0 KB -