# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
195568 | theStaticMind | Meetings (JOI19_meetings) | C++14 | 0 ms | 0 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"
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
void dp(vector<int> data,int curr){
if(data.empty())return;
int big=data[0];
vector<int>sub,other;
sub.pb(big);
for(int i=1;i<data.size();i++){
if(data[i]==big)continue;
int q=Query(big,curr,data[i]);
if(q==curr)other.pb(data[i]);
else{
sub.pb(data[i]);
big=q;
}
}
Bridge(curr,big);
sub.erase(find(all(sub),big));
dp(sub,big);
dp(other,curr);
}
void Solve(int N){
vector<int>arr(N);
for(int i=1;i<N;i++)cin>>arr[i];
dp(arr,0);
}