# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100338 | rkocharyan | Konj (COCI19_konj) | C++14 | 118 ms | 22976 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;
const int N = 2e5 + 7;
const int M = 307;
struct pt {
int x, y;
pt() {}
pt(int x, int y) : x(x), y(y) {}
};
struct line {
pt a, b;
line() {}
line(pt a, pt b) : a(a), b(b) {}
};
int n;
bool was[N];
bool vis[M][M];
vector <int> r[M][M];
vector <line> p;
vector <line> comp;
pt t;
void dfs(int v) {
if (was[v]) return;
was[v] = true;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |