# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1142184 | LucaLucaM | Port Facility (JOI17_port_facility) | C++17 | 22 ms | 47168 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
// acm doar trb sa dau lock in si sa bag jmenu lui voicu
// daca e raspunsu 0 e jover :sob: :pray:
using ll = long long;
#define debug(x) #x << " = " << x << '\n'
const int NMAX = 1e6;
const int mod = 1e9 + 7;
std::vector<int> sweep[2 * NMAX + 1];
struct Container {
int x, y;
bool operator < (const Container &other) const {
return x != other.x? x < other.x : y < other.y;
};
};
Container a[NMAX + 1];
namespace DSU {
std::vector<int> p;
std::vector<int> color;
void init(int n) {
p.resize(n + 1);
color.resize(n + 1, 0);
# | 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... |