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 <bits/stdc++.h>
#include "meetings.h"
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int p[2009];
vector<int> vectors[2009];
ll cur = 1;
void calc(int root, vector<int> &all){
vector<int> vec;
vector<int> lead;
for(auto u : all){
if(u == root) continue;
int put = 0;
for(int i = 0; i < lead.size(); ++i){
if(lead[i] == u){
vectors[vec[i]].pb(u);
put = 1;
break;
}
int tmp = Query(u, lead[i], root);
if(tmp == root) continue;
lead[i] = tmp;
vectors[vec[i]].pb(u);
put = 1;
break;
}
if(put == 0){
lead.pb(u);
vectors[cur].pb(u);
vec.pb(cur++);
}
}
for(int i = 0; i < lead.size(); ++i){
p[lead[i]] = root;
if(vectors[vec[i]].size() > 1)
calc(lead[i], vectors[vec[i]]);
vectors[vec[i]].clear();
}
}
void Solve(int n){
for(int i = 0; i < n; ++i)
vectors[0].pb(i);
if(vectors[0].size() > 1)
calc(0, vectors[0]);
for(int i = 1; i < n; ++i)
Bridge(min(i, p[i]), max(i, p[i]));
}
Compilation message (stderr)
meetings.cpp:3:0: warning: ignoring #pragma comment [-Wunknown-pragmas]
#pragma comment(linker, "/stack:200000000")
meetings.cpp: In function 'void calc(int, std::vector<int>&)':
meetings.cpp:27:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < lead.size(); ++i){
~~^~~~~~~~~~~~~
meetings.cpp:46:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < lead.size(); ++i){
~~^~~~~~~~~~~~~
# | 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... |