# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201547 | Rakhmand | Meetings (JOI19_meetings) | C++14 | 3066 ms | 504 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "meetings.h"
#include <cstring>
#include <list>
#include <map>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <queue>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iterator>
using namespace std;
void Solve(int N) {
vector<pair<int, int> > v;
for(int a = 0; a < N; a++){
for(int b = a + 1; b < N; b++){
int cnt = 0;
for(int i = 0; i < N; i++){
if(a == i || b == i){
continue;
}
int cent = Query(i, a, b);
if(cent == b || cent == a){
cnt++;
}
}
if(cnt == N - 2){
v.push_back({a, b});
}
}
}
for(int i = 0; i < v.size(); i++){
Bridge(v[i].first, v[i].second);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |