# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
899130 | duckindog | Logičari (COCI21_logicari) | C++14 | 137 ms | 35152 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.
// from duckindog wth depression
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 10;
int n;
vector<int> ad[N];
bool dd[N];
int st, ed;
void locate(int u, int pre = 0) {
dd[u] = 1;
for (int v : ad[u]) {
if (v == pre) continue;
if (dd[v]) {
st = u, ed = v;
continue;
}
locate(v, u);
}
}
int f[N][2][2][2][2];
int dfs(int u, int pre, int sub, int par, int cst, int ced) {
if (u == ed && (par && cst || sub != ced)) return 1e6;
auto &ret = f[u][sub][par][cst][ced];
if (ret > -1) return ret; ret = sub;
bool seen = par;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |