# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954931 | Lukap | Nestabilnost (COI23_nestabilnost) | C++14 | 201 ms | 216840 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;
typedef long long ll;
const int MAXN = 5e3 + 500;
const ll INF = 1e18;
int n;
int val[MAXN], fk[MAXN];
vector<int> susjedi[MAXN], v;
int d[MAXN], parent[MAXN];
ll dp[MAXN][MAXN], najm[MAXN];
void dfs (int x) {
for (auto nx: susjedi[x]) {
if (parent[x] == nx) continue;
d[nx] = d[x] + 1;
parent[nx] = x;
dfs (nx);
}
}
bool cmp (int x, int y) {
return d[x] > d[y];
}
int main () {
ios_base::sync_with_stdio (false);
# | 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... |