# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24032 | jenkhai | Tropical Garden (IOI11_garden) | C++14 | 3538 ms | 49736 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;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
vector<vi> adj, F, adj2;
vi seen;
int C[3];
int N,P;
void join(int u, int v) {
if(seen[u] == 0) {
if(seen[v] == 0) adj[u].push_back(v+N);
else adj[u].push_back(v);
} else if(seen[u] == 1) {
if(seen[v] == 0) adj[u+N].push_back(v+N);
else adj[u+N].push_back(v);
}
}
void dfs(int u, int p, int idx) {
for(int i=0;i<adj2[u].size();i++) {
int v = adj2[u][i];
if(v==p) {
C[idx] = F[idx][u]+1;
} else if(F[idx][v] == -1){
F[idx][v] = F[idx][u]+1;
dfs(v, p, idx);
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... |