제출 #678369

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
678369		irmuun	Split the Attractions (IOI19_split)	C++17	0 / 100	3 ms	2644 KiB

split

#include <bits/stdc++.h>
#include "split.h"
using namespace std;
#define ll long long
#define pb push_back
vector<int>dv[100005];
int df[100005];
vector<int>vec;
void dfs(int x){
    df[x]=1;
    vec.pb(x);
    for(auto y:dv[x]){
        if(df[y]==0){
            dfs(y);
        }
    }
}
vector<int> find_split(int n, int a, int b, int c, vector<int>p, vector<int>q){
    int m=p.size();
    for(int i=0;i<m;i++){
        dv[p[i]].pb(q[i]);
        dv[q[i]].pb(p[i]);
    }
    int start=0;
    for(int i=0;i<n;i++){
        if(dv[i].size()==1){
            start=i;
            break;
        }
    }
    vector<int>ans(n);
    dfs(start);
    for(int i=0;i<a;i++){
        ans[vec[i]]=1;
    }
    for(int i=a;i<a+b;i++){
        ans[vec[i]]=1;
    }
    for(int i=a+b;i<n;i++){
        ans[vec[i]]=1;
    }
    return ans;
};

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