# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43880 | ngkan146 | Svjetlost (COI18_svjetlost) | C++11 | 1282 ms | 42496 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;
int dsup[100005];
int dsu_p(int x){
return dsup[x] == x ? x : dsup[x] = dsu_p(dsup[x]);
}
void dsu_union(int x,int y){
x = dsu_p(x);
y = dsu_p(y);
dsup[y] = x;
}
struct point{
int x, y;
point(int x=0,int y=0): x(x), y(y) {}
point operator - (const point& v){
return {x - v.x, y - v.y};
}
};
double dist(point a,point b){
return sqrt(1.0 * (a.x - b.x) * (a.x - b.x) + 1.0 * (a.y - b.y) * (a.y - b.y));
}
int ccw(point a,point b){
long long val = 1ll * a.x * b.y - 1ll * a.y * b.x;
if (val > 0)
return 1;
if (val == 0)
return 0;
return -1;
}
struct segTreeMAX{
# | 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... |