# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
837519 | 2023-08-25T11:43:23 Z | EntityPlantt | Planine (COCI21_planine) | C++14 | 2 ms | 340 KB |
#include <cstdio> #include <algorithm> using namespace std; int n, h, i, c = 0; #define st first #define en second 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |