oj.uz

Submission #900324

# Submission time Handle Problem Language Result Execution time Memory
900324 2024-01-08T06:59:17 Z Muhammad_Aneeq Crocodile's Underground City (IOI11_crocodile) C++17
0 / 100
 1 ms 4444 KB 
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
long long const MAXN=2000;
long long dp[1000][1000];
int travel_plan(int n, int M, int R[][2], int L[], int K, int P[])
{
	for (int i=0;i<n;i++)
		for (int j=0;j<n;j++)
		{
			dp[i][j]=1e18+10;
			if (i==j)
				dp[i][j]=0;
		}
	for (int i=0;i<M;i++)
	{
		dp[R[i][0]][R[i][1]]=L[i];
		dp[R[i][1]][R[i][0]]=L[i];
	}
	for (int i=0;i<n;i++)
		for (int j=0;j<n;j++)
			for (int k=0;k<n;k++)
				dp[j][k]=min(dp[j][k],dp[j][i]+dp[i][k]);
	vector<int>z;
	for (int i=0;i<K;i++)
	{
		z.push_back(dp[0][P[i]]);
	}
	sort(begin(z),end(z));
	return z.back();
}

Subtask #1
0 / 46.0

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

Subtask #2
0 / 43.0

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

Subtask #3
0 / 11.0

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