제출 #432620

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
432620		LouayFarah	Split the Attractions (IOI19_split)	C++14	18 / 100	122 ms	17220 KiB

split

#include "bits/stdc++.h"
#include "split.h"
using namespace std;

#define ll long long
#define pb push_back

void dfs(vector<int> adj[], vector<bool> &visited, int u, vector<int> &res)
{
    res.pb(u);
    visited[u] = true;

    for(auto v: adj[u])
    {
        if(!visited[v])
        {
            dfs(adj, visited, v, res);
        }
    }
}

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

    for(int i = 0; i<m; i++)
    {
        adj[p[i]].pb(q[i]);
        adj[q[i]].pb(p[i]);
    }

    vector<int> res;
    vector<bool> visited(n, false);

    int beg = 0;
    for(int i = 0; i<n; i++)
    {
        if((int)adj[i].size()==1)
        {
            beg = i;
            break;
        }
    }
    dfs(adj, visited, beg, res);

    vector<int> r(n, 0);

    int i = 0;
    int counter = 0;
    while(counter<a)
    {
        r[res[i]] = 1;
        i++, counter++;
    }
    counter = 0;
    while(counter<b)
    {
        r[res[i]] = 2;
        i++, counter++;
    }
    counter = 0;
    while(counter<c)
    {
        r[res[i]] = 3;
        i++, counter++;
    }

    return r;
}

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