oj.uz

Submission #626966

# Submission time Handle Problem Language Result Execution time Memory
626966 2022-08-12T03:26:59 Z Glory Road Closures (APIO21_roads) C++17
0 / 100
 35 ms 3248 KB 
#include<bits/stdc++.h>

#define vi vector<int>
#define vll vector<long long>
using namespace std;

vll minimum_closure_costs(int N,vi U,vi V,vi W){
     vll ans(N+100,0);
     
     long long res = 0;
     for(auto it: W) res+= it;
 
     sort(W.begin(),W.end(),greater<int>());
 
     ans[0]=res;
 
     for(int i=1; i< N; i++){
        res-=W[i-1];
        ans[i]=res;
     }
 
     return ans;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 7.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 3248 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 3248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

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