oj.uz

Submission #1065565

# Submission time Handle Problem Language Result Execution time Memory
1065565 2024-08-19T09:23:27 Z raspy Closing Time (IOI23_closing) C++17
0 / 100
 1000 ms 30664 KB 
#include "closing.h"

#include <vector>
#include <queue>
#define ll long long
#define vi vector<ll>
#define pb push_back
#define ii pair<ll, ll>
#define inf 1'000'000'000'000'000'000

using namespace std;

vector<ii> graf[200005];
vi dis1, dis2;

void dfs(ll u, vi& dis, ll p = -1)
{
	if (p+1)
		dis[u] = dis[p]+1;
	for (auto [v, w]:graf[u])
		if (v != p)
			dfs(v, dis, u);
}

ll sol1(ll n, ll x, ll y, ll k)
{
	priority_queue<ll, vi, greater<ll>> pq;
	for (ll i = 0; i < n; i++)
	{
		pq.push(dis2[i]);
		pq.push(dis1[i]);
	}
	ll tk = 0;
	ll rez = 0;
	while (pq.size() && tk+pq.top() <= k)
	{
		tk += pq.top();
		rez++;
	}
	return rez;
}

// ll sol2()
// {
	
// }

int max_score(int n, int x, int y, long long k, vector<int> U, vector<int> V, vector<int> W)
{
	for (ll i = 0; i < n; i++)
		graf[i].clear();
	dis1.clear();
	dis2.clear();
	dis1 = dis2 = vi(n, 0);
	for (ll i = 0; i < n-1; i++)
	{
		graf[U[i]].pb({V[i], W[i]});
		graf[V[i]].pb({U[i], W[i]});
	}
	dfs(x, dis1);
	dfs(y, dis2);
	for (ll i = 0; i < n; i++)
		if (dis1[i] < dis2[i])
			swap(dis1[i], dis2[i]);
	ll rez = sol1(n, x, y, k);
	return rez;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

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

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

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

Subtask #7
0.0 / 10.0

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

Subtask #8
0.0 / 10.0

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

Subtask #9
0.0 / 17.0

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