제출 #901432

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
901432		GrindMachine	Meetings (JOI19_meetings)	C++17	29 / 100	1722 ms	2784 KiB

meetings

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "meetings.h"

void Solve(int n) {
    set<int> ances[n];
    rep1(u,n-1){
        for(int v = u+1; v < n; ++v){
            int lca = Query(0,u,v);
            ances[u].insert(lca);
            ances[v].insert(lca);
        }
    }

    rep(i,n) ances[i].insert(0);
    rep(i,n){
        if(ances[i].count(i)){
            ances[i].erase(i);
        }
    }

    vector<pii> order;
    rep(i,n) order.pb({sz(ances[i]),i});

    sort(all(order));
    vector<int> depth(n);

    for(auto [siz,u] : order){
        if(u == 0) conts;
        pii best = {-inf1,-inf1};
        trav(p,ances[u]){
            pii px = {depth[p],p};
            amax(best,px);
        }

        int p = best.ss;
        assert(p != -inf1);
        Bridge(min(u,p),max(u,p));
        depth[u] = depth[p]+1;
    }
}

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 0 / 71