제출 #978460

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
978460		happy_node	Meetings (JOI19_meetings)	C++17	0 / 100	1714 ms	988 KiB

meetings

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

vector<pair<int,int>> edges;

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;
                bool fnd=0;
                for(auto r:curRoot) {
                        // at this subtree
                        int q=Query(root,r,u);
                        if(q==r || q==u) {
                                if(q==u) curRoot[pt]=u;
                                items[pt].push_back(u);
                                fnd=1;
                                break;
                        }

                        // not at this subtree
                        // do nothing
                        pt++;
                }

                if(!fnd) {
                        curRoot.push_back(u);
                        items.push_back({u});
                }
        }

        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