Submission #1190087

#TimeUsernameProblemLanguageResultExecution timeMemory
1190087alexddSplit the Attractions (IOI19_split)C++20
0 / 100
2 ms4928 KiB
#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;
        }
    }

}

Compilation message (stderr)

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:35:1: warning: no return statement in function returning non-void [-Wreturn-type]
   35 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...