oj.uz

Submission #1022339

# Submission time Handle Problem Language Result Execution time Memory
1022339 2024-07-13T12:08:51 Z j_vdd16 Closing Time (IOI23_closing) C++17
8 / 100
 68 ms 25424 KB 
#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

int n, x, y, k;
vvii adj;
signed max_score(signed _n, signed _x, signed _y, int _k, vector<signed> u, vector<signed> v, vector<signed> w) {
	n = _n; x = _x; y = _y; k = _k;
	adj = vvii(n);
	loop(i, n - 1) {
		adj[u[i]].push_back({ v[i], w[i] });
		adj[v[i]].push_back({ u[i], w[i] });
	}

	vi c(n, 0);
	int score = 0;

	typedef tuple<int, int, int> iii;
	priority_queue<iii, vector<iii>, greater<iii>> todo;
	todo.push({ 0, x, -1 });
	todo.push({ 0, y, -1 });
	while (todo.size()) {
		auto [cost, node, parent] = todo.top();
		todo.pop();
		if (k - cost < 0)
			break;

		c[node] = cost;
		k -= cost;
		score++;

		for (auto [child, weight] : adj[node]) {
			if (child == parent)
				continue;

			todo.push({ cost + weight - c[child], child, node });
		}
	}

	return score;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 25172 KB Output is correct
2 Correct 68 ms 25424 KB Output is correct
3 Correct 44 ms 5556 KB Output is correct

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

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

Subtask #7
0.0 / 10.0

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

Subtask #8
0.0 / 10.0

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

Subtask #9
0.0 / 17.0

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