Submission #1236350

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236350		mariza	Split the Attractions (IOI19_split)	C++20	11 / 100	63 ms	12732 KiB

split

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

typedef long long ll;
const ll N=1e5;

vector<ll> g[N];

vector<int> ans;
ll rb;
bool vis[N]={};
void dfs(ll curr){
    if(vis[curr] || rb==0) return;
    vis[curr]=1;
    ans[curr]=2;
    rb--;

    for(auto nxt:g[curr]){
        dfs(nxt);
    }
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	ll m=p.size();
    for(ll i=0; i<m; i++){
        g[p[i]].push_back(q[i]);
        g[q[i]].push_back(p[i]);
    }

    for(ll i=0; i<n; i++){
        ans.push_back(3);
    }

    rb=b;
    dfs(0);

    for(ll i=0; i<n; i++){
        if(ans[i]==3){
            ans[i]=1;
            break;
        }
    }
	return ans;
}

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