oj.uz

Submission #569918

# Submission time Handle Problem Language Result Execution time Memory
569918 2022-05-28T08:31:31 Z Edil Road Closures (APIO21_roads) C++17
0 / 100
 36 ms 3740 KB 
#include <bits/stdc++.h>
using namespace std;
vector <long long> minimum_closure_costs(int n, vector <int> u, vector <int> v, vector <int> w)
{
    vector <long long> ans;
    int sm = 0;
    for(int i = 0; i < n-1; i++)
    {
        sm += w[i];
        ans.push_back(sm);
    }
    reverse(ans.begin(), ans.end());
    ans.push_back(0);
    return ans;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 340 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 212 KB Output is correct
2 Incorrect 36 ms 3328 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 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

# Verdict Execution time Memory 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

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

Subtask #6
0 / 25.0

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

Subtask #7
0 / 22.0

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