# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294471 | albertolg101 | Split the Attractions (IOI19_split) | C++17 | 673 ms | 1048580 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "split.h"
using namespace std;
vector<int> a_is_equal_to_one (int b, int c, int n, vector<vector<int>> &G)
{
vector<bool> flag(n);
int cnt = 1;
function<void(int)> dfs1 = [&]( int nod )
{
for(auto i: G[nod])
{
if( cnt == b )
return ;
if(flag[i])
continue;
flag[i] = 1;
cnt++;
dfs1(i);
}
} ;
flag[0] = true;
dfs1(0);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |