Submission #1244541

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244541		d1mk	ICC (CEOI16_icc)	C++20	100 / 100	68 ms	632 KiB

icc

/// 407!3 +/ \!<07!\*
#include <bits/stdc++.h>
#include "icc.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvpi = vector<vpi>;
using vvvi = vector<vvi>;
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

// pairs
#define mp make_pair
#define f first
#define s second

// vectors
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define eb emplace_back
#define pf push_front
#define er erase
#define ub upper_bound
#define lb lower_bound

// loops
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const int LG = 20;
const ll INF = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!
const char nl = '\n';

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

template<typename T>
using indexed_set =  tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ook order_of_key
#define fbo find_by_order

void _input() {return;}
template <typename T, typename... V>
void _input(T &t, V&... v) {cin >> (t); if (sizeof...(v))  _input(v...);}
void __input(vi &v, const int n){F0R(i, n)cin >> v[i];}
void __input(vvi &v, const int n, const int m){F0R(i, n)F0R(j, m)cin>>v[i][j];}

ll binpow(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}



void run(int N){
    int n = N;
    _print(n);
    vi group(n + 1);
    vvi groups(n + 1);
    FOR(i, 1, n + 1) {
        group[i] = i;
        groups[i].pb(i);
    }
    F0R(i, n - 1) {
        vvi sets(1);
        FOR(i, 1, n + 1)if (group[i] == i)sets[0].pb(i);
        while (true) {
            int a[n], b[n];
            int ai = 0, bi = 0;
            trav(set, sets) {
                int m = sz(set);
                if (m == 1)continue;
                F0R(i, m / 2) trav(el, groups[set[i]])a[ai++] = el;
                FOR(i, m / 2, m)trav(el, groups[set[i]])b[bi++] = el;
            }
            int x = query(ai, bi, a, b);
            _print(x);
            if (x)break;
            vvi nsets;
            trav(set, sets) {
                int m = sz(set);
                if (m <= 2)continue;
                nsets.pb({});
                F0R(i, m / 2) nsets.back().pb(set[i]);
                nsets.pb({});
                FOR(i, m / 2, m) nsets.back().pb(set[i]);
            }
            sets.swap(nsets);
        }
        int l = 0, r = sz(sets) - 1;
        while (l < r) {
            int md = (l + r) / 2;
            int a[n], b[n];
            int ai = 0, bi = 0;
            FOR(i, l, md + 1) {
                vi set = sets[i];
                int m = sz(set);
                F0R(i, m / 2) trav(el, groups[set[i]])a[ai++] = el;
                FOR(i, m / 2, m)trav(el, groups[set[i]])b[bi++] = el;
            }
            int x = query(ai, bi, a, b);
            if (x) r = md;
            else l = md + 1;
        }
        _print(l, r);
        vi set = sets[l];
        int m = sz(set);
        vi ls, rs;
        F0R(i, m / 2) trav(el, groups[set[i]])ls.pb(el);
        FOR(i, m / 2, m)trav(el, groups[set[i]])rs.pb(el);
        int ml = sz(ls), mr = sz(rs);
        l = 0, r = ml;
        while (l < r) {
            int md = (l + r) / 2;
            int a[n], b[n];
            int ai = 0, bi = 0;
            FOR(i, l, md + 1) a[ai++] = ls[i];
            F0R(i, mr) b[bi++] = rs[i];
            int x = query(ai, bi, a, b);
            if (x) r = md;
            else l = md + 1;
        }
        int a[1], ai = 1;
        a[0] = ls[l];
        l = 0, r = mr;
        while (l < r) {
            int md = (l + r) / 2;
            int b[n];
            int bi = 0;
            FOR(i, l, md + 1) b[bi++] = rs[i];
            int x = query(ai, bi, a, b);
            if (x) r = md;
            else l = md + 1;
        }
        int ansa = a[0], ansb = rs[l];
        if (group[ansa] > group[ansb])swap(ansa, ansb);
        int g = group[ansb];
        trav(el, groups[group[ansb]]) {
            group[el] = group[ansa];
            groups[group[ansa]].pb(el);
        }
        groups[g].clear();
        _print(ansa, ansb);
        setRoad(ansa, ansb);

    }

}


/*

*/
/*
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t; cin >> t;while(t--){
        solve();
    }
    return 0;
}*/

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 22 / 22
• Subtask 4: 21 / 21
• Subtask 5: 29 / 29
• Subtask 6: 10 / 10