oj.uz

Submission #64687

# Submission time Handle Problem Language Result Execution time Memory
64687 2018-08-05T12:10:16 Z zetapi Crocodile's Underground City (IOI11_crocodile) C++14
89 / 100
 1200 ms 94384 KB 
#include <crocodile.h>
 
#include <bits/stdc++.h>
using namespace std;
 
#define pb  push_back
#define mp  make_pair
#define ll 	long long
#define itr ::iterator 
 
typedef pair<ll,ll>  pii;
 
const ll MAX=1e6;
const ll INF=1e14;
 
vector<pii> vec[MAX];
 
ll mark[MAX],dp[MAX],mn[MAX];
 
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{	
	for(int A=0;A<M;A++)
	{
		vec[R[A][0]].pb(mp(R[A][1],L[A]));
		vec[R[A][1]].pb(mp(R[A][0],L[A]));
	}
	for(int A=0;A<N;A++)
	{
		mn[A]=-1;
		dp[A]=-1;
	}
	priority_queue<pii,vector<pii>,greater<pii>> pq;
	for(int A=0;A<K;A++)
	{
		dp[P[A]]=0;
		mn[P[A]]=0;
		pq.push(mp(0,P[A]));
	}
	while(!pq.empty())
	{
		pii cur=pq.top();
		pq.pop();
		if(cur.first>dp[cur.second])
			continue;
		for(auto A:vec[cur.second])
		{
			if(dp[A.first]==-1)
			{
				dp[A.first]=INF;
				mn[A.first]=cur.first+A.second;
			}
			else if(cur.first+A.second<dp[A.first])
			{
				dp[A.first]=cur.first+A.second;
				if(dp[A.first]<mn[A.first])
					swap(dp[A.first],mn[A.first]);
				pq.push(mp(dp[A.first],A.first));
			}			
		}
	}
	return dp[0];
}
 
/*signed main()
{
	ios_base::sync_with_stdio(false);
 
	int R[][2]={{0,2},{0,3},{3,2},{2,1},{0,1},{0,4},{3,4}};
	int L[]={4,3,2,10,100,7,9};
	int P[]={1,3};
	cout<<travel_plan(5,7,R,L,2,P);
	return 0;
}*/

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 23800 KB Output is correct
2 Correct 30 ms 23976 KB Output is correct
3 Correct 29 ms 23988 KB Output is correct
4 Correct 30 ms 24060 KB Output is correct
5 Correct 30 ms 24060 KB Output is correct
6 Correct 31 ms 24060 KB Output is correct
7 Correct 27 ms 24188 KB Output is correct
8 Correct 23 ms 24188 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 23800 KB Output is correct
2 Correct 30 ms 23976 KB Output is correct
3 Correct 29 ms 23988 KB Output is correct
4 Correct 30 ms 24060 KB Output is correct
5 Correct 30 ms 24060 KB Output is correct
6 Correct 31 ms 24060 KB Output is correct
7 Correct 27 ms 24188 KB Output is correct
8 Correct 23 ms 24188 KB Output is correct
9 Correct 29 ms 24392 KB Output is correct
10 Correct 28 ms 24392 KB Output is correct
11 Correct 32 ms 24392 KB Output is correct
12 Correct 34 ms 24648 KB Output is correct
13 Correct 27 ms 24776 KB Output is correct
14 Correct 25 ms 24776 KB Output is correct
15 Correct 34 ms 24776 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 23800 KB Output is correct
2 Correct 30 ms 23976 KB Output is correct
3 Correct 29 ms 23988 KB Output is correct
4 Correct 30 ms 24060 KB Output is correct
5 Correct 30 ms 24060 KB Output is correct
6 Correct 31 ms 24060 KB Output is correct
7 Correct 27 ms 24188 KB Output is correct
8 Correct 23 ms 24188 KB Output is correct
9 Correct 29 ms 24392 KB Output is correct
10 Correct 28 ms 24392 KB Output is correct
11 Correct 32 ms 24392 KB Output is correct
12 Correct 34 ms 24648 KB Output is correct
13 Correct 27 ms 24776 KB Output is correct
14 Correct 25 ms 24776 KB Output is correct
15 Correct 34 ms 24776 KB Output is correct
16 Correct 882 ms 87960 KB Output is correct
17 Correct 145 ms 87960 KB Output is correct
18 Correct 179 ms 87960 KB Output is correct
19 Correct 1200 ms 94384 KB Output is correct
20 Correct 558 ms 94384 KB Output is correct
21 Correct 84 ms 94384 KB Output is correct
22 Incorrect 491 ms 94384 KB Output isn't correct