# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967286 | mdobric | Svjetlost (COI18_svjetlost) | C++11 | 3037 ms | 2908 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 maxn = 1e5 + 5;
int n, q;
long long a[maxn], b[maxn];
long long max_poc, max_kraj, max_smjer = 0;
double max_d;
int bio[maxn];
vector <int> dobri;
vector <double> ans;
int bio1[maxn], bio2[maxn];
double calc (int x, int y){
y = (y + n) % n;
double prvi = abs(a[x] - a[y]) * abs(a[x] - a[y]), drugi = abs(b[x] - b[y]) * abs(b[x] - b[y]);
return sqrt(prvi + drugi);
}
long long ccw (long long a1, long long b1, long long a2, long long b2, long long a3, long long b3){
return a1 * (b2 - b3) + a2 * (b3 - b1) + a3 * (b1 - b2);
}
int iduci (int tr){
if (bio1[tr] != -1){
return bio1[tr];
}
int tr2 = tr;
tr++;
Compilation message (stderr)
# | 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... |