oj.uz

Submission #234909

# Submission time Handle Problem Language Result Execution time Memory
234909 2020-05-26T08:39:08 Z Nodir_Bobiev Crocodile's Underground City (IOI11_crocodile) C++14
89 / 100
 691 ms 47208 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;

vector < pair < int, int > > gr[111111];
int cnt[111111], min1[111111], min2[111111];

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	for(int i = 0; i < M; i ++ ){
		gr[R[i][0]].push_back({L[i], R[i][1]});
		gr[R[i][1]].push_back({L[i], R[i][0]});
	}
	for( int i = 0; i < N; i ++ ){
		min1[i] = min2[i] = 1e9;
	}
	priority_queue < pair < int, int > > q;
	for( int i = 0; i < K; i ++ ){
		min1[P[i]] = min2[P[i]] = 0;
		q.push({0, P[i]});
	}
	while(!q.empty()){
		auto [dst, v] = q.top(); q.pop();
		if( -dst != min2[v] )continue;
		for( auto [cost, to]: gr[v] ){
			if( min1[to] > min2[v]+cost ){
				min2[to] = min1[to];
				min1[to] = min2[v]+cost;
				q.push({-min2[to], to});
			}
			else if( min2[to] > min2[v]+cost ){
				min2[to] = min2[v] + cost;
				q.push({-min2[to], to});
			}
		}
	}
	/*
	for( int i = 0; i < N; i ++ ){
		cout << "min1[" << i <<"]=" << min1[i] << "; min2[" << i << "]="<<min2[i]<<endl;
	}
	*/
	return min2[0];
}

Compilation message

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:23:8: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
   auto [dst, v] = q.top(); q.pop();
        ^
crocodile.cpp:25:13: warning: decomposition declaration only available with -std=c++1z or -std=gnu++1z
   for( auto [cost, to]: gr[v] ){
             ^

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2944 KB Output is correct
2 Correct 6 ms 2944 KB Output is correct
3 Correct 6 ms 2944 KB Output is correct
4 Correct 7 ms 3072 KB Output is correct
5 Correct 7 ms 3072 KB Output is correct
6 Correct 7 ms 3072 KB Output is correct
7 Correct 7 ms 3072 KB Output is correct
8 Correct 7 ms 3072 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2944 KB Output is correct
2 Correct 6 ms 2944 KB Output is correct
3 Correct 6 ms 2944 KB Output is correct
4 Correct 7 ms 3072 KB Output is correct
5 Correct 7 ms 3072 KB Output is correct
6 Correct 7 ms 3072 KB Output is correct
7 Correct 7 ms 3072 KB Output is correct
8 Correct 7 ms 3072 KB Output is correct
9 Correct 8 ms 3200 KB Output is correct
10 Correct 6 ms 2944 KB Output is correct
11 Correct 7 ms 3072 KB Output is correct
12 Correct 9 ms 3328 KB Output is correct
13 Correct 9 ms 3328 KB Output is correct
14 Correct 6 ms 2944 KB Output is correct
15 Correct 7 ms 3072 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2944 KB Output is correct
2 Correct 6 ms 2944 KB Output is correct
3 Correct 6 ms 2944 KB Output is correct
4 Correct 7 ms 3072 KB Output is correct
5 Correct 7 ms 3072 KB Output is correct
6 Correct 7 ms 3072 KB Output is correct
7 Correct 7 ms 3072 KB Output is correct
8 Correct 7 ms 3072 KB Output is correct
9 Correct 8 ms 3200 KB Output is correct
10 Correct 6 ms 2944 KB Output is correct
11 Correct 7 ms 3072 KB Output is correct
12 Correct 9 ms 3328 KB Output is correct
13 Correct 9 ms 3328 KB Output is correct
14 Correct 6 ms 2944 KB Output is correct
15 Correct 7 ms 3072 KB Output is correct
16 Correct 556 ms 42480 KB Output is correct
17 Correct 115 ms 11892 KB Output is correct
18 Correct 137 ms 13300 KB Output is correct
19 Correct 691 ms 47208 KB Output is correct
20 Correct 339 ms 37072 KB Output is correct
21 Correct 54 ms 6904 KB Output is correct
22 Incorrect 364 ms 32376 KB Output isn't correct