Submission #1187731

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187731		oviyan_gandhi	Meetings (JOI19_meetings)	C++17	29 / 100	1284 ms	2576 KiB

meetings

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

#define N 2001
set<int> path[N];

void Solve(int n) {
    for (int i = 1; i < n; i++)
        for (int j = 1; j < n; j++)
            if (i != j && Query(0, i, j) == j)
                path[i].insert(j);
    queue<int> q;
    for (int i = 1; i < n; i++) {
        if (path[i].empty()) {
            Bridge(0, i);
            q.push(i);
        }
    }
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int v = 1; v < n; v++) {
            if (path[v].empty())
                continue;
            path[v].erase(u);
            if (path[v].empty()) {
                Bridge(min(u, v), max(u, v));
                q.push(v);
            }
        }
    }
}

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