# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
961630 | TAhmed33 | Nestabilnost (COI23_nestabilnost) | C++98 | 150 ms | 197312 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 <bits/stdc++.h>
using namespace std;
const int MAXN = 5e3 + 25;
typedef long long ll;
const ll inf = 1e14;
ll a[MAXN], f[MAXN], n;
vector <int> adj[MAXN];
bool vis[MAXN];
vector <int> ind;
void fix (int pos, int par) {
ind.push_back(pos);
for (int i = 0; i < (int)adj[pos].size(); i++) {
if (adj[pos][i] == par) {
adj[pos].erase(adj[pos].begin() + i);
}
}
vector <int> g;
for (auto j : adj[pos]) {
fix(j, pos);
if (a[pos] + 1 == a[j] || a[j] == 0) {
g.push_back(j);
}
}
adj[pos] = g;
}
vector <ll> dfs (int pos) {
vector <ll> dp(n + 1);
vis[pos] = 1;
for (int i = 1; i <= a[pos]; i++) dp[i] = inf;
for (auto j : adj[pos]) {
# | 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... |