# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68891 | ainta | Printed Circuit Board (CEOI12_circuit) | C++17 | 160 ms | 31132 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<stdio.h>
#include<algorithm>
using namespace std;
struct point {
long long x, y;
int c;
bool operator <(const point &p)const {
return x*p.y != y*p.x ? x*p.y<y*p.x : x<p.x;
}
}w[200001];
struct point2 {
int x, y;
}P[200001];
struct vector2 {
double x, y;
int c;
}w2[200001], t1, t2, t3;
double X1, X2, Y1, Y2, tt;
int r[400001], N, i, c, sz, IT2[600001];
bool v[400001];
double IT[600001], INF = 1e9;
double F(double x, double y) {
tt = (Y2*x - X2*y) / ((X1 - X2)*y - (Y1 - Y2)*x);
return Y1*tt + Y2*(1 - tt);
}
bool ccw() {
return (t2.x - t1.x)*(t3.y - t1.y) - (t2.y - t1.y)*(t3.x - t1.x)<0;
}
void Do(int b, int e, int k) {
int s = b - sz, l = e - sz, t = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |