# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
837533 | 2023-08-25T11:59:35 Z | EntityPlantt | Planine (COCI21_planine) | C++14 | 223 ms | 8084 KB |
#include <cstdio> #include <algorithm> using namespace std; int n, h, i, c; #define st second #define en first pair <double, double> inte[500005]; double x1, y1, x2, y2, x3, y3, l; 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 (!i || l < inte[i].st) { l = inte[i].en; c++; } } printf("%d", c); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 340 KB | Output is correct |
2 | Correct | 2 ms | 340 KB | Output is correct |
3 | Correct | 2 ms | 340 KB | Output is correct |
4 | Correct | 20 ms | 980 KB | Output is correct |
5 | Correct | 27 ms | 980 KB | Output is correct |
6 | Correct | 22 ms | 1020 KB | Output is correct |
7 | Correct | 210 ms | 7968 KB | Output is correct |
8 | Correct | 221 ms | 8084 KB | Output is correct |
9 | Correct | 223 ms | 8012 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 1 ms | 336 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 340 KB | Output is correct |
2 | Correct | 2 ms | 340 KB | Output is correct |
3 | Correct | 2 ms | 340 KB | Output is correct |
4 | Correct | 20 ms | 980 KB | Output is correct |
5 | Correct | 27 ms | 980 KB | Output is correct |
6 | Correct | 22 ms | 1020 KB | Output is correct |
7 | Correct | 210 ms | 7968 KB | Output is correct |
8 | Correct | 221 ms | 8084 KB | Output is correct |
9 | Correct | 223 ms | 8012 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Incorrect | 1 ms | 336 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |