oj.uz

Submission #437705

# Submission time Handle Problem Language Result Execution time Memory
437705 2021-06-26T22:23:29 Z ala2 Road Closures (APIO21_roads) C++14
5 / 100
 67 ms 6400 KB 
            #include "roads.h"

            #include <vector>
            #include<algorithm>
            using namespace std ;
            vector<long long>v;
            vector<long long> minimum_closure_costs(int N, vector<int> U,vector<int> V,vector<int> W) {

                sort(W.begin(),W.end());  v.push_back(0);
                v.push_back(W[0]);
                     for(int i=2;i<=N;i++)
                    v.push_back(v[i-1]+W[i-1]);
             v.pop_back();
             reverse(v.begin(),v.end());
              return v;
            }

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 28 ms 3276 KB Output is correct
13 Correct 47 ms 5276 KB Output is correct
14 Correct 54 ms 5632 KB Output is correct
15 Correct 58 ms 6188 KB Output is correct
16 Correct 59 ms 6276 KB Output is correct
17 Correct 67 ms 6400 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 41 ms 4760 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 51 ms 5632 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 204 KB Output is correct
2 Incorrect 1 ms 204 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 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

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

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 4100 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 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 28 ms 3276 KB Output is correct
13 Correct 47 ms 5276 KB Output is correct
14 Correct 54 ms 5632 KB Output is correct
15 Correct 58 ms 6188 KB Output is correct
16 Correct 59 ms 6276 KB Output is correct
17 Correct 67 ms 6400 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 41 ms 4760 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Incorrect 51 ms 5632 KB Output isn't correct
22 Halted 0 ms 0 KB -