Submission #1021906

#	Time	Username	Problem	Language	Result	Execution time	Memory
1021906		mindiyak	Split the Attractions (IOI19_split)	C++14	0 / 100	616 ms	1048576 KiB

split

#include "split.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

vvi paths(100005,vi());
vi ans;
vi parents(100005,-1);
vi counter(100005,-1);
vvi children(100005 ,vi());

int dfs(int pos,int par){
	parents[pos] = par;
	int sum = 1;
	for(int a:paths[pos]){
		if(a == par)continue;
		children[pos].pb(a);
		sum += dfs(a,pos);
	}
	counter[pos] = sum;
	return sum;
}

vector<int> find_split(int n, int a, int b, int c, vi p, vi q) {
	ans = vi(n,0);
	FOR(i,0,p.size()){
		paths[p[i]].pb(q[i]);
		paths[q[i]].pb(p[i]);
	}

	vpi num = {{a,1},{b,2},{c,3}};
	sort(num.begin(),num.end());

	dfs(0,-1);

	int head = -1;
	FOR(i,0,n){
		if(num[0].F<=counter[i] && (n-counter[i])>=b){
			head = i;
		}
	}

	// cout << head << endl;
	// FOR(i,0,n){
	// 	cout << i << " -> ";
	// 	for(int j:children[i])cout << j << " ";
	// 	cout << endl;
	// }

	priority_queue <int> pq;
	pq.push(head);
	while(num[0].F>0){
		int node = pq.top();pq.pop();
		ans[node] = num[0].S;
		num[0].F--;
		for(int nodeb :children[node]){
			pq.push(nodeb);
		}
	}

	// for(int i:ans)cout << i << " ";
	// cout << endl;

	pq = priority_queue <int>();
	pq.push(0);
	while(num[1].F>0 && pq.empty() == 0){
		int node = pq.top();pq.pop();
		if(ans[node] != 0)continue;
		ans[node] = num[1].S;
		num[1].F--;
		for(int nodeb :children[node]){
			pq.push(nodeb);
		}
	}

	// for(int i:ans)cout << i << " ";
	// cout << endl;

	if(num[1].F > 0){
		ans = vi(n,0);
		return ans;
	}

	FOR(i,0,n){
		if(ans[i] == 0){
			ans[i] = num[2].S;
		}
	}


	return ans;
}

Compilation message (stderr)

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, vi, vi)':
split.cpp:22:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 | #define FOR(i, a, b) for (int i = a; i < (b); i++)
      |                                        ^
split.cpp:61:2: note: in expansion of macro 'FOR'
   61 |  FOR(i,0,p.size()){
      |  ^~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36