| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1131561 | vibeduck | Roadside Advertisements (NOI17_roadsideadverts) | C++20 | 1094 ms | 6304 KiB | 
#include <bits/stdc++.h> 
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
const int mxn = 5e4 + 5;
vector<pii> adj[mxn];
int ans = 0; int a, b, c, d, e;
void dfs(int node, int prev, int cur) {
    if (node == a || node == b || node == c || node == d || node == e) {
        ans += cur;
        cur = 0;
    }
    for (auto neighbour : adj[node]) {
        if (neighbour.fi == prev) continue;
        dfs(neighbour.fi, node, cur + neighbour.se);
    }
}
inline void solve() {
    int n; cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].pb({v, w});
        adj[v].pb({u, w});
    }
    int q; cin >> q;
    for (int i = 0; i < q; i++) {
        cin >> a >> b >> c >> d >> e;
        ans = 0;
        dfs(a, -1, 0);
        cout << ans << '\n';
    }
}
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    //setIO();
    int t = 1;
    if (tc) {
        cin >> t;
    }
    while (t--) {
        solve();
    }
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
