oj.uz

Submission #139642

# Submission time Handle Problem Language Result Execution time Memory
139642 2019-08-01T08:14:34 Z muradeyn Crocodile's Underground City (IOI11_crocodile) C++14
0 / 100
 2 ms 376 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
#define F first
#define S second

using namespace std;

const int maxx = 1000;

int ext[maxx];

vector< pair<int,int> >adj[maxx];
vector<int> thru[maxx];

void dfs(int s,int p) {
	if (ext[s])return;
	for (auto to : adj[s]) {
		if (to.F == p)continue;
		dfs(to.F , s);
		if (ext[to.F])thru[s].push_back(to.S);
		else {
			for (int take : thru[to.F])
				thru[s].push_back(take + to.S);
		}
	}
	if (thru[s].size() < 2)thru[s].clear();
	sort(thru[s].begin(),thru[s].end());
}

int travel_plan(int n, int m, int R[][2], int L[], int k, int P[]) {
	for (int i = 0;i<m;i++) {
		int x = R[i][0] , y = R[i][1];
		adj[x].push_back( {y , L[i]} );
		adj[y].push_back( {x , L[i]} );
	}
	for (int i = 0;i<k;i++) ext[P[i]] = 1;
	dfs(0 , -1);
	return *--thru[0].end();
}

Subtask #1
0 / 46.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -