제출 #1021229

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

split

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

const ll MAXN = 1E5+16;
bool vis[MAXN];
vll adj[MAXN];
vll ord;

void dfs (ll u) {
    if (vis[u]) return;
    vis[u] = true;
    ord.push_back(u);
    for (ll v : adj[u])
        dfs(v);
}

vi find_split (int n, int a, int b, int c, vi us, vi vs) {
    if (a > b) swap(a, b);
    if (b > c) swap(b, c);
    if (a > b) swap(a, b);
    assert(a <= b && b <= c);
    ll m = us.size();
    for (ll i = 0; i < m; i++) {
        adj[us[i]].push_back(vs[i]);
        adj[vs[i]].push_back(us[i]);
    }
    ll st = 0;
    for (ll u = 0; u < n; u++)
        if (adj[u].size() == 1) st = u;
    dfs(st);
    vi ans(n, -15);
    for (ll i = 0; i < a; i++) ans[ord[i]] = 1;
    for (ll i = a; i < a+b; i++) ans[ord[i]] = 2;
    for (ll i = a+b; i < n; i++) ans[ord[i]] = 3;
    return ans;
}

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