oj.uz

Submission #392895

# Submission time Handle Problem Language Result Execution time Memory
392895 2021-04-22T08:48:43 Z Aryan_Raina Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 2000 ms 204 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;

#define ar array

int travel_plan(int n, int m, int R[][2], int L[], int k, int P[]) {
	vector<ar<int,2>> g[n];
	for (int i = 0; i < m; i++) {
		g[R[i][0]].push_back({L[i], R[i][1]});
		g[R[i][1]].push_back({L[i], R[i][0]});
	}
  	priority_queue<ar<int,4>, vector<ar<int,4>>, greater<ar<int,4>>> pq;
  	// distance, node, parent, root
  	vector<ar<int,3>> dist1(n,  {-1,-1,-1}), dist2(n, {-1,-1,-1});
  	// distance, parent, root
  	for (int i = 0; i < k; i++) pq.push({0,P[i],-1,P[i]});
  	while (!pq.empty()) {
  		int u = pq.top()[1], d = pq.top()[0];
  		int rt = pq.top()[3], par = pq.top()[2];
  		pq.pop();

  		if (dist1[u][0] == -1) {
  			dist1[u] = {d, par, rt};
  		} else if (dist2[u][0] == -1 && dist1[u][2] != rt) {
  			dist2[u] = {d, par, rt};
  		} else continue;

  		for (auto v : g[u]) if (dist2[v[1]][0] == -1) {
  			pq.push({d + v[0], v[1], u, rt});
  		}
  	}
  	
  	int u = 0, res = 0;
  	while (dist1[u][0] != 0) {
  		for (auto v : g[u]) if (v[1] == dist2[u][1]) {
  			u = v[1]; res += v[0]; break;
  		}
  	}
  	return res;
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2095 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2095 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2095 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -