Submission #1190088

#	Time	Username	Problem	Language	Result	Execution time	Memory
1190088		alexdd	Split the Attractions (IOI19_split)	C++20	0 / 100	3 ms	4936 KiB

split

#include "split.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> con[200005];
int cntv;
vector<int> visited;
void dfs(int nod, int b)
{
    if(cntv==b)
        return;
    visited[nod] = 2;
    cntv++;
    for(int adj:con[nod])
        if(!visited[adj])
            dfs(adj,b);
}
std::vector<int> find_split(int n, int a, int b, int c, std::vector<int> p, std::vector<int> q)
{
    visited.resize(n,0);
    for(int i=0;i<p.size();i++)
    {
        con[p[i]].push_back(q[i]);
        con[q[i]].push_back(p[i]);
    }
    dfs(0,b);
    for(int i=0;i<n;i++)
    {
        if(visited[i]==0)
        {
            visited[i]=1;
            break;
        }
    }
    return visited;
}

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