# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1129720 | gyg | Nestabilnost (COI23_nestabilnost) | C++20 | 313 ms | 47248 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define arr array
#define vec vector
#define pii pair<int, int>
#define fir first
#define sec second
const int N = 3e5 + 5, INF = 1e18;
int n;
arr<int, N> vl, cst;
arr<vec<int>, N> adj;
arr<vec<pii>, N> trns;
arr<int, N> mn;
void prcmp() {
vec<pii> cls = {{-1, 1}};
for (int u = 1; u <= n; u++) {
if (u != 1 && vl[u - 1] + 1 != vl[u]) {
if (vl[u] == 0) {
int cl = vl[u - 1] + 1;
if (!(cls.size() && cls.back().fir == cl)) cls.push_back({cl, u});
} else {
cls.clear();
cls.push_back({-1, u});
}
}
if (cls.size() >= 2) trns[u].push_back({cls.back().fir, cls[cls.size() - 2].sec});
trns[u].push_back({-1, cls.back().sec});
# | 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... |