# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
837525 | EntityPlantt | Planine (COCI21_planine) | C++14 | 267 ms | 21844 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 <cstdio>
#include <algorithm>
using namespace std;
int n, h, i, c = 0;
#define st second
#define en first
pair <double, double> inte[500005];
double x1, y1, x2, y2, x3, y3, l = -1e9;
int main() {
scanf("%d%d%lf%lf%lf%lf", &n, &h, &x3, &y3, &x3, &y3);
if (n == 3) {
printf("0");
return 0;
}
n = n / 2 - 1;
for (i = 0; i < n; i++) {
x1 = x3; y1 = y3;
scanf("%lf%lf%lf%lf", &x2, &y2, &x3, &y3);
inte[i].st = x1 + (h - y1) * (x1 - x2) / (y1 - y2);
inte[i].en = x2 + (h - y2) * (x2 - x3) / (y2 - y3);
}
sort(inte, inte + n);
for (i = 0; i < n; i++) {
if (l + 1e-10 < inte[i].st) {
l = inte[i].en;
c++;
}
}
printf("%d", c);
return 0;
}
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... |