# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
242904 | MatesV13 | Svjetlost (COI18_svjetlost) | C++11 | 3031 ms | 6136 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;
long long n, q, V, x[100005], y[100005], prijasnji[100005];
void update(int vrh){
int minus=0;
for (int i=1; i<vrh; i++){
if (prijasnji[i]) minus++;
} prijasnji[vrh]++; vrh-=minus;
for (int i=vrh+1; i<=n; i++){
x[i-1]=x[i]; y[i-1]=y[i];
} return;
}
bool ok (int idx1, int idx2){
idx1 = (idx1+n-1)%n+1; idx2 = (idx2+n-1)%n+1;
long long dx1 = x[idx1] - x[idx1-1];
long long dy1 = y[idx1] - y[idx1-1];
long long dx2 = x[idx2] - x[idx2-1];
long long dy2 = y[idx2] - y[idx2-1];
// cout << dx1 << " " << dy1 << " " << dx2 << " " << dy2 << endl;
// cout << dx1*dy2 << " " << dx2*dy1 << endl;
return (dx1*dy2 > dx2*dy1);
}
long double leng(int idx){
idx = (idx+n-1)%n+1;
long long dx = x[idx] - x[idx-1];
long long dy = y[idx] - y[idx-1];
// cout << "duljina izmedu " << idx << " i " << idx-1 << " iznosi: " << sqrtl(dx*dx + dy*dy) << endl;
return sqrtl(dx*dx + dy*dy);
}
long double dp[200005];
# | 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... |