# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950101 | 2024-03-20T05:22:59 Z | vjudge1 | Planine (COCI21_planine) | C++17 | 4 ms | 860 KB |
#include <bits/stdc++.h> using namespace std; #define ios ios::sync_with_stdio(false); cin.tie(NULL); #define pb push_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define fr first #define sc second #define mp make_pair #define ll long long const ll INF=1e18,N=2e5+5; void solve(){ 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<double> l(n),r(n); vector< pair<double,double> > v; stack<int> st; for(int i=2;i<n-1;i+=2){ double slope=(y[i+1]-y[i])/(x[i+1]-x[i]+0.0); r[i]=x[i]+h/slope; slope = (y[i]-y[i-1])/(x[i]-x[i-1]+0.0); l[i]=x[i]+h/slope; v.pb(mp(l[i],r[i])); } sort(all(v)); int ans=1; double lx=v[0].fr,rx=v[0].sc; for(int i=1;i<v.size();i++){ if(v[i].fr>=lx && v[i].fr<=rx){ lx=v[i].fr; rx=min(rx,v[i].sc); continue; } ans++; lx=v[i].fr; rx=v[i].sc; } /*cout<<fixed<<setprecision(3); for(int i=0;i<n;i++) cout<<l[i]<<' '<<r[i]<<endl;*/ cout<<ans; } int main(){ solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 860 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 344 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 860 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |