oj.uz

Submission #91438

# Submission time Handle Problem Language Result Execution time Memory
91438 2018-12-27T13:14:33 Z arman_ferdous Crocodile's Underground City (IOI11_crocodile) C++17
89 / 100
 728 ms 101420 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 1e5+10;
const ll INF = 1e18;

int n, isExit[N]; ll d[N][2];
vector< pair<int,int> > g[N];
priority_queue< pair<ll,int>, vector< pair<ll,int> >, greater< pair<ll,int> > > q;

int travel_plan(int N_, int M, int R[][2], int L[], int K, int P[]) {
	n = N_;
	for(int i = 0; i < M; i++) {
		g[R[i][0]].push_back({R[i][1], L[i]});
		g[R[i][1]].push_back({R[i][0], L[i]});
	}
	for(int i = 0; i < n; i++) d[i][0] = d[i][1] = INF;
	for(int i = 0; i < K; i++) {
		d[P[i]][0] = d[P[i]][1] = 0;
		q.push({0, P[i]});
	}
	while(!q.empty()) {
		auto top = q.top(); q.pop();
		int u = top.second; ll cw = top.first;
		if(cw > d[u][1]) continue;
		for(auto e : g[u]) {
			if(cw + e.second <= d[e.first][0]) {
				d[e.first][1] = d[e.first][0];
				d[e.first][0] = cw + e.second;
				q.push({d[e.first][1], e.first});
			}
			else if(cw + e.second < d[e.first][1]) {
				d[e.first][1] = cw + e.second;
				q.push({d[e.first][1], e.first});
			}
		}
	}
	return d[0][1];
}

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 4 ms 2856 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 4 ms 3084 KB Output is correct
6 Correct 4 ms 3084 KB Output is correct
7 Correct 4 ms 3084 KB Output is correct
8 Correct 4 ms 3084 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 4 ms 2856 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 4 ms 3084 KB Output is correct
6 Correct 4 ms 3084 KB Output is correct
7 Correct 4 ms 3084 KB Output is correct
8 Correct 4 ms 3084 KB Output is correct
9 Correct 5 ms 3272 KB Output is correct
10 Correct 4 ms 3272 KB Output is correct
11 Correct 4 ms 3272 KB Output is correct
12 Correct 7 ms 3584 KB Output is correct
13 Correct 7 ms 3744 KB Output is correct
14 Correct 4 ms 3744 KB Output is correct
15 Correct 4 ms 3744 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2816 KB Output is correct
3 Correct 4 ms 2856 KB Output is correct
4 Correct 4 ms 2900 KB Output is correct
5 Correct 4 ms 3084 KB Output is correct
6 Correct 4 ms 3084 KB Output is correct
7 Correct 4 ms 3084 KB Output is correct
8 Correct 4 ms 3084 KB Output is correct
9 Correct 5 ms 3272 KB Output is correct
10 Correct 4 ms 3272 KB Output is correct
11 Correct 4 ms 3272 KB Output is correct
12 Correct 7 ms 3584 KB Output is correct
13 Correct 7 ms 3744 KB Output is correct
14 Correct 4 ms 3744 KB Output is correct
15 Correct 4 ms 3744 KB Output is correct
16 Correct 511 ms 61296 KB Output is correct
17 Correct 102 ms 61296 KB Output is correct
18 Correct 142 ms 61296 KB Output is correct
19 Correct 728 ms 91884 KB Output is correct
20 Correct 292 ms 91884 KB Output is correct
21 Correct 46 ms 91884 KB Output is correct
22 Incorrect 321 ms 101420 KB Output isn't correct