| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 561911 | timreizin | Meetings (JOI19_meetings) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include "meetings.h"
#include <random>
#include <vector>
#include <set>
#include <numeric>
#include <cassert>
#include <map>
using namespace std;
vector<vector<int>> adj;
mt19937 gen(555);
int find(vector<int> vertices, int pivot, set<int> path)
{
if (vertices.size() == 1) return vertices.front();
if (vertices.size() == 2)
{
adj[vertices.front()].push_back(vertices.back());
adj[vertices.back()].push_back(vertices.front());
}
else
{
vector<int> path;
map<int, vector<int>> comps;
int x = uniform_int_distribution<>(0, (int)vertices.size() - 1)(gen);
int y = x;
while (y == x) y = uniform_int_distribution<>(0, (int)vertices.size() - 1)(gen);
x = vertices[x];
y = vertices[y];
for (int i = 0; i < vertices.size(); ++i)
{
if (x == vertices[i] || y == vertices[i]) continue;
int r = Query(x, y, vertices[i]);
if (r != vertices[i]) comps[r].push_back(vertices[i]);
else path.push_back(r);
}
for (auto &[pivot, vertices]: comps)
{
//if (x != pivot && y != pivot) path.push_back(pivot);
vector<bool> used(vertices.size());
int left = vertices.size();
while (left)
{
int p = uniform_int_distribution<>(1, left)(gen);
for (int i = 0; i < vertices.size(); ++i)
{
p -= !used[i];
if (!p)
{
--left;
used[i] = true;
p = vertices[i];
break;
}
}
vector<int> next{p};
set<int> path;
for (int i = 0; i < vertices.size(); ++i)
{
if (!used[i])
{
int r = Query(vertices[i], p, pivot);
if (r != pivot)
{
used[i] = true;
--left;
next.push_back(vertices[i]);
if (r == vertices[i]) path.insert(r);
}
}
}
int e = find(next, p, path);
adj[pivot].push_back(e);
adj[e].push_back(pivot);
}
}
// a < b iff q(x, a, b) = a
sort(path.begin(), path.end(), [&x](int a, int b) { return Query(x, a, b) == a; });
if (!path.empty())
{
adj[x].push_back(path.front());
adj[path.front()].push_back(x);
adj[y].push_back(path.back());
adj[path.back()].push_back(y);
}
else
{
adj[x].push_back(y);
adj[y].push_back(x);
}
for (int i = 0; i + 1 < path.size(); ++i)
{
adj[path[i]].push_back(path[i + 1]);
adj[path[i + 1]].push_back(path[i]);
}
}
int v = pivot;
while (!path.empty())
{
for (int u : adj[v])
{
if (path.find(u) != path.end())
{
path.erase(u);
v = u;
}
}
}
return v;
}
void Solve(int n)
{
adj.resize(n);
set<int> path;
vector<int> vertices(n);
iota(vertices.begin(), vertices.end(), 0);
find(vertices, 0, path);
for (int i = 0; i < n; ++i)
{
for (int u : adj[i])
{
if (i < u) Bridge(i, u);
}
}
}