# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
723113 | dxz05 | Stranded Far From Home (BOI22_island) | C++17 | 516 ms | 38992 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;
#define all(x) (x).begin(), (x).end()
#define MP make_pair
const int N = 200500;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int n;
int s[N];
bool can[N];
struct dsu{
vector<int> p;
vector<long long> sum;
vector<set<int>> children;
dsu(){
p.resize(n);
iota(all(p), 0);
sum.resize(n);
for (int i = 0; i < n; i++) sum[i] = s[i];
children.resize(n);
for (int i = 0; i < n; i++){
children[i].insert(i);
# | 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... |