oj.uz

Submission #98822

# Submission time Handle Problem Language Result Execution time Memory
98822 2019-02-26T09:59:27 Z Just_Solve_The_Problem Highway Tolls (IOI18_highway) C++11
18 / 100
 1500 ms 64296 KB 
#include "highway.h"
//#include "grader.cpp"
#include <vector>
#include <map>
#include <utility>
#include <iostream>

#define ll long long

using namespace std;

const int maxn = (int)1e5 + 7;

int h[maxn];
vector < int > gr[maxn];
vector < int > vec[maxn];
vector < int > w;
map < pair < int, int >, int > mp;
int p[maxn];

void dfs(int v, int pr) {
	vec[h[v]].push_back(v);
	p[v] = pr;
	for (int to : gr[v]) {
		if (to == pr) continue;
		h[to] = h[v] + 1;
		w[mp[{v, to}]] = 1;
		dfs(to, v);
	}
}

void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
	int m = U.size();
	ll dist = 0;
	w.resize(m, 0);
	dist = ask(w) / A;
	for (int i = 0; i < m; i++) {
		int u, v;
		u = U[i];
		v = V[i];
		mp[{v, u}] = mp[{u, v}] = i;
		gr[u].push_back(v);
		gr[v].push_back(u);
	}
	int l = -1;
	int r = m - 1;
	while (r - l > 1) {
		int mid = (l + r) >> 1;
		for (int i = 0; i <= mid; i++) {
			w[i] = 1;
		}
		for (int i = mid + 1; i < m; i++) {
			w[i] = 0;
		}
		ll T = ask(w);
		if (T > dist * A) {
			r = mid;
		} else {
			l = mid;
		}
	}
	int a, b;
	a = U[r];
	b = V[r];
	for (int i = 0; i < m; i++) {
		w[i] = 0;
	}
	dfs(a, b);
	int s, t;
	ll asd = (ask(w) - dist * A) / (B - A);
	l = -1;
	r = vec[asd].size() - 1;
	while (r - l > 1) {
		int mid = (l + r) >> 1, v;
		for (int i = 0; i < m; i++) {
			w[i] = 0;
		}
		for (int i = 0; i <= mid; i++) {
			v = vec[asd][i];
			w[mp[{v, p[v]}]] = 1;
		}
		ll T = ask(w);
		if (T > A * dist) {
			r = mid;
		} else {
			l = mid;
		}
	}
	s = vec[asd][r];
	for (int i = 0; i < maxn; i++) {
		vec[i].clear();
	}
	h[s] = 0;
	dfs(s, s);
	asd = dist;
	l = -1;
	r = vec[asd].size() - 1;
	while (r - l > 1) {
		int mid = (l + r) >> 1, v;
		for (int i = 0; i < m; i++) {
			w[i] = 0;
		}
		for (int i = 0; i <= mid; i++) {
			v = vec[asd][i];
			w[mp[{v, p[v]}]] = 1;
		}
		ll T = ask(w);
		if (T > A * dist) {
			r = mid;
		} else {
			l = mid;
		}
	}
	t = vec[asd][r];
	answer(s, t);
}
/*
7 6 4 5 0 3
0 2
1 2
2 3
3 4
4 5
4 6

2 1 1 2 0 1
0 1
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5032 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 5036 KB Output is correct
5 Correct 6 ms 5016 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 6 ms 5032 KB Output is correct
8 Correct 6 ms 5032 KB Output is correct
9 Correct 7 ms 5020 KB Output is correct
10 Correct 6 ms 5028 KB Output is correct
11 Correct 6 ms 5112 KB Output is correct
12 Correct 6 ms 5020 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5256 KB Output is correct
2 Correct 46 ms 6884 KB Output is correct
3 Correct 677 ms 22528 KB Output is correct
4 Correct 481 ms 22276 KB Output is correct
5 Correct 475 ms 22240 KB Output is correct
6 Correct 446 ms 22212 KB Output is correct
7 Correct 583 ms 22256 KB Output is correct
8 Correct 431 ms 22212 KB Output is correct
9 Correct 581 ms 22568 KB Output is correct
10 Correct 518 ms 22240 KB Output is correct
11 Correct 474 ms 23984 KB Output is correct
12 Correct 495 ms 25688 KB Output is correct
13 Correct 448 ms 24724 KB Output is correct
14 Correct 511 ms 24952 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 7860 KB Output is correct
2 Correct 57 ms 10712 KB Output is correct
3 Correct 88 ms 13764 KB Output is correct
4 Correct 261 ms 28540 KB Output is correct
5 Correct 271 ms 28564 KB Output is correct
6 Correct 207 ms 30568 KB Output is correct
7 Correct 270 ms 32236 KB Output is correct
8 Correct 263 ms 29448 KB Output is correct
9 Correct 279 ms 29860 KB Output is correct

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5160 KB Output is correct
2 Correct 35 ms 6904 KB Output is correct
3 Correct 324 ms 18316 KB Output is correct
4 Correct 447 ms 22180 KB Output is correct
5 Correct 490 ms 22336 KB Output is correct
6 Correct 418 ms 22152 KB Output is correct
7 Correct 480 ms 22328 KB Output is correct
8 Correct 498 ms 22312 KB Output is correct
9 Correct 549 ms 22528 KB Output is correct
10 Correct 581 ms 22608 KB Output is correct
11 Correct 540 ms 24152 KB Output is correct
12 Correct 458 ms 25888 KB Output is correct
13 Correct 516 ms 25008 KB Output is correct
14 Correct 489 ms 24800 KB Output is correct
15 Correct 428 ms 22188 KB Output is correct
16 Correct 433 ms 22228 KB Output is correct
17 Correct 507 ms 24568 KB Output is correct
18 Correct 528 ms 25560 KB Output is correct
19 Correct 498 ms 22248 KB Output is correct
20 Correct 468 ms 25992 KB Output is correct
21 Correct 834 ms 22696 KB Output is correct
22 Execution timed out 1514 ms 23048 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Runtime error 249 ms 64296 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Runtime error 222 ms 64280 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -