# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428344 | Hazem | Split the Attractions (IOI19_split) | 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 "split.h"
#include <bits/stdc++.h>
#define LL long long
#define F first
#define S second
using namespace std;
const int N = 2e5+10;
const LL INF = 1e9;
vector<int>adj[N],ans;
int n,m,sizes[N],vis[N],par[N],a,b,c,mn = INF;
pair<int,pair<int,int>>p1;
vector<pair<int,int>>vec;
void dfs(int i,int pre){
sizes[i] = 1;par[i] = pre;
for(auto x:adj[i])
if(x!=pre)
dfs(x,i),sizes[i] += sizes[x];
if(sizes[i]>=a&&sizes[i]-a<mn)
mn = sizes[i]-a,p1 = make_pair(i,make_pair(a,1));
if(sizes[i]>=b&&sizes[i]-b<mn)
mn = sizes[i]-b,p1 = make_pair(i,make_pair(b,2));