제출 #718327

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718327		bebra	Split the Attractions (IOI19_split)	C++17	0 / 100	454 ms	1048576 KiB

split

#include "split.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define dbg(x) cerr << #x << ": " << x << endl;


const int MAX_N = 1e5 + 5;
vector<int> g[MAX_N];
int color[MAX_N];
bool block[MAX_N];
int sz[MAX_N];

int n;
int val[3];
int order[3];

void dfs_color(int v, int p, int c, int& cnt) {
    if (cnt == 0) return;

    --cnt;
    color[v] = c;

    for (auto u : g[v]) {
        if (u == p || block[u]) continue;

        dfs_color(u, v, c, cnt);
    }
}

bool dfs_calc(int v = 0, int p = -1) {
    sz[v] = 1;
    for (auto u : g[v]) {
        if (u == p) continue;

        if (dfs_calc(u, v)) return true;

        sz[v] += sz[u];
    }

    if (sz[v] >= val[order[0]] && n - sz[v] >= val[order[1]]) {
        block[v] = true;
        int curr_cnt1 = val[order[0]];
        int curr_cnt2 = val[order[1]];
        dfs_color(v, -1, order[0], curr_cnt1);
        dfs_color(0, -1, order[1], curr_cnt2);
        return true;
    }

    if (sz[v] >= val[order[1]] && n - sz[v] >= val[order[0]]) {
        block[v] = true;
        int curr_cnt1 = val[order[0]];
        int curr_cnt2 = val[order[1]];
        dfs_color(v, -1, order[1], curr_cnt2);
        dfs_color(0, -1, order[0], curr_cnt1);
        return true;
    }

    return false;
}


vector<int> find_split(int _n, int a, int b, int c, vector<int> p, vector<int> q) {
    n = _n;
    int m = p.size();

    for (int i = 0; i < m; ++i) {
        int u = p[i];
        int v = q[i];
        g[u].push_back(v);
        g[v].push_back(u);
    }

    val[0] = a;
    val[1] = b;
    val[2] = c;

    iota(order, order + 3, 0);
    sort(order, order + 3, [&](int lhs, int rhs) {
        return order[lhs] < order[rhs];
    });

    fill_n(color, n, order[2]);
    vector<int> res(n);
    if (!dfs_calc()) {
        throw 1;
        // return res;
    }

    for (int i = 0; i < n; ++i) {
        res[i] = color[i] + 1;
    }

	return res;
}


// int main() {

//     int m;
//     cin >> n >> m;

//     int a, b, c;
//     cin >> a >> b >> c;

//     vector<int> p(m), q(m);
//     for (int i = 0; i < m; ++i) {
//         cin >> p[i] >> q[i];
//     }

//     for (auto x : find_split(n, a, b, c, p, q)) {
//         cout << x << ' ';
//     }
//     cout << '\n';

// }

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