Submission #566622

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
566622	2022-05-22T13:14:12 Z	josanneo22	Road Closures (APIO21_roads)	C++17	5 / 100	51 ms	5632 KB

roads

#include "roads.h"

#include <vector>
#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int> > vpii;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b); i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
#define mp make_pair
#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define f first
#define s second
#define out(x) cout<<x<<'\n';
#define in(x) cin>>x;
#define inarr(a,x,y) for(int i=x;i<y;i++){cin>>a[i];}
#define incor(a,x,y) for(int i=x;i<y;i++){cin>>a[i].f>>a[i].s;}

vll minimum_closure_costs(int n, vi u,vi v,vi w) 
{
	ll ans = 0;
	vll val;
	sort(all(w));
	val.pb(0);
	FOR(i,0,n-1)
	{
		ans += w[i];
		val.pb(ans);
	}
	reverse(all(val));
	return val;
}

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	2 ms	332 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	2 ms	340 KB	Output is correct
9	Correct	2 ms	308 KB	Output is correct
10	Correct	1 ms	288 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	29 ms	2864 KB	Output is correct
13	Correct	39 ms	4752 KB	Output is correct
14	Correct	51 ms	5024 KB	Output is correct
15	Correct	48 ms	5416 KB	Output is correct
16	Correct	50 ms	5552 KB	Output is correct
17	Correct	46 ms	5632 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	35 ms	4444 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	44 ms	5188 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	1 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	1 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	39 ms	3748 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	39 ms	3748 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	2 ms	332 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	2 ms	340 KB	Output is correct
9	Correct	2 ms	308 KB	Output is correct
10	Correct	1 ms	288 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	29 ms	2864 KB	Output is correct
13	Correct	39 ms	4752 KB	Output is correct
14	Correct	51 ms	5024 KB	Output is correct
15	Correct	48 ms	5416 KB	Output is correct
16	Correct	50 ms	5552 KB	Output is correct
17	Correct	46 ms	5632 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	35 ms	4444 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Incorrect	44 ms	5188 KB	Output isn't correct
22	Halted	0 ms	0 KB	-