oj.uz

Submission #106303

# Submission time Handle Problem Language Result Execution time Memory
106303 2019-04-17T20:30:01 Z tincamatei Crocodile's Underground City (IOI11_crocodile) C++14
89 / 100
 831 ms 46864 KB 
#include "crocodile.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100000;
const int INF = 1000000001;

vector<pair<int, int> > graph[MAX_N];
int best[MAX_N][2];

void dijkstra(int N, int K, int P[]) {
	priority_queue<pair<int, int> > pq;

	for(int i = 0; i < K; ++i) {
		best[P[i]][0] = best[P[i]][1] = 0;
		pq.push(make_pair(0, P[i]));
	}

	while(!pq.empty()) {
		int nod = pq.top().second;
		int cost = -pq.top().first;

		pq.pop();

		if(best[nod][1] == cost) {
			for(auto it: graph[nod]) {
				int cost2 = cost + it.second;
				if(cost2 < best[it.first][0]) {
					best[it.first][1] = best[it.first][0];
					best[it.first][0] = cost2;

					pq.push({-best[it.first][1], it.first});
				} else if(cost2 < best[it.first][1]) {
					best[it.first][1] = cost2;

					pq.push({-cost2, it.first});
				}
			}
		}
	}
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
  for(int i = 0; i < M; ++i) {
		graph[R[i][0]].push_back(make_pair(R[i][1], L[i]));
		graph[R[i][1]].push_back(make_pair(R[i][0], L[i]));
	}
	for(int i = 0; i < N; ++i) {
		best[i][0] = INF;
		best[i][1] = INF + 1;
	}
	
	dijkstra(N, K, P);
	return best[0][1];
}

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 4 ms 2688 KB Output is correct
4 Correct 5 ms 2688 KB Output is correct
5 Correct 5 ms 2816 KB Output is correct
6 Correct 5 ms 2816 KB Output is correct
7 Correct 5 ms 2732 KB Output is correct
8 Correct 4 ms 2688 KB Output is correct
9 Correct 8 ms 2944 KB Output is correct
10 Correct 5 ms 2688 KB Output is correct
11 Correct 6 ms 2816 KB Output is correct
12 Correct 8 ms 3200 KB Output is correct
13 Correct 6 ms 3072 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 6 ms 2816 KB Output is correct
16 Correct 613 ms 42092 KB Output is correct
17 Correct 98 ms 11636 KB Output is correct
18 Correct 154 ms 13044 KB Output is correct
19 Correct 831 ms 46864 KB Output is correct
20 Correct 331 ms 36728 KB Output is correct
21 Correct 54 ms 6648 KB Output is correct
22 Incorrect 388 ms 32220 KB Output isn't correct