oj.uz

Submission #234719

# Submission time Handle Problem Language Result Execution time Memory
234719 2020-05-25T10:42:42 Z Dilshod_Imomov Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 5 ms 384 KB 
#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;

const int NN = 1e3 + 7;

vector < pair < int, int > > adj[NN];
int dp[NN], l[NN];

void dfs( int v, int p ) {
	int mn1 = 0, mn2 = 0;
	// cout << v << ' ' << p << '\n';
	for ( auto pr: adj[v] ) {
		int u = pr.first, ind = pr.second;
		if ( u != p ) {
			dfs( u, v );
			int cnt = dp[u] + l[ind];
			if ( cnt <= mn1 ) {
				mn2 = mn1;
				mn1 = cnt;
			}
			else if ( cnt < mn2 ) {
				mn2 = cnt;
			}
		}
	}
	if ( mn2 == 0 ) {
		mn2 = mn1;
	}
	dp[v] = mn2;
}

int travel_plan(int n, int m, int R[][2], int L[], int K, int P[])
{
	for ( int i = 0; i < m; i++ ) {
		int u = R[i][0], v = R[i][1];
		adj[u].push_back( { v, i } );
		adj[v].push_back( { u, i } );
		l[i] = L[i];
	}
	dfs( 0, 0 );
	return dp[0];
}

Subtask #1
0 / 46.0

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

Subtask #2
0 / 43.0

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

Subtask #3
0 / 11.0

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