Submission #187542

#	Time	Username	Problem	Language	Result	Execution time	Memory
187542		ToMmyDong	Meetings (JOI19_meetings)	C++14	29 / 100	3049 ms	1280 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define SZ(i) int(i.size())


struct Subtree {
    int rt;
    vector<int> nd;
};

void solve (vector<int> node) {
    int rt = node[0];

    vector<Subtree> sub;
    for (int i=1;i<SZ(node);i++) {
        bool flag = false;
        for (auto &tr : sub) {
            int ret = Query(tr.rt, node[i], rt);
            if (ret != rt) {
                if (ret == node[i]) {
                   tr.rt =  node[i];
                }
                tr.nd.emplace_back(node[i]);
                flag = true;
                break;
            }
        }
        if (!flag) {
            sub.push_back({node[i],{node[i]}});
        }
    }

    for (auto tr : sub) {
        if (rt < tr.rt) {
            Bridge(rt, tr.rt);
        } else {
            Bridge(tr.rt, rt);
        }
        solve(tr.nd);
    }
}

void Solve(int N) {
    vector<int> node;
    for (int i=0;i<N;i++) {
        node.emplace_back(i);
    }

    srand(279936);
    random_shuffle(node.begin(),node.end());
    solve(node);

}

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