oj.uz

Submission #965978

# Submission time Handle Problem Language Result Execution time Memory
965978 2024-04-19T08:56:48 Z 42kangaroo Closing Time (IOI23_closing) C++17
8 / 100
 122 ms 47932 KB 
#include "closing.h"
#include "bits/stdc++.h"

#include <vector>

#define ll long long
using namespace std;

struct Ed {
	ll to, w;
};

bool operator<(const Ed &l, const Ed &r) {
	return l.w > r.w;
}

using g_t = vector<vector<Ed>>;

void diDfs(int n, ll d, g_t &g, vector<ll> &di) {
	if (di[n] != -1) return;
	di[n] = d;
	for (auto e: g[n]) {
		diDfs(e.to, d + e.w, g, di);
	}
}

void maG(int n, int p, bool com, g_t &g, g_t &nG, vector<bool>& ma, array<vector<ll>, 2> &di, vector<int>& inD) {
	if (!ma[n]) {
		if (di[com][p] == 0) {
			nG.back().push_back({n, di[com][n]});
			inD[n]++;
		} else if (di[com][n] < di[!com][n]){
			nG[p].push_back({n, di[com][n]});
			inD[n]++;
		} else {
			nG[n].push_back({n + (int)g.size(), di[com][n] - di[!com][n]});
			nG[p + g.size()].push_back({n + (int)g.size(), di[com][n] - di[!com][n]});
			inD[n + g.size()] += 2;
		}
	} else if (ma[n] && di[com][n] > di[!com][n]) {
		if (di[com][p] < di[!com][n]) {
			nG.back().push_back({n + (int)g.size(),  di[com][n] - di[!com][n]});
			inD[n + g.size()]++;
		} else {
			nG[p + g.size()].push_back({n + (int)g.size(),  di[com][n] - di[!com][n]});
			inD[n + g.size()]++;
		}
	}
	for (auto e: g[n]) {
		if (e.to == p) continue;
		maG(e.to, n, com, g, nG, ma, di, inD);
	}
}

bool markdfs(int n, int p, int y, g_t &g, vector<bool> &ma) {
	if (n == y) return ma[n] = true;
	for (auto e: g[n]) {
		if (e.to == p) continue;
		if (markdfs(e.to, n, y, g, ma)) return ma[n] = true;
	}
	return false;
}

int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W) {
	g_t g(N);
	for (int i = 0; i < N - 1; ++i) {
		g[U[i]].push_back({V[i], W[i]});
		g[V[i]].push_back({U[i], W[i]});
	}
	array<vector<ll>, 2> dist;
	dist.fill(vector<ll>(N, -1));
	diDfs(X, 0, g, dist[0]);
	diDfs(Y, 0, g, dist[1]);
	int nuWithout = 0;
	vector<bool> vis(N, false);
	priority_queue<pair<Ed, bool>> q;
	q.push({{X, 0}, false});
	q.push({{Y, 0}, true});
	ll kC = K;
	while (!q.empty()) {
		auto [ed, com] = q.top();
		q.pop();
		if (vis[ed.to]) continue;
		if (kC < ed.w) break;
		kC -= ed.w;
		nuWithout++;
		vis[ed.to] = true;
		for (auto e: g[ed.to]) {
			q.push({{e.to, dist[com][e.to]}, com});
		}
	}
	vector<bool> ma(N, false);
	markdfs(X, X, Y, g, ma);
	int nuW = 0;
	g_t nG(2 * N + 1);
	for (int i = 0; i < N; ++i) {
		if (ma[i]) {
			K -= min(dist[0][i], dist[1][i]);
			nuW++;
		}
	}
	if (K < 0) return nuWithout;
	vector<int> inD(2*N);
	maG(X, X, false, g, nG, ma, dist, inD);
	maG(Y, Y, true, g, nG, ma, dist, inD);
	q.push({{2*N, 0}, false});
	while (!q.empty()) {
		auto [ed, com] = q.top();
		q.pop();
		if (kC < ed.w) break;
		kC -= ed.w;
		if (com) nuW++;
		for (auto e: nG[ed.to]) {
			if (--inD[e.to] == 0) {
				q.push({e, true});
			}
		}
	}
	return nuW;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '4'
2 Halted 0 ms 0 KB -

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 41520 KB Output is correct
2 Correct 122 ms 47932 KB Output is correct
3 Correct 61 ms 5588 KB Output is correct

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '4'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '4'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '4'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '4'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '4'
2 Halted 0 ms 0 KB -