Submission #349615

#	Time	Username	Problem	Language	Result	Execution time	Memory
349615		evn	악어의 지하 도시 (IOI11_crocodile)	C++14	Compilation error	0 ms	0 KiB

crocodile

#include <bits/stdc++.h>
#include "crocodile.h"
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
typedef long long ll;
typedef pair<int, int> pii;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll dist[1005];
vector<pii> adj[1005];
bool isExit[1005];
ll ans = 1e18;
void dfs(int u, int p){
	for(pii e : adj[u]){
		int v=e.f;
		int w = e.s;
		if(v == p)continue;
		dist[v] = dist[u] + 1LL * w;
		dfs(v, u);
	}
	vector<ll> children;
	for(pii e : adj[u]){
		if(e.f != p){
			children.pb(dist[e.f]);
		}
	}
	sort(children.begin(), children.end());
	if(children.size() >= 2){
		ans = min(ans, children[1]);
	}
}
int travel_plan(int N, int M, vector<vector<int>> R, vector<int> L, int K, vector<int> P){
	for(int i =0; i < R.size(); i++){
		adj[R[i][0]].pb({R[i][1], L[i]});
		adj[R[i][1]].pb({R[i][0], L[i]});
	}
	for(int i = 0; i < K; i++){
		isExit[P[i]] = true;
	}
	dfs(0, -1);
	return (int)ans;
}
/**
int main(){

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
}**/

Compilation message (stderr)

crocodile.cpp: In function 'int travel_plan(int, int, std::vector<std::vector<int> >, std::vector<int>, int, std::vector<int>)':
crocodile.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for(int i =0; i < R.size(); i++){
      |                ~~^~~~~~~~~~
/tmp/ccpG8tZm.o: In function `main':
grader.cpp:(.text.startup+0x32): undefined reference to `travel_plan(int, int, int (*) [2], int*, int, int*)'
collect2: error: ld returned 1 exit status