# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135295 | ace5 | Jail (JOI22_jail) | C++20 | 3302 ms | 1114112 KiB |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 120001;
int en[maxn];
int st[maxn];
vector<int> g[maxn];
vector<int> ng[maxn];
int par[maxn];
int tin[maxn],tout[maxn];
int times = 0;
bool isc = 0;
int vis[maxn];
void dfs1(int v,int p)
{
par[v] = p;
tin[v] = times++;
for(auto u:g[v])
{
if(u != p)
{
dfs1(u,v);
}
}
tout[v] = times++;
return ;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |