oj.uz

Submission #950217

# Submission time Handle Problem Language Result Execution time Memory
950217 2024-03-20T06:58:08 Z Baytoro Planine (COCI21_planine) C++17
20 / 110
 527 ms 35016 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=1e6+5;
bool cmp(pair<double,double> a, pair<double,double> b){
	if(a.sc==b.sc) return a.fr<b.fr;
	return a.sc<b.sc;
}
int x[N],y[N];
double slope(int a, int b){
	return (y[b]-y[a])/(x[b]-x[a]+0.0);
}
int cross(pair<int,int> a, pair<int,int> b){
	return a.fr*b.sc-a.sc*b.fr;
}
int cross(int a, int b, int c){
	return cross(mp(x[b]-x[a],y[b]-y[a]),mp(x[c]-x[a],y[c]-y[a]));
}
void solve(){
	int n,h;cin>>n>>h;
	for(int i=0;i<n;i++)
		cin>>x[i]>>y[i];
	vector<double> l(n),r(n);
	vector< pair<double,double> > v;
	deque<int> st;
	st.pb(0);
	for(int i=1;i<n;i++){
		while(st.size()>1 && cross(st[st.size()-2],st.back(),i)>0)
			st.pop_back();
		if(i%2==0){
			l[i]=x[st.back()]+(h-y[st.back()])/slope(i,st.back());
		}
		
		st.push_back(i);
	}
	while(!st.empty()) st.pop_back();
	st.pb(n-1);
	for(int i=n-2;i>=0;i--){
		while(st.size()>1 && cross(st[st.size()-2],st.back(),i)<0)
			st.pop_back();
		if(i%2==0){
			r[i]=x[i]+(h-y[i])/slope(st.back(),i);
		}
		st.push_back(i);
	}
	for(int i=2;i<n-1;i+=2) v.pb(mp(l[i],r[i]));
	sort(all(v), cmp);
	int ans=1;
	double rx=v[0].sc;
	for(int i=1;i<v.size();i++){
		if(v[i].fr>rx+1e-9){
			rx=v[i].sc;
			ans++;
		}
	}
	//cout<<fixed<<setprecision(3);
	/*for(auto it: v)
		cout<<it.fr<<' '<<it.sc<<endl;*/
	cout<<ans;
}
int main(){
	solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:57:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<double, double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for(int i=1;i<v.size();i++){
      |              ~^~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2904 KB Output is correct
2 Correct 5 ms 2908 KB Output is correct
3 Correct 5 ms 2908 KB Output is correct
4 Correct 43 ms 9628 KB Output is correct
5 Correct 49 ms 9676 KB Output is correct
6 Correct 64 ms 9676 KB Output is correct
7 Correct 429 ms 34960 KB Output is correct
8 Correct 527 ms 35016 KB Output is correct
9 Correct 509 ms 34496 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 2 ms 2564 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 2 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2904 KB Output is correct
2 Correct 5 ms 2908 KB Output is correct
3 Correct 5 ms 2908 KB Output is correct
4 Correct 43 ms 9628 KB Output is correct
5 Correct 49 ms 9676 KB Output is correct
6 Correct 64 ms 9676 KB Output is correct
7 Correct 429 ms 34960 KB Output is correct
8 Correct 527 ms 35016 KB Output is correct
9 Correct 509 ms 34496 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2564 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Incorrect 2 ms 2396 KB Output isn't correct
16 Halted 0 ms 0 KB -