제출 #967851

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
967851		steveonalex	Meetings (JOI19_meetings)	C++17	0 / 100	36 ms	15440 KiB

meetings

#include <bits/stdc++.h>
#include "meetings.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 2007;
int n;
int lca[N][N];
int parent[N];
int h[N];

// int Query(int u, int v, int w){
//     cout << "? " << u << " " << v << " " << w << endl;
//     int verdict; cin >> verdict;
//     return verdict;
// }

// void Bridge(int u, int v){
//     cout << u << " " << v << "\n";
// }

void Solve(int _n){
    n = _n;

    for(int i = 2; i<=n; ++i) for(int j = i+1; j<=n; ++j){
        lca[i][j] = lca[j][i] = Query(1, i, j);
    }

    for(int i = 2; i<=n; ++i){
        h[i]++;
        for(int j = 2; j <= n; ++j) if (i != j){
            h[i] += (lca[i][j] == j);
        }
    }

    for(int i = 2; i<=n; ++i){
        pair<int, int> ma = {0, 1};
        for(int j = 2; j <= n; ++j) if (i != j){
            if (h[j] < h[i] && lca[i][j] == j) maximize(ma, make_pair(h[j], j));
        }
        parent[i] = ma.second;
    }

    for(int i = 1; i<=n; ++i) if (parent[i] != 0) {
        int u = parent[i], v = i;
        if (u > v) swap(u, v);
        Bridge(u, v);
    }
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     Solve(6);

//     return 0;
// }

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