Submission #428238

#	Time	Username	Problem	Language	Result	Execution time	Memory
428238		A_D	Split the Attractions (IOI19_split)	C++14	0 / 100	39 ms	5100 KiB

split

#include "split.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+100;
vector<int> g[N];
bool vis[N];
vector<int> ret;
int a,b,c;
void dfs(int u)
{
    if(b==0)return;
    b--;
    vis[u]=1;
    for(auto x:g[u]){
        if(b==0)return;
        if(vis[x])continue;
        dfs(x);
    }
}
vector<int> find_split(int n,int A,int B,int C,vector<int> p,vector<int> q){
    a=A;
    b=B;
    c=C;
    dfs(0);
    for(int i=0;i<n;i++){
        if(vis[i])ret.push_back(2);
        else if(a){
            a--;
            ret.push_back(1);
        }
        else ret.push_back(3);
    }
    return ret;
}

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