oj.uz

답안 #1091264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091264 2024-09-20T10:04:53 Z pokmui9909 Designated Cities (JOI19_designated_cities) C++17
7 / 100
 129 ms 40272 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define x first
#define y second

struct Edge{
    ll v, a, b;
};
vector<Edge> T[200005], C[200005];
ll N, Q, Ans[200005], Val[200005];

void cal1(ll u, ll p){
    for(auto e : T[u]){
        if(e.v == p) continue;
        Val[1] += e.a;
        cal1(e.v, u);
    }
}
void cal2(ll u, ll p){
    for(auto e : T[u]){
        if(e.v == p) continue;
        Val[e.v] = Val[u] - e.a + e.b;
        cal2(e.v, u);
    }
}

int main(){
    cin.tie(0) -> sync_with_stdio(0);

    cin >> N;
    for(ll i = 1; i < N; i++){
        ll u, v, a, b; cin >> u >> v >> a >> b;
        T[u].push_back({v, a, b}); T[v].push_back({u, b, a});
    }
    cal1(1, -1); cal2(1, -1);
    Ans[1] = *min_element(Val + 1, Val + N + 1);
    cin >> Q;
    while(Q--){
        ll t; cin >> t;
        cout << Ans[t] << '\n';
    }
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Incorrect 2 ms 12632 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 101 ms 32344 KB Output is correct
3 Correct 129 ms 39924 KB Output is correct
4 Correct 92 ms 31060 KB Output is correct
5 Correct 91 ms 32000 KB Output is correct
6 Correct 102 ms 33616 KB Output is correct
7 Correct 88 ms 31228 KB Output is correct
8 Correct 118 ms 40272 KB Output is correct
9 Correct 72 ms 30448 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Incorrect 115 ms 32196 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Incorrect 2 ms 12632 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 101 ms 32344 KB Output is correct
3 Correct 129 ms 39924 KB Output is correct
4 Correct 92 ms 31060 KB Output is correct
5 Correct 91 ms 32000 KB Output is correct
6 Correct 102 ms 33616 KB Output is correct
7 Correct 88 ms 31228 KB Output is correct
8 Correct 118 ms 40272 KB Output is correct
9 Correct 72 ms 30448 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Incorrect 115 ms 32196 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Incorrect 2 ms 12632 KB Output isn't correct
3 Halted 0 ms 0 KB -