Submission #626967

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
626967	2022-08-12T03:27:42 Z	Glory	Road Closures (APIO21_roads)	C++17	5 / 100	50 ms	5576 KB

roads

#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,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

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	312 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	21 ms	2668 KB	Output is correct
13	Correct	36 ms	4408 KB	Output is correct
14	Correct	40 ms	4792 KB	Output is correct
15	Correct	48 ms	5272 KB	Output is correct
16	Correct	50 ms	5496 KB	Output is correct
17	Correct	43 ms	5576 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	32 ms	3920 KB	Output is correct

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Incorrect	40 ms	4888 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	3240 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	3240 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	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	312 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	21 ms	2668 KB	Output is correct
13	Correct	36 ms	4408 KB	Output is correct
14	Correct	40 ms	4792 KB	Output is correct
15	Correct	48 ms	5272 KB	Output is correct
16	Correct	50 ms	5496 KB	Output is correct
17	Correct	43 ms	5576 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	32 ms	3920 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Incorrect	40 ms	4888 KB	Output isn't correct
22	Halted	0 ms	0 KB	-