# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1110479 | _callmelucian | Stranded Far From Home (BOI22_island) | C++14 | 769 ms | 61464 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;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tt;
#define all(a) a.begin(), a.end()
#define filter(a) a.erase(unique(all(a)), a.end())
const int mn = 2e5 + 5;
int cost[mn], recur[mn], dp[mn];
vector<int> adj[mn], pos[mn];
struct customComp {
bool operator() (int a, int b) const {
return cost[a] < cost[b];
}
};
struct DSU {
vector<ll> lab, weight;
vector<set<int, customComp>> adjSet;
DSU (int sz) : lab(sz + 1), weight(sz + 1, 0), adjSet(sz + 1) {
for (int i = 1; i <= sz; i++)
adjSet[i] = set<int, customComp>(all(adj[i])), weight[i] = cost[i];
return;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |