# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977741 | alexdd | Min-max tree (BOI18_minmaxtree) | C++17 | 157 ms | 33148 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>
using namespace std;
int n,k;
vector<int> con_cuplaj[140005];
int tole[140005],tori[140005];
void add_edge(int xle, int xri)
{
con_cuplaj[xle].push_back(xri);
con_cuplaj[xri].push_back(xle);
}
int visited[140005],pas;
bool cupleaza(int nod)
{
if(visited[nod]==pas)
return 0;
visited[nod]=pas;
for(auto x:con_cuplaj[nod])
{
if(tole[x]==0)
{
tori[nod]=x;
tole[x]=nod;
return 1;
}
}
for(auto x:con_cuplaj[nod])
{
if(cupleaza(tole[x]))
{
tori[nod]=x;
Compilation message (stderr)
# | 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... |