제출 #1174349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1174349		paskalisapo	Mobile (BOI12_mobile)	C++20	0 / 100	551 ms	24624 KiB

mobile

#include<bits/stdc++.h>
using namespace std;
using dd = double;

struct trans {
    dd x , y;
    dd change;
};

dd change(dd x1, dd y1, dd x2, dd y2) {
    dd up = x2 * x2 + y2 * y2 - x1 * x1 - y1 * y1;
    dd down = 2 * (x2 - x1);
    return dd(up / down);
}

int main() {
    int n;
    dd l;
    cin >> n >> l;

    stack<trans>s;
    dd x ,y;
    cin >> x >> y;
    dd maxdist = (sqrt(x * x + y * y));
    s.push({x , y , 0});



    for(int i = 1 ;i < n ;i++) {
        cin >> x >> y;
        if(fabs(x - s.top().x) < 1e-6) {
            continue;
        }
        dd xchange = 0;
        while(!s.empty()) {
            dd x2 = s.top().x;
            dd y2 = s.top().y;
            xchange = change(x , y , x2 ,y2);

            if(xchange < s.top().change) {
                s.pop();
            }    
            else {
                break;
            }
        }
        s.push({x , y , xchange});
    }

    while(s.top().change > l) {
        s.pop();
    }
    while(s.top().change > 0) {
        x = s.top().x;
        y = s.top().y;
        dd xchange = s.top().change;
        maxdist = max(maxdist,sqrt((x - xchange) * (x - xchange) + (y * y)));
        s.pop();
    }
    while(s.size() > 1) {
        s.pop();
    }
    x = s.top().x;
    y = s.top().y;
    maxdist = max(maxdist, sqrt(x * x + y * y));

    printf("%.6f\n", maxdist);

}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5