oj.uz

Submission #539148

# Submission time Handle Problem Language Result Execution time Memory
539148 2022-03-18T13:37:37 Z joelau Planine (COCI21_planine) C++14
20 / 110
 336 ms 32536 KB 
#include <bits/stdc++.h>
using namespace std;
 
long long N,H;
pair<long long,long long> A[1000005];
vector< pair<long double,long double> > lst;
vector<long long> v;
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> N >> H;
    for (long long i = 0; i < N; ++i) cin >> A[i].first >> A[i].second;
    for (long long i = 2; i < N-1; i += 2) {
        while (v.size() >= 2 && (A[i-1].second - A[v[v.size()-2]].second) * (A[i-1].first - A[v.back()].first) <= (A[i-1].second - A[v.back()].second) * (A[i-1].first - A[v[v.size()-1]].first))
            v.pop_back();
        v.push_back(i-1);
        long long low = 0, high = v.size();
        while (high - low > 1) {
            long long mid = (low+high)/2;
            if ((A[i].second - A[v[mid-1]].second) * (A[i].first - A[v[mid]].first) <= (A[i].second - A[v[mid]].second) * (A[i].first - A[v[mid-1]].first)) high = mid;
            else low = mid;
        }
        lst.emplace_back(0,A[i].first - (long double) (A[i].first - A[v[low]].first) * (H - A[i].second) / (A[v[low]].second - A[i].second));
    }
    v.clear();
    for (long long i = N-3; i > 0; i -= 2) {
        while (v.size() >= 2 && (A[i+1].second - A[v[v.size()-2]].second) * (A[i+1].first - A[v.back()].first) >= (A[i+1].second - A[v.back()].second) * (A[i+1].first - A[v[v.size()-2]].first))
            v.pop_back();
        v.push_back(i+1);
        long long low = 0, high = v.size();
        while (high - low > 1) {
            long long mid = (low+high)/2;
            if ((A[i].second - A[v[mid-1]].second) * (A[i].first - A[v[mid]].first) >= (A[i].second - A[v[mid]].second) * (A[i].first - A[v[mid-1]].first)) high = mid;
            else low = mid;
        }
        lst[i/2-1].first = A[i].first + (long double) (A[v[low]].first - A[i].first) * (H - A[i].second) / (A[v[low]].second - A[i].second);
    }
    sort(lst.begin(),lst.end());
    long long ans = 0;
    long double n = -1e18;
    for (auto x: lst) if (n < x.second) ans++, n = x.first;
    cout << ans;
 
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 3 ms 852 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 28 ms 4004 KB Output is correct
5 Correct 27 ms 4008 KB Output is correct
6 Correct 36 ms 4052 KB Output is correct
7 Correct 278 ms 32432 KB Output is correct
8 Correct 324 ms 32536 KB Output is correct
9 Correct 336 ms 32532 KB Output is correct

Subtask #2
0 / 30.0

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

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 3 ms 852 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 28 ms 4004 KB Output is correct
5 Correct 27 ms 4008 KB Output is correct
6 Correct 36 ms 4052 KB Output is correct
7 Correct 278 ms 32432 KB Output is correct
8 Correct 324 ms 32536 KB Output is correct
9 Correct 336 ms 32532 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -