Submission #4228059
Source Code Expand
#include <iostream>
#include <math.h>
#include <vector>
#include <stack>
#include <cstdio>
#include <string>
#include <bitset>
#include <list>
#include <set>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <functional>
#include <queue>
#include <regex>
#include <cassert>
#include <map>
#include <type_traits>
#include <array>
#include <cassert>
#include <typeinfo>
#include <time.h>
//#include "boost/variant.hpp"
// #include "bits/stdc++.h"
using namespace std;
#define rep(i, N, M) for(ll i=N, i##_len=(M); i<i##_len; ++i)
#define rep_skip(i, N, M, ...) for(ll i=N, i##_len=(M); i<i##_len; i+=(skip))
#define rrep(i, N, M) for(ll i=(M)-1, i##_len=(N-1); i>i##_len; --i)
#define pb push_back
typedef pair<double, double> pd;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef tuple<ll, ll, ll> tll;
typedef tuple<ll, ll, ll, ll> tll4;
typedef tuple<ll, ll, ll, ll, ll> tll5;
typedef tuple<ll, ll, ll, ll, ll, ll> tll6;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
template<typename T>
using pq_greater = priority_queue<T, vector<T>, greater<T>>;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define vec(a) vector<a>
#define perm(c) sort(all(c));for(bool c##perm=1;c##perm;c##perm=next_permutation(all(c)))
template<typename T1, typename T2> void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> void chmax(T1 &a, T2 b) { if (a < b) a = b; }
constexpr ll POW_(ll n, ll m) {
ll res = 1;
rep(i, 0, m) {
res *= n;
}
return res;
}
template<int mod = 0>
constexpr ll POW(ll x, ll n) {
if (x == 2)
{
return (1LL << n) % mod;
}
if (n == 0)return 1;
if (n == 1)return x % mod;
if (n % 2 == 0)return POW_(POW<mod>(x, n / 2), 2LL) % mod;
return ((POW_(POW<mod>(x, n / 2, mod), 2LL) % mod)*(x%mod)) % mod;
}
template<>
constexpr ll POW<0>(ll x, ll n) {
if (x == 2)
{
return 1LL << n;
}
if (n == 0)return 1;
if (n == 1)return x;
if (n % 2 == 0) return POW_(POW(x, n / 2), 2);
return (POW_(POW(x, n / 2), 2))*x;
}
template<ll bit>
ll at_bit(ll n, ll i) {
return n / POW(bit, i) % bit;
}
template<>
ll at_bit<2>(ll n, ll i) {
return (n >> i) % 2LL;
}
template<ll bit>
ll get_bit(ll i) {
return POW(bit, i);
}
template<>
ll get_bit<2>(ll i) {
return 1LL << i;
}
template<ll bit = 2>
ll get_max_bit(ll n) {
ll tmp = bit;
ll at = 0;
while (tmp <= n) {
at++;
tmp *= bit;
}
return at;
}
template<>
ll get_max_bit<2>(ll n) {
ll tmp = 2;
ll at = 0;
while (tmp <= n) {
at++;
tmp <<= 1;
}
return at;
}
vll getDivisors(ll n) {
vll res;
ll i = 1;
for (; i*i < n; i++) {
if (n%i == 0) {
res.push_back(i);
res.push_back(n / i);
}
}
if (i*i == n)res.push_back(i);
sort(res.begin(), res.end());
return res;
}
vll getDivisors(ll n, ll m) {
if (n > m) swap(n, m);
vll res;
ll i = 1;
for (; i*i < n; i++) {
if (n%i == 0) {
if (m%i == 0) res.push_back(i);
if (m % (n / i) == 0) res.push_back(n / i);
}
}
if (i*i == n) if (m%i == 0) res.push_back(i);
sort(res.begin(), res.end());
return res;
}
ll gcd(ll a, ll b) {
if (a%b == 0) return b;
else return gcd(b, a%b);
}
template<
typename Inputs,
typename Functor,
typename T = typename Inputs::value_type>
void sort_by(Inputs& inputs, Functor f) {
std::sort(std::begin(inputs), std::end(inputs),
[&f](const T& lhs, const T& rhs) { return f(lhs) < f(rhs); });
}
template<
typename Inputs,
typename Functor,
typename T = typename Inputs::value_type>
void stable_sort_by(Inputs& inputs, Functor f) {
std::stable_sort(std::begin(inputs), std::end(inputs),
[&f](const T& lhs, const T& rhs) { return f(lhs) < f(rhs); });
}
// Functor is expected to be functional<val ,bool>
// This function returns the maximum iterator that stisfies f(*it) == f(* inputs.begin())
template<
typename Inputs,
typename Functor,
typename ValType = typename Inputs::value_type>
pair<typename Inputs::iterator, typename Inputs::iterator> binary_solve(Inputs& inputs, Functor f)
{
auto left = inputs.begin();
auto right = inputs.end();
auto n = inputs.size();
auto left_val = f(*left);
auto right_val = f(*(right - 1));
// check
assert(n >= 2);
assert(left_val != right_val);
while (left + 1 != right)
{
auto mid = left + (right - left) / 2;
if (f(*mid) == left_val)
{
left = mid;
}
else
{
right = mid;
}
}
return { left,right };
}
template<int I>
vll proj(vpll v) {
vll res(v.size());
rep(i, 0, v.size()) {
if (!I) res[i] = v[i].first;
else res[i] = v[i].second;
}
return res;
}
template<int I, class T>
vll proj(T v) {
vll res(v.size());
rep(i, 0, v.size()) {
res[i] = get<I>(v[i]);
}
return res;
}
vector<pll >prime_factorize(ll n) {
vector<pll> res;
for (ll p = 2; p*p <= n; ++p) {
if (n%p != 0)continue;
ll num = 0;
while (n%p == 0) { ++num; n /= p; }
res.push_back({ p,num });
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
ll MOD = 998244353;//1000000007;
ll INF = 1LL << 60;
ll n;
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
template <typename Monoid>
struct segment_tree
{
using underlying_type = typename Monoid::underlying_type;
segment_tree(ll a_n) : size_original(a_n)
{
vector<underlying_type> initial_value = vector<underlying_type>(a_n, Monoid::unit());
segment_tree_impl(a_n, initial_value);
}
segment_tree(ll a_n, vector<underlying_type>& initial_value) : size_original(a_n)
{
segment_tree_impl(a_n, initial_value);
}
void update(int i, underlying_type z) { // 0-based
assert(0 <= i && i < 2 * n - 1);
a[i + n - 1] = z;
for (i = (i + n) / 2; i > 0; i /= 2) { // 1-based
a[i - 1] = Monoid::append(a[2 * i - 1], a[2 * i]);
}
}
underlying_type query(ll l, ll r) { // 0-based, [l, r)
underlying_type lacc = Monoid::unit(), racc = Monoid::unit();
assert(l <= r && r <= n);
l += n; r += n;
for (; l < r; l /= 2, r /= 2) { // 1-based loop, 2x faster than recursion
if (l % 2 == 1) lacc = Monoid::append(lacc, a[(l++) - 1]);
if (r % 2 == 1) racc = Monoid::append(a[(--r) - 1], racc);
}
return Monoid::append(lacc, racc);
}
ll size() { return size_original; }
private:
ll size_original;
ll n;
vector<underlying_type> a;
void segment_tree_impl(ll a_n, vector<underlying_type>& initial_value)
{
assert(a_n == initial_value.size());
n = 1; while (n < a_n) n *= 2;
a.resize(2 * n - 1, Monoid::unit());
rep(i, 0, initial_value.size()) {
a[i + (n - 1)] = initial_value[i];
}
rrep(i, 0, n - 1) a[i] = Monoid::append(a[2 * i + 1], a[2 * i + 2]); // propagate initial values
}
};
template <typename T>
struct min_indexed_t {
typedef pair<T, ll> underlying_type;
static underlying_type make_indexed(vector<T> v)
{
underlying_type w(v.size());
rep(i, 0, v.size()) {
w[i] = { v[i],i };
}
return w;
}
static underlying_type unit() { return make_pair(numeric_limits<T>::max(), -1); }
static underlying_type append(underlying_type a, underlying_type b) { return min(a, b); }
};
template <typename T>
struct min_t {
typedef T underlying_type;
static underlying_type unit() { return numeric_limits<T>::max(); }
static underlying_type append(underlying_type a, underlying_type b) { return min(a, b); }
};
struct linear_t {
typedef pd underlying_type;
static underlying_type unit() { return underlying_type{ 1.,0. }; }
static underlying_type append(underlying_type a, underlying_type b) {
return underlying_type{ a.first*b.first, b.first*a.second + b.second };
}
};
struct UnionFind {
vector<ll> data;
UnionFind(ll size) : data(size, -1) { }
void unite(ll x, ll y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
}
bool find(ll x, ll y) {
return root(x) == root(y);
}
int root(ll x) {
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(ll x) {
return -data[root(x)];
}
};
vll get_topologically_sorted_nodes(const vvll& graph)
{
// graph needs to be represented by adjacent list.
// complexity: O( node size + edge size)
ll nodeSize = graph.size();
// find root
vll roots;
vll inDegree(nodeSize);
rep(i, 0, nodeSize)
{
for (ll sibling : graph[i]) {
inDegree[sibling]++;
}
}
rep(i, 0, nodeSize) {
if (inDegree[i] == 0) {
roots.push_back(i);
}
}
stack<ll> parents;
for (ll i : roots)
parents.push(i);
vll sortedNodes;
while (!parents.empty()) {
ll parent = parents.top();
parents.pop();
sortedNodes.push_back(parent);
for (ll sibling : graph[parent]) {
inDegree[sibling]--;
if (inDegree[sibling] == 0) {
parents.push(sibling);
}
}
}
return sortedNodes;
}
ll Eval(ll k, map<ll, ll>& dp, vll& bitNum, vll & a) {
if (k == 0) {
return accumulate(all(a), 0LL);
}
ll k_max = get_max_bit(k);
ll res = max(dp[POW(2, k_max - 1)], Eval(k - POW(2, k_max), dp, bitNum, a) + POW(2, k_max) * (max(bitNum[k_max], n - 2 * bitNum[k_max])));
return res;
};
int main() {
ll n, q;
cin >> n >> q;
vll p(q), a(q), b(q);
rep(i, 0, q) {
cin >> p[i] >> a[i] >> b[i];
}
UnionFind UF(n);
rep(i, 0, q) {
if (p[i]) {
// hantei
cout<<(UF.find(a[i], b[i])? "Yes":"No" )<<endl;
}
else {
// renketsu
UF.unite(a[i], b[i]);
}
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Union Find |
User |
pontaryagin |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
9859 Byte |
Status |
AC |
Exec Time |
471 ms |
Memory |
6272 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
00_sample_01.txt |
All |
00_sample_01.txt, subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_01_18.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01.txt |
AC |
1 ms |
256 KB |
subtask_01_01.txt |
AC |
264 ms |
3456 KB |
subtask_01_02.txt |
AC |
2 ms |
1024 KB |
subtask_01_03.txt |
AC |
405 ms |
5760 KB |
subtask_01_04.txt |
AC |
462 ms |
6272 KB |
subtask_01_05.txt |
AC |
24 ms |
640 KB |
subtask_01_06.txt |
AC |
25 ms |
1408 KB |
subtask_01_07.txt |
AC |
432 ms |
5504 KB |
subtask_01_08.txt |
AC |
457 ms |
6272 KB |
subtask_01_09.txt |
AC |
1 ms |
256 KB |
subtask_01_10.txt |
AC |
2 ms |
1024 KB |
subtask_01_11.txt |
AC |
407 ms |
5504 KB |
subtask_01_12.txt |
AC |
471 ms |
6272 KB |
subtask_01_13.txt |
AC |
350 ms |
4480 KB |
subtask_01_14.txt |
AC |
3 ms |
1024 KB |
subtask_01_15.txt |
AC |
431 ms |
5504 KB |
subtask_01_16.txt |
AC |
467 ms |
6272 KB |
subtask_01_17.txt |
AC |
306 ms |
6016 KB |
subtask_01_18.txt |
AC |
302 ms |
6016 KB |