oj.uz

Submission #234896

# Submission time Handle Problem Language Result Execution time Memory
234896 2020-05-26T07:53:40 Z Nodir_Bobiev Crocodile's Underground City (IOI11_crocodile) C++14
89 / 100
 725 ms 45816 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;

vector < pair < int, int > > gr[111111];
int cnt[111111], min1[111111], min2[111111], Vmin1[111111], Vmin2[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] = 2e9+10;
	}
	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()){
		pair < int, int > pp = q.front(); q.pop();
		int c = pp.first, v = pp.second;
		if( cnt[v] != c ) continue;
		for( auto edge: gr[v] ){
			int cost = edge.first, to = edge.second;
			if( min1[to] > min2[v]+cost ){
				if( Vmin1[to] == v ){
					min1[to] = min2[v]+cost;
				}else{
					min2[to] = min1[to];
					Vmin2[to] = Vmin1[to];
					min1[to] = min2[v]+cost;
					Vmin1[to] = v;
					q.push({++cnt[to], to});
				}
			}
			else if( min2[to] > min2[v]+cost ){
				min2[to] = min2[v] + cost;
				Vmin2[to] = v;
				q.push({++cnt[to], to});
			}
		}
	}
	/*
	for( int i = 0; i < N; i ++ ){
		cout << "min1[" << i <<"]=" << min1[i] << "; min2[" << i << "]="<<min2[i]<<endl;
	}
	*/
	return min2[0];
}

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 6 ms 3072 KB Output is correct
7 Correct 6 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 6 ms 3072 KB Output is correct
7 Correct 6 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 7 ms 3072 KB Output is correct
11 Correct 7 ms 3072 KB Output is correct
12 Correct 10 ms 3328 KB Output is correct
13 Correct 9 ms 3328 KB Output is correct
14 Correct 7 ms 3072 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 6 ms 3072 KB Output is correct
7 Correct 6 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 7 ms 3072 KB Output is correct
11 Correct 7 ms 3072 KB Output is correct
12 Correct 10 ms 3328 KB Output is correct
13 Correct 9 ms 3328 KB Output is correct
14 Correct 7 ms 3072 KB Output is correct
15 Correct 7 ms 3072 KB Output is correct
16 Correct 516 ms 40824 KB Output is correct
17 Correct 92 ms 12024 KB Output is correct
18 Correct 210 ms 13380 KB Output is correct
19 Correct 725 ms 45816 KB Output is correct
20 Correct 334 ms 36888 KB Output is correct
21 Correct 80 ms 6904 KB Output is correct
22 Incorrect 375 ms 32560 KB Output isn't correct