Submission #1203824

#	Time	Username	Problem	Language	Result	Execution time	Memory
1203824		Aviansh	Split the Attractions (IOI19_split)	C++20	18 / 100	63 ms	14536 KiB

split

#include "split.h"
#include <bits/stdc++.h>

using namespace std;

vector<int>order;

void dfs(int st, vector<int>g[], bool vis[]){
    order.push_back(st);
    vis[st]=1;
    for(int i : g[st]){
        if(vis[i])
            continue;
        dfs(i,g,vis);
    }
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    vector<int>ans(n);
    vector<int>g[n];
    int m = p.size();
    for(int i = 0;i<m;i++){
        g[p[i]].push_back(q[i]);
        g[q[i]].push_back(p[i]);
    }
    order.clear();
    bool vis[n];
    fill(vis,vis+n,0);
    dfs(0,g,vis);
    for(int i = 0;i<b;i++){
        ans[order[i]]=2;
    }
    for(int i = b;i<a+b;i++){
        ans[order[i]]=1;
    }
    for(int i = a+b;i<n;i++){
        ans[order[i]]=3;
    }
    return ans;
}

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