# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
486034 | chungdinh | Graph (BOI20_graph) | C++17 | 242 ms | 23480 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 <iostream>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define ii pair<int, int>
#define MP make_pair
const int N = 5e5 + 5;
const int iINF = 1e9;
const double dINF = 10000;
int n, m;
vector<ii> g[N];
int vsd[N];
ii z[N];
double res[N];
double subsub(const ii& a, const ii& b) {
if (a.first == b.first) {
if (a.second == b.second) return dINF;
else return -dINF;
}
return (double)(b.second - a.second) / (a.first - b.first);
}
# | 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... |