This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define INF 1023456789
typedef long long ll;
typedef long double ld;
struct frac{
ll a,b;
};
typedef pair<frac,frac> ii;
int n,h,x[1000005],y[1000005];
vector<ii> v;
int main(){
sf("%d%d",&n,&h);
for(int i=1;i<=n;++i)sf("%d%d",&x[i],&y[i]);
for(int i=3;i<n;i+=2){
int x1=x[i-1],x2=x[i],y1=y[i-1],y2=y[i];
frac a={(ll)h*(x2-x1)-y1*x2+x1*y2,y2-y1};
if(a.b<0)a.a=-a.a,a.b=-a.b;
x1=x[i],x2=x[i+1],y1=y[i],y2=y[i+1];
frac b={(ll)h*(x2-x1)-y1*x2+x1*y2,y2-y1};
if(b.b<0)b.a=-b.a,b.b=-b.b;
v.pb({a,b});
}
sort(all(v),[](ii &a,ii &b){return (ld)a.se.a/a.se.b<(ld)b.se.a*b.se.b;});
int ans=0;frac pv=v[0].fi;
pv.a-=1;
for(int i=0;i<sz(v);++i){
if((ld)pv.a*pv.b<(ld)v[i].fi.a/v[i].fi.b){
++ans;
pv=v[i].se;
}
}
pf("%d\n",ans);
}
Compilation message (stderr)
Main.cpp: In function 'int main()':
Main.cpp:25:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
25 | sf("%d%d",&n,&h);
| ^
Main.cpp:26:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
26 | for(int i=1;i<=n;++i)sf("%d%d",&x[i],&y[i]);
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |