oj.uz

답안 #373042

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
373042 2021-03-03T06:48:25 Z sam571128 Planine (COCI21_planine) C++17
0 / 110
 3 ms 880 KB 
#include <bits/stdc++.h>

#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 1e6+5;
const double EPS = 1e-7;
pair<double,double> seg[N];
int st[N], id[N];
int n, h;
double findp(int x1, int y1, int x2, int y2){
	assert(y1!=y2);
	return 1.0*(h-y1)*(x2-x1)/(y2-y1)+x1;
}

signed main(){
	fastio
	cin >> n >> h;
	vector<pair<double,double>> v(1);
	for(int i = 1;i <= n;i++){
		int x,y;
		cin >> x >> y;
		v.push_back({x,y});
	}
    for (int i = 1; i <= n; i+=2) {
        if(i!=1) seg[i/2].first = findp(v[i].first,v[i].second, v[i-1].first, v[i-1].second);
    }
    for (int i = n; i >= 1; i-=2) {
        if(i!=n) seg[i/2].second = findp(v[i].first,v[i].second, v[i+1].first, v[i+1].second);
    }
    sort(seg+1,seg+(n-2)/2,[&](pair<double,double> a, pair<double,double> b){
    	return a.second < b.second;
    });
    double tmp = seg[0].second;
    int ans = 1;

    for (int i = 0; i <= n / 2 - 1; ++i) {
        if (tmp >= seg[i].first)
            continue;
        tmp = seg[i].second;
        ++ans;
    }
    cout << ans << "\n";
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 752 KB Output is correct
2 Correct 3 ms 880 KB Output is correct
3 Incorrect 3 ms 880 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 752 KB Output is correct
2 Correct 3 ms 880 KB Output is correct
3 Incorrect 3 ms 880 KB Output isn't correct
4 Halted 0 ms 0 KB -