제출 #483678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
483678		PoPularPlusPlus	악어의 지하 도시 (IOI11_crocodile)	C++17	0 / 100	2 ms	460 KiB

crocodile

#include "crocodile.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

vector<pair<int,ll>	> adj[1003];
bool vis[1003];
ll dp[1003];

void dfs(int node){
	vis[node] = 1;
	vector<int> v;
	for(auto it : adj[node]){
		int j = it.vf , w = it.vs;
		if(!vis[j]){
			dfs(j);
			v.pb(w + dp[j]);
		}
	}
	sv(v);
	dp[node] = v[1];
}

int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]){
	for(int i = 0; i < m; i++){
		adj[r[i][0]].pb(mp(r[i][1] , l[i]));
		adj[r[i][1]].pb(mp(r[i][0] , l[i]));
	}
	memset(vis,0,sizeof vis);
	dfs(0);
	return dp[0];
}

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