| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 300266 | Elephant52 | Highway Tolls (IOI18_highway) | C++11 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vpi;
#define INF 1000000000
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define rep(i,a,b) for (int i = a; i < b; i++)
void setIO(string name) {
freopen((name+".in").c_str(), "r", stdin);
freopen((name+".out").c_str(), "w", stdout);
}
typedef struct node {
int vertex, edge, dist;
node() {};
node(int a, int b, int c) : vertex(a), edge(b), dist(c) {};
} node;
vpi adj[90000];
vi tree_adj[90000];
vi edge_dist[90000];
bool seen[90000];
int subtree_sizes[90000];
int depth[90000];
void make_spanning_tree(int cur) {
seen[cur] = 1;
for (auto p : adj[cur]) {
int edge = p.F;
if (!seen[edge]) {
make_spanning_tree(edge);
tree_adj[cur].PB(edge);
tree_adj[edge].PB(cur);
}
}
}
void find_sizes(int cur) {
seen[cur] = subtree_sizes[cur] = 1;
for (auto edge : tree_adj[cur]) {
if (!seen[edge]) {
find_sizes(edge);
subtree_sizes[cur] += subtree_sizes[edge];
}
}
}
int find_centroid(int N) {
find_sizes(0);
int centroid = 0, largest_subtree, next = 0;
do {
centroid = next;
largest_subtree = 0;
int nxt;
for (auto edge : adj[centroid]) {
if (subtree_sizes[edge.F] > largest_subtree) {
largest_subtree = subtree_sizes[N];
nxt = edge.F;
}
}
} while(largest_subtree >= N/2+1 && N - subtree_sizes[centroid] >= N/2+1);
return centroid;
}
void find_pair(int N, vi U, vi V, int A, int B) {
int S, T, dist, M = V.size();
vi w(M, 0); //query edge list
rep(i,0,M) {
adj[U[i]].emplace_back(V[i], i);
adj[V[i]].emplace_back(U[i], i);
}
make_spanning_tree(0);
memset(seen, 0, sizeof(seen));
queue<pii> bfs;
bfs.push(MP(find_centroid(N), 1));
int tree_height = 0;
while (!bfs.empty()) {
pii cur = bfs.front(); bfs.pop(); //vertex, distance
depth[cur.F] = cur.S;
tree_height = max(tree_height, cur.S);
seen[cur] = 1;
for (auto edge : adj[cur]) {
edge_dist[cur.S].PB(edge.S);
if (!seen[edge.F]) bfs.push(MP(edge.F, cur.S));
}
}
assert(A > 0);
dist = ask(w)/A;
int low = 1, high = tree_height;
while (low < high) {
int mid = (low + high)/2;
for (int i = tree_height-1; i >= mid; i--) {
for (auto edge : edge_dist[i]) w[edge] = 1;
}
int res = ask(w);
if (res > dist*A) low = mid+1;
else high = mid;
memset(&w[0], 0, sizeof(w[0])*M);
}
int lower_point = low-1; //depth of lower point
low = 0, high = edge_dist[lower_point].size();
while (low < high) {
int mid = (low + high)/2;
for (int i = 0; i <= mid; i++) w[edge_dist[lower_point][i]] = 1;
int res = ask(w);
if (res > dist*A) high = mid;
else low = mid+1;
memset(&w[0], 0, sizeof(w[0])*M);
}
S = min(U[edge_dist[lower_point][low]], V[edge_dist[lower_point][low]]);
if (depth[U[edge_dist[lower_point][low]]] > depth[V[edge_dist[lower_point][low]]]) S = U[edge_dist[lower_point][low]];
else S = V[edge_dist[lower_point][low]];
queue<node> bfs2;
bfs2.push(node(S, 0, 0));
memset(seen, 0, sizeof(seen));
while (!bfs2.empty()) {
auto cur = bfs.front(); bfs.pop();
if (dist == cur.dist) {
w[edge] = 1;
int res = ask(w);
if (res > dist*A) {
T = cur.vertex;
break;
}
w[edge] = 0;
}
for (auto edge : adj[cur.vertex]) {
if (!v[edge.F]) {
bfs.push(node(edge.F, edge.S, cur.dist+1));
}
}
}
answer(S, T);
}