# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390142 | AriaH | Tropical Garden (IOI11_garden) | C++11 | 142 ms | 36896 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 "garden.h"
#include "gardenlib.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
int deg[N], Mn[N], F[N], D[N], n, Res[N];
bool v[N];
vector < int > E[N];
void DFS(int a, int d)
{
int i;
D[a] = d;
for (i = 0; i < (int)E[a].size(); i++){
if (D[E[a][i]] == -1)DFS(E[a][i], d + 1);
}
}
int QQ, DD[N];
struct Query{
int a, num;
bool operator<(const Query &p)const{
return a < p.a;
}
}w[N];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |