제출 #410765

#제출 시각아이디문제언어결과실행 시간메모리
410765LouayFarah경주 (Race) (IOI11_race)C++14
컴파일 에러
0 ms0 KiB
#include "bits/stdc++.h" #include "race.h" using namespace std; void depth(vector<pair<int, int>> adj[], int u, int e, vector<int> &cnt) { for(auto v: adj[u]) { if(v.first!=e) { cnt[v.first] = cnt[u]+v.second; depth(adj, v.first, u, cnt); } } } void all_pairs_distance(vector<pair<int, int>> adj[], int N, vector<vector<int>> &cnt) { for(int i = 0; i<N; i++) { vector<int> temp(N); depth(adj, i, -1, temp); cnt.push_back(temp); } } void depth2(vector<pair<int, int>> adj[], int u, int e, vector<int> &cnt) { for(auto v: adj[u]) { if(v.first!=e) { cnt[v.first] = cnt[u]+1; depth2(adj, v.first, u, cnt); } } } void all_pairs_distance2(vector<pair<int, int>> adj[], int N, vector<vector<int>> &cnt) { FOR(i, 0, N) { vector<int> temp(N); depth2(adj, i, -1, temp); cnt.push_back(temp); } } int best_path(int N, int K, int H[][2], int L[]) { vector<pair<int, int>> adj[N]; for(int i = 0; i<N-1; i++) { adj[H[i][0]].push_back(make_pair(H[i][1], L[i])); adj[H[i][1]].push_back(make_pair(H[i][0], L[i])); } vector<vector<int>> cnt; all_pairs_distance(adj, N, cnt); vector<vector<int>> cnt2; all_pairs_distance2(adj, N, cnt2); bool flag = false; int res = 1e8; for(int i = 0; i<N; i++) { for(int j = 0; j<N; j++) { if(cnt[i][j]==K) res = min(res, cnt2[i][j]), flag = true; } } if(!flag) return -1; return res; }

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

race.cpp: In function 'void all_pairs_distance2(std::vector<std::pair<int, int> >*, int, std::vector<std::vector<int> >&)':
race.cpp:42:9: error: 'i' was not declared in this scope
   42 |     FOR(i, 0, N)
      |         ^
race.cpp:42:5: error: 'FOR' was not declared in this scope
   42 |     FOR(i, 0, N)
      |     ^~~