Submission #98823

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
98823	2019-02-26T10:01:12 Z	Just_Solve_The_Problem	Highway Tolls (IOI18_highway)	C++11	Compilation error	0 ms	0 KB

highway

#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;
unordered_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
*/

Compilation message

highway.cpp:18:1: error: 'unordered_map' does not name a type
 unordered_map < pair < int, int >, int > mp;
 ^~~~~~~~~~~~~
highway.cpp: In function 'void dfs(int, int)':
highway.cpp:27:5: error: 'mp' was not declared in this scope
   w[mp[{v, to}]] = 1;
     ^~
highway.cpp:27:5: note: suggested alternative: 'p'
   w[mp[{v, to}]] = 1;
     ^~
     p
highway.cpp: In function 'void find_pair(int, std::vector<int>, std::vector<int>, int, int)':
highway.cpp:41:3: error: 'mp' was not declared in this scope
   mp[{v, u}] = mp[{u, v}] = i;
   ^~
highway.cpp:41:3: note: suggested alternative: 'm'
   mp[{v, u}] = mp[{u, v}] = i;
   ^~
   m
highway.cpp:80:6: error: 'mp' was not declared in this scope
    w[mp[{v, p[v]}]] = 1;
      ^~
highway.cpp:80:6: note: suggested alternative: 'm'
    w[mp[{v, p[v]}]] = 1;
      ^~
      m
highway.cpp:105:6: error: 'mp' was not declared in this scope
    w[mp[{v, p[v]}]] = 1;
      ^~
highway.cpp:105:6: note: suggested alternative: 'm'
    w[mp[{v, p[v]}]] = 1;
      ^~
      m