# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
716920 | Jarif_Rahman | Tropical Garden (IOI11_garden) | C++17 | 2341 ms | 56500 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>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
int n, m, q, P;
vector<vector<int>> R;
vector<int> succ;
vector<int> cnt;
vector<int> mx, smx;
vector<int> state;
vector<int> cycle_nodes;
vector<vector<pair<int, int>>> cycle_p;
vector<vector<int>> path_p;
int node(int e){ return e < m ? R[e][0]:R[e-m][1]; };
void dfs(int nd){
if(state[nd] > 0){
if(state[nd] == 1) cycle_nodes.pb(nd);
return;
}
state[nd] = 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |