Submission #322017

#	Time	Username	Problem	Language	Result	Execution time	Memory
322017		anakib1	Split the Attractions (IOI19_split)	C++17	0 / 100	1 ms	364 KiB

split

//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
	A X;
	B Y;
	C Z;
	triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
	return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
	if (a.X != b.X)
		return a.X < b.X;
	if (a.Y != b.Y)
		return a.Y < b.Y;
	return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
	ofs << "( " << p.F << " , " << p.S << " )";
	return ofs;
}
template<typename T>
void print(T a) {
	for (auto i : a)
		cout << i << ' ';
	cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
	return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
	return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
	return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
	return *max_element(all(a));
}
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}

	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
};
#include "split.h"


vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<pii> z({ {a,1},{b,2},{c,3} });
	if (a > b)swap(a, b);
	if (b > c)swap(b, c);
	if (a > b) swap(a, b);
	SORT(z);
	vector<vi> g(n);
	rngi(i, n - 1) g[p[i]].push_back(q[i]), g[q[i]].push_back(p[i]);
	vi usd(n);
	vi s(n), h(n);
	vi ans(n);
	function<int(int, int)> dfs = [&](int v, int hh) {
		usd[v] = s[v] = 1; h[v] = hh;
		for (auto to : g[v]) if (!usd[to])s[v] += dfs(to, hh + 1);
		return s[v];
	};
	function<void(int, int)> dfs2 = [&](int v, int x) {
		if (x == 1) {
			a--;
			if (a < 0)return;
		}
		if (x == 2) {
			b--;
			if (b < 0)return;
		}
		ans[v] = z[x-1].first;
		for (auto to : g[v]) if (!ans[to])dfs2(to, x);
	};
	dfs(0, 0);
	rngi(i, n - 1) {
		int v = p[i], u = q[i];
		if (h[v] < h[u]) swap(v, u);
		if (s[v] >= a && n - s[v] >= b) {
			ans[v] = 1; ans[u] = 2;
			dfs2(v, 1);
			dfs2(u, 2);
			rngi(j, n) if (!ans[j]) ans[j] = z[2].second;
			rngi(j, n)ans[j]--;
			return ans;
		}
	}
}

Compilation message (stderr)

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:116:37: warning: control reaches end of non-void function [-Wreturn-type]
  116 |  vector<pii> z({ {a,1},{b,2},{c,3} });
      |                                     ^

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