# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21302 | Ushio | Port Facility (JOI17_port_facility) | C++14 | 1676 ms | 143104 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 <algorithm>
#include <iostream>
#include <cassert>
#include <vector>
#include <set>
#include <queue>
#define SZ(x) ((int) (x).size())
using namespace std;
typedef long long i64;
const int MOD = (int) 1e9 + 7;
struct Segment {
int l, r;
Segment() = default;
Segment(int _l, int _r):
l(_l), r(_r) {}
};
class DSU {
public:
DSU(int n): f(vector<int>(n)) {
for (int i = 0; i < n; ++i) {
f[i] = i;
}
}
int& operator[](int x) {
int y, p;
for (y = x; y != f[y]; y = f[y]);
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... |