# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13479 | ainta | Tropical Garden (IOI11_garden) | C++98 | 133 ms | 28704 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<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int deg[150010], Mn[150010], F[300010], D[300010], n, Res[2010];
bool v[300010];
vector<int>E[300010];
void DFS(int a, int d){
int i;
D[a] = d;
for (i = 0; i < E[a].size(); i++){
if (D[E[a][i]] == -1)DFS(E[a][i], d + 1);
}
}
int QQ, DD[300010];
struct Query{
int a, num;
bool operator<(const Query &p)const{
return a < p.a;
}
}w[2010];
int S[300010];
void Do(int a){
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... |