Submission #1236354

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236354		mariza	Split the Attractions (IOI19_split)	C++20	18 / 100	60 ms	13256 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<ll> s;
bool vis[N]={};
void dfs(ll curr){
    if(vis[curr]) return;
    vis[curr]=1;
    s.push_back(curr);

    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++){
        if(g[i].size()==1){
            dfs(i);
            break;
        }
    }
    if(s.empty()) dfs(0);

    vector<int> ans(n,3);
    for(ll i=0; i<a; i++){
        ans[s[i]]=1;
    }
    for(ll i=a; i<a+b; i++){
        ans[s[i]]=2;
    }

    return ans;
}

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