oj.uz

Submission #969600

# Submission time Handle Problem Language Result Execution time Memory
969600 2024-04-25T10:48:43 Z europium Road Closures (APIO21_roads) C++17
0 / 100
 28 ms 3416 KB 
#include "roads.h"

#include <vector>
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<ll> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W) {
    vector<ll> ans(n);

    ll cost = accumulate(W.begin(), W.end(), ll(0));
    ans[0] = cost;

    // sort(W.rbegin(), W.rend());
    //
    // for (int i = 0; i < n - 1; i++) {
    //     cost -= W[i];
    //     ans[i+1] = cost;
    // }

    return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 2 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 26 ms 2908 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 3416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 3416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 2 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -