Submission #488770

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
488770	2021-11-20T12:04:18 Z	Theo830	Road Closures (APIO21_roads)	C++17	5 / 100	48 ms	5668 KB

roads

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///APIO 2021 vc
#include "roads.h"
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,std::vector<int> V,std::vector<int> W){
    vll ans;
    sort(all(W));
    ll sum = 0;
    for(auto x:W){
        sum += x;
    }
    f(i,0,N){
        ans.pb(sum);
        if(!W.empty()){
            sum -= W.back();
            W.pop_back();
        }
    }
    return ans;
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	2 ms	336 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	0 ms	292 KB	Output is correct
12	Correct	22 ms	2892 KB	Output is correct
13	Correct	36 ms	4780 KB	Output is correct
14	Correct	42 ms	5080 KB	Output is correct
15	Correct	45 ms	5408 KB	Output is correct
16	Correct	48 ms	5560 KB	Output is correct
17	Correct	42 ms	5668 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	32 ms	4416 KB	Output is correct

Subtask #2

0 / 7.0

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

Subtask #5

0 / 17.0

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

Subtask #6

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	36 ms	5012 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	344 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	2 ms	336 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	0 ms	292 KB	Output is correct
12	Correct	22 ms	2892 KB	Output is correct
13	Correct	36 ms	4780 KB	Output is correct
14	Correct	42 ms	5080 KB	Output is correct
15	Correct	45 ms	5408 KB	Output is correct
16	Correct	48 ms	5560 KB	Output is correct
17	Correct	42 ms	5668 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	32 ms	4416 KB	Output is correct
20	Correct	0 ms	208 KB	Output is correct
21	Incorrect	38 ms	5108 KB	Output isn't correct
22	Halted	0 ms	0 KB	-