Submission #978468

#	Time	Username	Problem	Language	Result	Execution time	Memory
978468		happy_node	Meetings (JOI19_meetings)	C++17	0 / 100	11 ms	600 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

const int MX=2005;

vector<pair<int,int>> edges;
bool vis[MX];

void dfs(int root, vector<int> v) {
        if(v.size()==1) {
                return;
        }

        vector<int> curRoot;
        vector<vector<int>> items;

        for(auto u:v) {
                if(u==root) continue;

                int pt=0;
                for(auto r:curRoot) {
                        // at this subtree
                        int q=Query(root,r,u);

                        if(q==root) {
                                // not at this subtree
                                pt++;
                                continue;
                        }

                        // at this subtree
                        curRoot[pt]=q;
                        if(!vis[q]) items[pt].push_back(q);
                        vis[q]=true;
                        if(!vis[u]) items[pt].push_back(u);
                        vis[u]=true;
                        break;
                }

                if(!vis[u]) {
                        curRoot.push_back(u);
                        items.push_back({u});
                }
        }

        for(auto u:v) {
                vis[u]=false;
        }

        int pt=0;
        for(auto r:curRoot) {
                edges.push_back({root,r});
                dfs(r,items[pt]);
                pt++;
        }
}

void Solve(int N) {
        vector<int> v;
        for(int i=0;i<N;i++) v.push_back(i);
        dfs(0,v);
        
        for(auto [u,v]:edges) {
                Bridge(u,v);
        }
}

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