oj.uz

Submission #488943

# Submission time Handle Problem Language Result Execution time Memory
488943 2021-11-20T20:12:33 Z cfalas Road Closures (APIO21_roads) C++14
24 / 100
 451 ms 21824 KB 
#include "roads.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

int t, n;
vi a, b;

vector<vii> adj;

int k;
ll mem[10000][2];
ll dfs(int s, int p=-1, int cp=0){
	if(mem[s][cp]!=-1) return mem[s][cp];
	vi al;
	ll fix = 0;
	int ss = k;
	if(cp) ss--;
	FOA(v,adj[s]){
		if(v.F!=p){
			fix += dfs(v.F, s, 0) + v.S;
			al.push_back(dfs(v.F, s, 1) - v.S - dfs(v.F, s, 0));
		}
	}
	//cout<<k<<" "<<s<<" "<<fix<<" "<<cp<<endl;
	sort(al.begin(), al.end());
	FOR(i, min((int)al.size(), ss)) if(al[i]<0) fix += al[i];
	mem[s][cp] = fix;
	return fix;
}

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {
	n = N;
	adj.assign(n+1, vii());
	FOR(i,N-1){
		adj[U[i]].push_back({V[i], W[i]});
		adj[V[i]].push_back({U[i], W[i]});
	}
	a.resize(n);
	FOR(i,n){
		FOR(j,n) mem[j][0] = mem[j][1] = -1;
		k = i;
		a[i] = dfs(0);
	}
	return a;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 190 ms 460 KB Output is correct
3 Correct 216 ms 540 KB Output is correct
4 Correct 111 ms 556 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 112 ms 580 KB Output is correct
9 Correct 170 ms 552 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Runtime error 23 ms 13052 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Runtime error 36 ms 17792 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 308 KB Output is correct
5 Correct 4 ms 296 KB Output is correct
6 Correct 3 ms 296 KB Output is correct
7 Correct 4 ms 316 KB Output is correct
8 Correct 4 ms 300 KB Output is correct
9 Correct 4 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 4 ms 204 KB Output is correct
18 Correct 4 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 308 KB Output is correct
5 Correct 4 ms 296 KB Output is correct
6 Correct 3 ms 296 KB Output is correct
7 Correct 4 ms 316 KB Output is correct
8 Correct 4 ms 300 KB Output is correct
9 Correct 4 ms 204 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 4 ms 204 KB Output is correct
18 Correct 4 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 174 ms 440 KB Output is correct
24 Correct 448 ms 596 KB Output is correct
25 Correct 323 ms 520 KB Output is correct
26 Correct 328 ms 460 KB Output is correct
27 Correct 331 ms 588 KB Output is correct
28 Correct 195 ms 588 KB Output is correct
29 Correct 365 ms 528 KB Output is correct
30 Correct 292 ms 576 KB Output is correct
31 Correct 282 ms 560 KB Output is correct
32 Correct 191 ms 576 KB Output is correct
33 Correct 235 ms 780 KB Output is correct
34 Correct 319 ms 864 KB Output is correct
35 Correct 249 ms 792 KB Output is correct
36 Correct 187 ms 580 KB Output is correct
37 Correct 214 ms 588 KB Output is correct
38 Correct 113 ms 588 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 3 ms 204 KB Output is correct
42 Correct 5 ms 332 KB Output is correct
43 Correct 3 ms 204 KB Output is correct
44 Correct 4 ms 204 KB Output is correct
45 Correct 4 ms 204 KB Output is correct
46 Correct 4 ms 204 KB Output is correct
47 Correct 3 ms 332 KB Output is correct
48 Correct 3 ms 332 KB Output is correct
49 Correct 3 ms 332 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 2 ms 204 KB Output is correct
52 Correct 2 ms 204 KB Output is correct
53 Correct 263 ms 512 KB Output is correct
54 Correct 451 ms 560 KB Output is correct
55 Correct 276 ms 588 KB Output is correct
56 Correct 96 ms 532 KB Output is correct
57 Correct 148 ms 556 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 5 ms 204 KB Output is correct
60 Correct 4 ms 204 KB Output is correct
61 Correct 2 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 0 ms 204 KB Output is correct
64 Correct 406 ms 564 KB Output is correct
65 Correct 427 ms 572 KB Output is correct
66 Correct 221 ms 552 KB Output is correct
67 Correct 188 ms 460 KB Output is correct
68 Correct 222 ms 552 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 21824 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 21824 KB Execution killed with signal 11
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 190 ms 460 KB Output is correct
3 Correct 216 ms 540 KB Output is correct
4 Correct 111 ms 556 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 112 ms 580 KB Output is correct
9 Correct 170 ms 552 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 2 ms 204 KB Output is correct
12 Runtime error 23 ms 13052 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -