# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
837599 | 2023-08-25T12:39:07 Z | EntityPlantt | Planine (COCI21_planine) | C++17 | 2 ms | 340 KB |
#include <cstdio> #include <algorithm> using namespace std; typedef long long ll; struct frac { ll x, y; bool operator<(const frac &f) const { if (y * f.y < 0) return x * f.y > y * f.x; return x * f.y < y * f.x; } } l; int n, h, i, c = 1, x1, y1, x2, y2, x3, y3; pair <frac, frac> inte[500005]; int main() { scanf("%d%d%d%d%d%d", &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("%d%d%d%d", &x2, &y2, &x3, &y3); inte[i].first = {x1 * (y1 - y2) + (h - y1) * (x1 - x2), y1 - y2}; inte[i].second = {x2 * (y2 - y3) + (h - y2) * (x2 - x3), y2 - y3}; } sort(inte, inte + n); l = inte[0].second; for (i = 1; i < n; i++) { if (l < inte[i].first) { l = inte[i].second; 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 | - |