제출 #418697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
418697		snasibov05	경주 (Race) (IOI11_race)	C++14	43 / 100	3085 ms	29980 KiB

race

#include "race.h"
#include <vector>
#include <unordered_map>
#include <cassert>

using namespace std;

#define oo 1000000000
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second

int ans = oo;
vector<vector<pii>> ed;
vector<bool> used;
vector<int> size;
vector<pii> v;

int a = 0;

void calcSize(int cur, int pr){
    size[cur] = 1;
    for (auto [x, w] : ed[cur]){
        if (used[x] || x == pr) continue;
        calcSize(x, cur);
        size[cur] += size[x];
    }
}

int findCentroid(int cur, int pr, int n){
    for (auto [x, w] : ed[cur]){
        if (used[x] || x == pr) continue;
        if (size[x] > n / 2){
            return findCentroid(x, cur, n);
        }
    }
    return cur;
}

void dfs(int cur, int pr, int k, int d, int l){
    if (d > k) return;
    v.pb({d, l});
    for (auto [x, w] : ed[cur]){
        if (x == pr || used[x]) continue;
        dfs(x, cur, k, d + w, l + 1);
    }
}

void calc(int cur, int k){
    calcSize(cur, -1);
    cur = findCentroid(cur, -1, size[cur]);

    unordered_map<int, int> dp;
    used[cur] = true;

    for (auto [x, w] : ed[cur]){
        v.clear();
        dfs(x, cur, k, w, 1);

        for (auto [d, l] : v){
            if (d == k) ans = min(ans, l);
            if (dp.count(k-d) == 0) continue;
            ans = min(ans, l + dp[k - d]);
        }
        for (auto [d, l] : v){
            if (dp[d] == 0) dp[d] = l;
            else dp[d] = min(dp[d], l);
        }
    }

    for (auto [x, w] : ed[cur]){
        if (used[x]) continue;
        calc(x, k);
    }

    a++;
    assert(a < 1e7);
}

int best_path(int n, int k, int h[][2], int l[]){
    ed.resize(n);
    used.resize(n);
    size.resize(n);

    for (int i = 0; i < n - 1; ++i) {
        ed[h[i][0]].pb({h[i][1], l[i]});
        ed[h[i][1]].pb({h[i][0], l[i]});
    }

    calc(0, k);

    if (ans == oo) ans = -1;

    return ans;

}

컴파일 시 표준 에러 (stderr) 메시지

race.cpp: In function 'void calcSize(int, int)':
race.cpp:24:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |     for (auto [x, w] : ed[cur]){
      |               ^
race.cpp: In function 'int findCentroid(int, int, int)':
race.cpp:32:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |     for (auto [x, w] : ed[cur]){
      |               ^
race.cpp: In function 'void dfs(int, int, int, int, int)':
race.cpp:44:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |     for (auto [x, w] : ed[cur]){
      |               ^
race.cpp: In function 'void calc(int, int)':
race.cpp:57:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |     for (auto [x, w] : ed[cur]){
      |               ^
race.cpp:61:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   61 |         for (auto [d, l] : v){
      |                   ^
race.cpp:66:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   66 |         for (auto [d, l] : v){
      |                   ^
race.cpp:72:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   72 |     for (auto [x, w] : ed[cur]){
      |               ^

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 22 / 22
• Subtask 4: 0 / 57