| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 13910 | Namnamseo | Shymbulak (IZhO14_shymbulak) | C++98 | 3 ms | 14100 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 <cstdio>
#include <cassert>
#include <algorithm>
#include <vector>
#include <map>
#define maxn 200010
using namespace std;
typedef pair<int,long long> pli;
bool cycle[maxn];
bool visited[maxn];
int parent[maxn];
int cycstack[maxn];
pli depth[maxn*2];
int cycind;
vector<int> edge[maxn];
int cyclepeak;
void dfs(int pos){
visited[pos]=true;
int i,s=edge[pos].size(),nxt;
for(i=0;i<s;++i){
nxt=edge[pos][i];
if(parent[pos]!=nxt){
if(visited[nxt]){
if(cycind) continue;
int tmp=pos;
for(;;){
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||