제출 #722856

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

split

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

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q1) {
	vector<int> res(n);
    int m=p.size();
    vector<int> adj[n];
    for(int i=0;i<m;i++){
        adj[p[i]].push_back(q1[i]);
        adj[q1[i]].push_back(p[i]);
    }
    queue<int> q;
    q.push(0);
    int cnt=0;
    vector<int> vis(n);
    while(q.size()&&cnt<b){
        int p=q.front();
        q.pop();
        cnt++;
        res[p]=2;
        for(int j:adj[p]){
            if(vis[j]==0){
                vis[j]=1;
                q.push(j);
            }
        }
    }
    for(int i=0;i<n;i++){
        if(res[i]==0){
            res[i]=1;
            break;
        }
    }
    for(int i=0;i<n;i++){
        if(res[i]==0){
            res[i]=3;
        }
    }

	return res;
}

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