# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1141313 | LucaLucaM | Port Facility (JOI17_port_facility) | C++17 | 6095 ms | 40260 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
// Mihai Voicu Valeriu e rege
using ll = long long;
#define debug(x) #x << " = " << x << '\n'
const int NMAX = 1e6;
const int mod = 1e9 + 7;
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];
std::vector<int> g[NMAX + 1];
bool vis[NMAX + 1];
int color[NMAX + 1];
bool bad = false;
void dfs(int u) {
vis[u] = true;
for (const auto &v : g[u]) {
if (!vis[v]) {
# | 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... |