Submission #335985

#TimeUsernameProblemLanguageResultExecution timeMemory
335985saarang123Dreaming (IOI13_dreaming)C++14
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> //#include "dreaming.h" using namespace std; const int N = 1e5 + 2; vector<array<int, 2>> g[N]; bool vis[N]; array<int, 2> par[N]; vector<array<int, 2>> cost; array<int, 2> dfs(int v, int p, int d) { vis[v] = true; par[v] = {p, d}; array<int, 2> ret = {d, v}; for(auto tx : g[v]) { int u = tx[0], w = tx[1]; if(u == p) continue; ret = max(ret, dfs(u, v, d + w)); } return ret; } int travelTime(int N,int M,int L, int A[],int B[],int T[]) { for(int i = 0; i < M; i++) { g[A[i]].push_back({B[i], T[i]}); g[B[i]].push_back({A[i], T[i]}); } for(int i = 0; i < N; i++) { if(vis[i]) continue; array<int, 2> y = dfs(i, -1, 0); array<int, 2> d = dfs(y[1], -1, 0); array<int, 2> v = {d[1], d[0]}; //node, diameter array<int, 4> ans = {d[0], d[0], 0, d[1]}; //max of 2 sides, first side, other side, node while(v[0] != -1) { array<int, 2> x = {v[0], par[v[0]][1]}; ans = min(ans, {max(d[0] - x[1], x[1]) , d[0] - x[1], x[1], x[0]}); //min max of 2sides v = par[v[0]]; } //cout << ans[1] << ' ' << ans[2] << ' ' << ans[3] << '\n'; cost.push_back({ans[0], ans[3]}); } sort(cost.begin(), cost.end()); reverse(cost.begin(), cost.end()); for(int i = 1; i < cost.size(); i++) { g[cost[0][1]].push_back({cost[i][1], L}); g[cost[i][1]].push_back({cost[0][1], L}); } array<int, 2> x = dfs(1, -1, 0); int answer = dfs(x[1], -1, 0)[0]; return answer; }

Compilation message (stderr)

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:44:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i = 1; i < cost.size(); i++) {
      |                    ~~^~~~~~~~~~~~~
/tmp/ccOjLGyj.o: In function `main':
grader.c:(.text.startup+0xc9): undefined reference to `travelTime'
collect2: error: ld returned 1 exit status