제출 #296399

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
296399		cookiedoth	Highway Tolls (IOI18_highway)	C++14	5 / 100	21 ms	4888 KiB

highway

#include "highway.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <numeric>
#include <functional>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#include <cassert>
#include <random>
#define ll long long
#define ld long double
#define null NULL
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define length(a) (int)a.size()

using namespace std;

template<class iterator> void output(iterator begin, iterator end, ostream &out = cerr) {
	while (begin != end) {
		out << (*begin) << ' ';
		begin++;
	}
	out << endl;
}

template<class T> void output(const T &x, ostream &out = cerr) {
	output(x.begin(), x.end(), out);
}

template<class T> int chkmin(T &a, const T &b) {
	if (b < a) {
		a = b;
		return 1;
	}
	return 0;
}

template<class T> int chkmax(T &a, const T &b) {
	if (b > a) {
		a = b;
		return 1;
	}
	return 0;
}

void fast_io() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}

int n, m, A, B, toll0, last_v;
vector<vector<pair<int, int> > > g;

void dfs(int v, int pv) {
	for (auto pp : g[v]) {
		int v1 = pp.first;
		if (v1 != pv) {
			vector<int> cur(m);
			cur[pp.second] = 1;
			int toll1 = ask(cur);
			if (toll1 > toll0) {
				last_v = v1;
			}
			dfs(v1, v);
		}
	}
}

void solve() {
	toll0 = ask(vector<int> (m));
	dfs(0, 0);
	answer(0, last_v);
}

void find_pair(int _n, vector<int> U, vector<int> V, int _A, int _B) {
	n = _n;
	g.resize(n);
	m = length(U);
	for (int i = 0; i < m; ++i) {
		g[U[i]].emplace_back(V[i], i);
		g[V[i]].emplace_back(U[i], i);
	}
	solve();
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 6
• Subtask 4: 0 / 33
• Subtask 5: 0 / 18
• Subtask 6: 0 / 31