Submission #103237

#TimeUsernameProblemLanguageResultExecution timeMemory
103237dimash241Dreaming (IOI13_dreaming)C++17
Compilation error
0 ms0 KiB
#include "dreaming.h" #include <bits/stdc++.h> #define _USE_MATH_DEFINES_ #define ll long long #define ld long double #define Accepted 0 #define pb push_back #define mp make_pair #define sz(x) (int)(x.size()) #define every(x) x.begin(),x.end() #define F first #define S second #define For(i,x,y) for (ll i = x; i <= y; i ++) #define FOr(i,x,y) for (ll i = x; i >= y; i --) #define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) // ROAD to... Red using namespace std; const double eps = 0.000001; const ld pi = acos(-1); const int maxn = 1e7 + 9; const int mod = 1e9 + 7; const ll MOD = 1e18 + 9; const ll INF = 1e18 + 123; const int inf = 2e9 + 11; const int mxn = 1e6 + 9; const int N = 6e5 + 123; const int M = 22; const int pri = 997; const int Magic = 2101; const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, -1, 0, 1}; int n, m, k; int u[N]; int col; int dp[N]; int ans; vector < int > comp[5], vals[N]; vector < pair < int, int > > g[N]; void dfs (int v) { u[v] = col; comp[col].pb(v); vals[v].pb(0); vals[v].pb(0); for (auto to : g[v]) { if (!u[to.F]) { dfs(to.F); vals[v].pb(dp[to.F] + to.S); sort(every(vals[v])); reverse(every(vals[v])); vals[v].pop_back(); dp[v] = max(dp[v], dp[to.F] + to.S); } } ans = max(ans, vals[v][0] + vals[v][1]); } void calc (int v, int par = 0, int upp = 0) { ans = max(ans, dp[v] + upp); dp[v] = max(dp[v], upp); for (auto to : g[v]) { if (to.F == par) continue; int nxt = upp; if (dp[to.F] + to.S == vals[v][0]) nxt = max(nxt, vals[v][1]); else nxt = max(nxt, vals[v][0]); calc (to.F, v, nxt + to.S); } } int travelTime(int N, int M, int L, int A[], int B[], int T[]) { n = N, m = M, k = L; for (int i = 1; i <= m; i ++) { int l, r, x; l = A[i - 1], r = B[i - 1], x = T[i - 1]; g[l].pb(mp(r, x)); g[r].pb(mp(l, x)); } int ans = 0; vector < int > vv; for (int i = 0; i < n; i ++) { if (!u[i]) { col ++; p[i] = -1; comp.clear(); h[i] = 0; dfs (i); int mx = i; for (auto e : comp) if (h[e] > h[mx]) mx = e; p[mx] = -1; comp.clear(); h[mx] = 0; dfs(mx); for (auto e : comp) if (h[e] > h[mx]) mx = e; ans = max(ans, h[mx]); //cout << mx << ' ' << h[mx] << '\n'; int half = h[mx]; for (int v = mx; ~v; v = p[v]) { half = min(half, max(h[v], abs(h[v] - h[mx]))); } vv.pb(half); } } sort(every(vv)); reverse(every(vv)); if (vv.size() >= 2) ans = max(ans, vv[0] + vv[1] + k); return ans; }

Compilation message (stderr)

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:88:4: error: 'p' was not declared in this scope
    p[i] = -1;
    ^
dreaming.cpp:89:9: error: request for member 'clear' in 'comp', which is of non-class type 'std::vector<int> [5]'
    comp.clear();
         ^~~~~
dreaming.cpp:90:4: error: 'h' was not declared in this scope
    h[i] = 0;
    ^
dreaming.cpp:94:28: error: cannot convert 'std::vector<int>' to 'int' in assignment
     if (h[e] > h[mx]) mx = e;
                            ^
dreaming.cpp:96:9: error: request for member 'clear' in 'comp', which is of non-class type 'std::vector<int> [5]'
    comp.clear();
         ^~~~~
dreaming.cpp:100:28: error: cannot convert 'std::vector<int>' to 'int' in assignment
     if (h[e] > h[mx]) mx = e;
                            ^