Submission #588446

#TimeUsernameProblemLanguageResultExecution timeMemory
588446MilosMilutinovicPlanine (COCI21_planine)C++14
0 / 110
2 ms596 KiB
/** * author: wxhtzdy * created: 03.07.2022 11:30:53 **/ #include <bits/stdc++.h> using namespace std; typedef double ldb; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, h; cin >> n >> h; vector<int> x(n), y(n); for (int i = 0; i < n; i++) { cin >> x[i] >> y[i]; } vector<pair<ldb, ldb>> ev; for (int i = 2; i < n - 1; i += 2) { ldb L = (ldb) x[i] + (ldb) h * (((ldb) x[i - 1] - x[i] + 0.00) / (ldb) (y[i - 1] - y[i] + 0.00)); ldb R = (ldb) x[i] + (ldb) h * (((ldb) x[i + 1] - x[i] + 0.00) / (ldb) (y[i + 1] - y[i] + 0.00)); ev.emplace_back(L, R); } sort(ev.begin(), ev.end()); int ans = 0; ldb ptr = -1e20; for (auto& p : ev) { if (ptr < p.first) { ptr = p.second; ans += 1; } else { ptr = min(ptr, p.second); } } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...