oj.uz

답안 #563777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
563777 2022-05-18T06:16:06 Z pvpwarrior 도로 폐쇄 (APIO21_roads) C++14
5 / 100
 154 ms 22708 KB 
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define vi std::vector<ll>
#define si set<ll>
#define INF 100000000
#define pb push_back
#define mod 1000000007

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
    ll n = N;
    set<pair < ll, ll > > adj[n];
    // for (int i = 0; i < n-1; ++i){
    //     cin >> u[i] >> v[i] >> w[i];
    // }
    // for (int i = 0; i < n; ++i){
    //     cin >> v[i];
    // }
    // for (int i = 0; i < n; ++i){
    //     cin >> w[i];
    // }
    ll sum = 0;
    for (int i = 0; i < n-1; ++i){
        adj[V[i]].insert(make_pair(W[i] , U[i]));
        adj[U[i]].insert(make_pair(W[i] , V[i]));
        sum += W[i];
    }
    vi ans(n,sum);
    sort(W.begin(), W.end());
    reverse(W.begin(), W.end());

    for (int i = 1; i < n; ++i){
        ans[i] = ans[i-1] - W[i-1];
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 71 ms 12492 KB Output is correct
13 Correct 137 ms 21560 KB Output is correct
14 Correct 123 ms 20116 KB Output is correct
15 Correct 154 ms 22284 KB Output is correct
16 Correct 144 ms 22648 KB Output is correct
17 Correct 138 ms 22708 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 122 ms 19772 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

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

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 284 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 71 ms 12492 KB Output is correct
13 Correct 137 ms 21560 KB Output is correct
14 Correct 123 ms 20116 KB Output is correct
15 Correct 154 ms 22284 KB Output is correct
16 Correct 144 ms 22648 KB Output is correct
17 Correct 138 ms 22708 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 122 ms 19772 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Incorrect 57 ms 17332 KB Output isn't correct
22 Halted 0 ms 0 KB -