oj.uz

Submission #837525

# Submission time Handle Problem Language Result Execution time Memory
837525 2023-08-25T11:48:15 Z EntityPlantt Planine (COCI21_planine) C++14
20 / 110
 267 ms 21844 KB 
#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

Main.cpp: In function 'int main()':
Main.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d%d%lf%lf%lf%lf", &n, &h, &x3, &y3, &x3, &y3);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         scanf("%lf%lf%lf%lf", &x2, &y2, &x3, &y3);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 21 ms 2004 KB Output is correct
5 Correct 22 ms 2252 KB Output is correct
6 Correct 24 ms 2376 KB Output is correct
7 Correct 241 ms 18024 KB Output is correct
8 Correct 228 ms 20080 KB Output is correct
9 Correct 267 ms 21844 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 21 ms 2004 KB Output is correct
5 Correct 22 ms 2252 KB Output is correct
6 Correct 24 ms 2376 KB Output is correct
7 Correct 241 ms 18024 KB Output is correct
8 Correct 228 ms 20080 KB Output is correct
9 Correct 267 ms 21844 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -