제출 #722963

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
722963		Darren0724	Split the Attractions (IOI19_split)	C++17	18 / 100	101 ms	13736 KiB

split

#include "split.h"
#include<bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
const int N=100005;
vector<int> adj[N],res,v;
int vis[N];
void dfs(int k){
    vis[k]=1;
    v.push_back(k);
    for(int j:adj[k]){
        if(vis[j]){
            continue;
        }
        dfs(j);
    }
}

vector<int> find_split(int n1, int a, int b, int c, vector<int> x, vector<int> y) {
    int n=n1;
	res.resize(n);
    int m=x.size();
    for(int i=0;i<m;i++){
        adj[x[i]].push_back(y[i]);
        adj[y[i]].push_back(x[i]);
    }
    int root=0;
    for(int i=0;i<n;i++){
        if(adj[i].size()==1){
            root=i;
        }
    }
    dfs(root);
    for(int i=0;i<a;i++){
        res[v[i]]=1;
    }
    for(int i=a;i<a+b;i++){
        res[v[i]]=2;
    }
    for(int i=a+b;i<a+b+c;i++){
        res[v[i]]=3;
    }

	return res;
}
/*
7 6 4 2 1
0 1
0 2
1 3
1 4
2 5
2 6
*/
/*
10 10 2 7 1
0 1
1 2
2 3
3 4
4 5
5 6
6 7
7 9
8 9
8 0
*/

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