oj.uz

Submission #563038

# Submission time Handle Problem Language Result Execution time Memory
563038 2022-05-16T06:09:30 Z Devigo Road Closures (APIO21_roads) C++14
0 / 100
 2000 ms 7544 KB 
#include <bits/stdc++.h>
using namespace std;

const int siz = 1e5+1;
bool done = 0;

long long cost = 0;

vector<bool> rem(siz,0);

struct edge {
	long long w, x, y;
};

bool cmp (edge a, edge b) {
	return a.w < b.w;
}

void get(int k, vector<int> &degree, vector<edge> &el, int n, int m) {
	for(int i=0; i<m; i++) {
		if(rem[i]) continue;
		bool isb = 0;
		int u = degree[el[i].x]; int v = degree[el[i].y];
		if(u > k || v > k) isb = 1;
		if(isb) {
			degree[el[i].x]--; degree[el[i].y]--;
			rem[i] = 1;
			cost += el[i].w;
		}
		int grt = -1;
		for(int j=0; j<n; j++) {
			grt = max(grt,degree[j]);
		}
		if(grt <= k) {
			done = 1; return;
		}
	}
	return;
}

vector<long long> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w) {
	vector<int> degree(n,0);
	vector<edge> el;
	int m = n-1;
	for(int i=0; i<m; i++) {
		degree[u[i]]++;
		degree[v[i]]++;
		el.push_back({w[i],u[i],v[i]});
	}
	sort(el.begin(), el.end(), cmp);
	vector<long long> c(n); 
	for(int i=m; i>=0; i--) {
		while(!done) {
			get(i,degree,el,n,m);
		}
		c[i] = cost;
		done = 0;
	}
	return c;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 7 ms 448 KB Output is correct
3 Correct 8 ms 452 KB Output is correct
4 Correct 7 ms 496 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 7 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Execution timed out 2078 ms 4368 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 2081 ms 7544 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 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 Execution timed out 2061 ms 7440 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2061 ms 7440 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 7 ms 448 KB Output is correct
3 Correct 8 ms 452 KB Output is correct
4 Correct 7 ms 496 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 5 ms 460 KB Output is correct
9 Correct 7 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Execution timed out 2078 ms 4368 KB Time limit exceeded
13 Halted 0 ms 0 KB -