oj.uz

Submission #91404

# Submission time Handle Problem Language Result Execution time Memory
91404 2018-12-27T11:23:27 Z arman_ferdous Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 4 ms 2860 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> > 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(d[u][1] + e.second < d[e.first][0]) {
				swap(d[e.first][0], d[e.first][1]);
				d[e.first][0] = d[u][1] + e.second;
				q.push({d[e.first][0], e.first});
			}
			else if(d[u][1] + e.second < d[e.first][1]) {
				d[e.first][1] = d[u][1] + e.second;
				q.push({d[e.first][1], e.first});
			}
		}
	} 
	return d[0][1];
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 3 ms 2844 KB Output is correct
3 Incorrect 3 ms 2860 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 3 ms 2844 KB Output is correct
3 Incorrect 3 ms 2860 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 3 ms 2844 KB Output is correct
3 Incorrect 3 ms 2860 KB Output isn't correct
4 Halted 0 ms 0 KB -