Submission #414896

#	Time	Username	Problem	Language	Result	Execution time	Memory
414896		snasibov05	꿈 (IOI13_dreaming)	C++14	40 / 100	1060 ms	9664 KiB

dreaming

#include "dreaming.h"
#include <vector>
#include <algorithm>

using namespace std;

#define pb push_back
#define pii pair<int, int>
#define oo 1000000000

vector<vector<pii>> ed;
vector<bool> visited;
vector<int> best;
vector<int> mx;
vector<int> cur;

void dfs(int v){
    cur.pb(v);
    visited[v] = true;
    for (auto [x, t] : ed[v]){
        if (!visited[x]) dfs(x);
    }
}

int mxdist(int v, int pr){
    int res = 0;
    for (auto [x, t] : ed[v]){
        if (x != pr){
            res = max(res, mxdist(x, v) + t);
        }
    }

    return res;
}

void findmn(int v){

    cur.clear();
    dfs(v);
    int Min = oo, Max = 0;
    for (auto x : cur){
        int k = mxdist(x, -1);
        Min = min(Min, k);
        Max = max(Max, k);
    }
    best.pb(Min);
    mx.pb(Max);

}

int travelTime(int n, int m, int l, int a[], int b[], int t[]) {

    ed.resize(n);
    visited.resize(n);

    for (int i = 0; i < m; ++i) {
        ed[a[i]].pb({b[i], t[i]});
        ed[b[i]].pb({a[i], t[i]});
    }

    for (int i = 0; i < n; ++i) {
        if (!visited[i]) findmn(i);
    }

    sort(best.rbegin(), best.rend());
    sort(mx.rbegin(), mx.rend());

    if (mx.size() == 1) return mx[0];
    if (mx.size() == 2) return max(best[0] + best[1] + l, mx[0]);

    return max(max(best[0]+best[1]+l, best[1]+best[2]+2*l), mx[0]);

}

Compilation message (stderr)

dreaming.cpp: In function 'void dfs(int)':
dreaming.cpp:20:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   20 |     for (auto [x, t] : ed[v]){
      |               ^
dreaming.cpp: In function 'int mxdist(int, int)':
dreaming.cpp:27:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   27 |     for (auto [x, t] : ed[v]){
      |               ^

• Subtask 1: 0 / 14
• Subtask 2: 10 / 10
• Subtask 3: 0 / 23
• Subtask 4: 18 / 18
• Subtask 5: 12 / 12
• Subtask 6: 0 / 23