제출 #900318

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
900318		Muhammad_Aneeq	악어의 지하 도시 (IOI11_crocodile)	C++17	46 / 100	42 ms	6396 KiB

crocodile

#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int const MAXN=1e5+10;
vector<pair<int,int>>nei[MAXN]={};
bool ex[MAXN]={};
bool vis1[MAXN]={};
map<pair<int,int>,int>vis,value;
bool comp(pair<int,int>a,pair<int,int>b)
{
	return (a.second<=b.second);
}
int dfs(int n,int val)
{
	if (ex[n])
		return val;
	vis1[n]=1;
	vector<int>g;
	int mn1=1e9+10,mn2=1e9+10;
	for (auto [i,w1]:nei[n])
	{
		if (!vis1[i])
		{
			int z;
			if (vis[{i,n}]==0)
			{
				z=dfs(i,val+w1);
				value[{i,n}]=z-val;
				vis[{i,n}]=1;
			}
			else
			{
				z=value[{i,n}]+val;
			}
			if (z<mn1)
			{
				mn2=mn1;
				mn1=z;
			}
			else if (mn2>z)
				mn2=z;
		}
	}
	vis1[n]=0;
	return mn2;
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
	for (int i=0;i<M;i++)
	{
		nei[R[i][0]].push_back({R[i][1],L[i]});
		nei[R[i][1]].push_back({R[i][0],L[i]});
	}
	for  (int i=0;i<K;i++)
		ex[P[i]]=1;
	for (int i=0;i<N;i++)
		sort(begin(nei[i]),end(nei[i]),comp);
	return dfs(0,0);
}

• Subtask 1: 46 / 46
• Subtask 2: 0 / 43
• Subtask 3: 0 / 11