제출 #1077684

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

split

// Ignut

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 123;
int n;
int a, b, c;
int colorA = 1, colorB = 2, colorC = 3;

vector<int> g[MAXN];

int vert = -1;

vector<int> res;

int lim;

void dfs(int v, int col) {
    res[v] = col;
    lim --;
    if (lim == 0) return;
    for (int to : g[v]) {
        if (res[to] != 3)
            continue;
        if (lim == 0) return;
        dfs(to, col);
        if (lim == 0) return;
    }
}

vector<int> find_split(int N, int A, int B, int C, vector<int> P, vector<int> Q) {
    int M = P.size();
    for (int i = 0; i < M; i ++) {
        g[P[i]].push_back(Q[i]);
        g[Q[i]].push_back(P[i]);
    }

    res.assign(N, 3);
    
    vector<pair<int, int>> vec;
    for (int i = 0; i < N; i ++) vec.push_back({g[i].size(), i});
    vert = vec[0].second;

    res[vert] = 1;

    int start = 0;
    if (start == vert) start ++;

    lim = B;
    dfs(start, 2);

    return res;
}

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