제출 #1236074

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236074		htoshiro	경주 (Race) (IOI11_race)	C++20	컴파일 에러	0 ms	0 KiB

race

#include <bits/stdc++.h>
#define int long long
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
struct pi {
    int x, y;
};
vector<vector<pi>> adj;
vector<int> sz;
vector<bool> blocked;
vector<int> nxt;
int n, k;
int ans;
int dfs(int cur, int par) {
    sz[cur] = 1;
    for (auto &a : adj[cur]) {
        if (a.x != par && !blocked[a.x]) {
            sz[cur] += dfs(a.x, cur);
        }
    }
    return sz[cur];
}
int cent(int cur, int par, int am) {
    for (auto &a : adj[cur]) {
        if (a.x != par && !blocked[a.x] && sz[a.x] > am / 2) {
            return cent(a.x, cur, am);
        }
    }
    return cur;
}
void dfs2(int cur, int par, int dist, int depth, vector<pair<int, int>> &paths) {
    if (dist > k) return;
    paths.emplace_back(dist, depth);
    for (auto &a : adj[cur]) {
        if (a.x != par && !blocked[a.x]) {
            dfs2(a.x, cur, dist + a.y, depth + 1, paths);
        }
    }
}
int build(int cur, int par) {
    int total = dfs(cur, -1);
    int curc = cent(cur, -1, total);
    blocked[curc] = true;
    nxt[curc] = par;
    unordered_map<int, int> dist_count;
    dist_count[0] = 0; 
    int best = LLONG_MAX;
    for (auto &a : adj[curc]) {
        if (!blocked[a.x]) {
            vector<pair<int, int>> paths;
            dfs2(a.x, curc, a.y, 1, paths);
            for (auto &[d, l] : paths) {
                if (dist_count.count(k - d)) {
                    best = min(best, l + dist_count[k - d]);
                }
            }
            for (auto &[d, l] : paths) {
                if (!dist_count.count(d)) dist_count[d] = l;
                else dist_count[d] = min(dist_count[d], l);
            }
        }
    }
    for (auto &a : adj[curc]) {
        if (!blocked[a.x]) {
            best = min(best, build(a.x, curc));
        }
    }
    return best;
}
int best_path(int N, int K, int H[][2], int L[]){
    n = N;
    k = K;
    adj.resize(n);
    sz.resize(n);
    nxt.resize(n);
    blocked.assign(N, false);
    for (int i = 0; i < N-1; i++) {
        adj[H[i][0]].push_back({H[i][1], L[i]});
        adj[H[i][1]].push_back({H[i][0], L[i]});
    }
    ans = build(0, -1);
    return (ans == LLONG_MAX ? -1 : ans);
}
void read_input(){
  scanf("%d %d", &N, &K);
  int i;
  for (i = 0; i < N - 1; i++)scanf("%d %d %d", &H[i][0], &H[i][1], &L[i]);
}
int main(){
  int ans;
  read_input();
  ans = best_path(N, K, H, L);
  printf("%d\n", ans);
  return 0;
}

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

race.cpp: In function 'void read_input()':
race.cpp:85:19: error: 'N' was not declared in this scope
   85 |   scanf("%d %d", &N, &K);
      |                   ^
race.cpp:85:23: error: 'K' was not declared in this scope
   85 |   scanf("%d %d", &N, &K);
      |                       ^
race.cpp:87:49: error: 'H' was not declared in this scope
   87 |   for (i = 0; i < N - 1; i++)scanf("%d %d %d", &H[i][0], &H[i][1], &L[i]);
      |                                                 ^
race.cpp:87:69: error: 'L' was not declared in this scope
   87 |   for (i = 0; i < N - 1; i++)scanf("%d %d %d", &H[i][0], &H[i][1], &L[i]);
      |                                                                     ^
At global scope:
cc1plus: error: '::main' must return 'int'
race.cpp: In function 'int main()':
race.cpp:92:19: error: 'N' was not declared in this scope
   92 |   ans = best_path(N, K, H, L);
      |                   ^
race.cpp:92:22: error: 'K' was not declared in this scope
   92 |   ans = best_path(N, K, H, L);
      |                      ^
race.cpp:92:25: error: 'H' was not declared in this scope
   92 |   ans = best_path(N, K, H, L);
      |                         ^
race.cpp:92:28: error: 'L' was not declared in this scope
   92 |   ans = best_path(N, K, H, L);
      |                            ^
race.cpp:93:12: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   93 |   printf("%d\n", ans);
      |           ~^     ~~~
      |            |     |
      |            int   long long int
      |           %lld