oj.uz

Submission #200274

# Submission time Handle Problem Language Result Execution time Memory
200274 2020-02-06T00:28:36 Z AQT Crocodile's Underground City (IOI11_crocodile) C++14
100 / 100
 712 ms 62608 KB 
#include "crocodile.h"
#include <bits/stdc++.h>

using namespace std;

vector<pair<int, int>> graph[100005];
long long dist[2][100005];
bool done[100005];
int cnt[100005];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

int travel_plan(int N, int M, int R[][2], int W[], int K, int E[]){
    for(int i= 0; i<M; i++){
        graph[R[i][0]].push_back({R[i][1], W[i]});
    	graph[R[i][1]].push_back({R[i][0], W[i]});
	}
	for(int i = 0; i<N; i++){
		dist[0][i] = dist[1][i] = LLONG_MAX/2;
	}
	for(int i = 0; i<K; i++){
		dist[0][E[i]] = dist[1][E[i]] = 0;
		pq.push({0, E[i]});
	}
	while(pq.size()){
		auto p = pq.top();
		pq.pop();
		if(done[p.second]){
			continue;
		}
		int n = p.second;
		done[n] = 1;
		//cout << n << " " << dist[0][n] << " " << dist[1][n] << "\n";
		for(auto e : graph[n]){
			//cout << e.first << " " << e.second << "\n";
			if(dist[0][e.first] >= dist[1][n] + e.second){
				dist[1][e.first] = dist[0][e.first];
				dist[0][e.first] = dist[1][n] + e.second;
				cnt[e.first]++;
				if(cnt[e.first] >= 2){
					pq.push({dist[1][e.first], e.first});
				}
			}
			else if(dist[1][e.first] > dist[1][n] + e.second){
				dist[1][e.first] = dist[1][n] + e.second;
				cnt[e.first]++;
				if(cnt[e.first] >= 2){
					pq.push({dist[1][e.first], e.first});
				}
			}
		}
	}
	if(dist[1][0] == INT_MAX/2){
		dist[1][0] = -1;
	}
	return dist[1][0];
}
/*
int sampleR[4][2] = {{0, 1}, {0, 2}, {3, 2}, {2, 4}};
int sampleL[4] = {2, 3, 1, 4};
int sampleP[3] = {1, 3, 4};
*/
/*
int sampleR[7][2] = {{0, 2}, {0, 3}, {3, 2}, {2, 1}, {0, 1}, {0, 4}, {3, 4}};
int sampleL[7] = {4, 3, 2, 10, 100, 7, 9};
int sampleP[2] = {1, 3};

int main(){
	cout << travel_plan(5, 7, sampleR, sampleL, 2, sampleP);
}
*/

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 6 ms 2680 KB Output is correct
3 Correct 7 ms 2680 KB Output is correct
4 Correct 7 ms 2808 KB Output is correct
5 Correct 8 ms 2808 KB Output is correct
6 Correct 7 ms 2680 KB Output is correct
7 Correct 7 ms 2808 KB Output is correct
8 Correct 7 ms 2808 KB Output is correct
9 Correct 9 ms 2936 KB Output is correct
10 Correct 6 ms 2680 KB Output is correct
11 Correct 7 ms 2812 KB Output is correct
12 Correct 10 ms 3192 KB Output is correct
13 Correct 10 ms 3192 KB Output is correct
14 Correct 6 ms 2680 KB Output is correct
15 Correct 7 ms 2808 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2680 KB Output is correct
2 Correct 6 ms 2680 KB Output is correct
3 Correct 7 ms 2680 KB Output is correct
4 Correct 7 ms 2808 KB Output is correct
5 Correct 8 ms 2808 KB Output is correct
6 Correct 7 ms 2680 KB Output is correct
7 Correct 7 ms 2808 KB Output is correct
8 Correct 7 ms 2808 KB Output is correct
9 Correct 9 ms 2936 KB Output is correct
10 Correct 6 ms 2680 KB Output is correct
11 Correct 7 ms 2812 KB Output is correct
12 Correct 10 ms 3192 KB Output is correct
13 Correct 10 ms 3192 KB Output is correct
14 Correct 6 ms 2680 KB Output is correct
15 Correct 7 ms 2808 KB Output is correct
16 Correct 597 ms 57736 KB Output is correct
17 Correct 100 ms 15096 KB Output is correct
18 Correct 121 ms 16504 KB Output is correct
19 Correct 712 ms 62608 KB Output is correct
20 Correct 351 ms 49656 KB Output is correct
21 Correct 49 ms 8056 KB Output is correct
22 Correct 384 ms 46712 KB Output is correct