제출 #917156

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917156		guagua0407	Meetings (JOI19_meetings)	C++17	100 / 100	868 ms	2680 KiB

meetings

#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
mt19937 rng(time(NULL));

int gen(int x){
    return abs((int)rng())%x;
}
int R;
int n;

bool comp(int a,int b){
    return Query(R,a,b)==a;
}

void go(int root,vector<int> vec){
    if((int)vec.size()==1) return;
    vector<vector<int>> p(n);
    int x=vec[gen((int)vec.size())];
    while(x==root){
        x=vec[gen((int)vec.size())];
    }
    //cout<<root<<' '<<x<<'\n';
    for(auto v:vec){
        if(v==x or v==root) continue;
        int q=Query(root,v,x);
        p[q].push_back(v);
    }
    vector<int> tmp;
    for(auto v:vec){
        if(v==root or v==x or p[v].empty()) continue;
        tmp.push_back(v);
    }
    R=root;
    sort(all(tmp),comp);
    vector<int> tmp2;
    tmp2.push_back(root);
    tmp2.insert(tmp2.end(),all(tmp));
    tmp2.push_back(x);
    /*cout<<"list: ";
    for(auto v:tmp2){
        cout<<v<<' ';
    }
    cout<<'\n';*/
    for(int i=0;i<(int)tmp2.size()-1;i++){
        Bridge(min(tmp2[i],tmp2[i+1]),max(tmp2[i],tmp2[i+1]));
    }
    p[root].push_back(root);
    p[x].push_back(x);
    /*cout<<"check"<<'\n';
    for(auto v:tmp2){
        cout<<v<<'\n';
        for(auto u:p[v]){
            cout<<u<<' ';
        }
        cout<<'\n';
    }
    cout<<'\n';*/
    for(auto v:tmp2){
        go(v,p[v]);
    }
}

void Solve(int N){
    n=N;
    vector<int> vec(n);
    for(int i=0;i<n;i++){
        vec[i]=i;
    }
    go(0,vec);
}

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