oj.uz

답안 #1044179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044179 2024-08-05T07:53:08 Z vjudge1 Svjetlost (COI18_svjetlost) C++17
0 / 100
 929 ms 1056 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long double
#define point pair<int,int>
#define x first
#define y second
int const pi=3.141592653589793;
int const oe=180;

int angle(point p1,point p2){
    int deltaY = p2.y - p1.y;
    int deltaX = p2.x - p1.x;
    int dg = (atan2(deltaY, deltaX) * oe) / pi;
    if(dg<0)
        dg+=360;
    return dg;
}

bool check(int a1,int a2){
    if(a1<=180)
        return (a2<a1) || (a2>a1+oe);
    else
        return (a2>a1-oe && a2<a1);
}
int dist(point a,point b){
    return sqrt(((a.x-b.x)*(a.x-b.x))+((a.y-b.y)*(a.y-b.y)));
}

int solve(vector<point> pts){
    int n=pts.size();
    if(n==1)
        return 0;
    else if(n==2)
        return dist(pts[0],pts[1]);
    for (int i = 0; i < n; ++i){
        pts.push_back(pts[i]);
    }
    int len=dist(pts[0],pts[1])+dist(pts[1],pts[2]);
    int maxx=len;
    int p1=0,p2=2;
    int a=0,b=2;
    while(p1<n){
        int a1=angle(pts[p1],pts[p1+1]);
        int a2=angle(pts[p2+1],pts[p2]);
        // cout<<a1<<' '<<a2<<endl;
        if(p2+1<p1+n && a1!=a2 && check(a1,a2)){
            len+=dist(pts[p2],pts[p2+1]);
            p2+=1;
        }
        else{
            len-=dist(pts[p1],pts[p1+1]);
            p1+=1;
        }
        if(len>maxx){
            maxx=len;
            a=p1,b=p2;
        }
        // maxx=max(maxx,len);
    }
    cout<<a<<' '<<b<<endl;
    return maxx;
}

signed main(){
    int n;
    cin>>n;
    vector<point> pts(n);
    for (int i = 0; i < n; ++i)
        cin>>pts[i].x>>pts[i].y;
    cout<<fixed;
    cout<<setprecision(10)<<solve(pts)<<endl;;
    int q;
    cin>>q;
    vector<bool> del(n,0);
    while(q--){
        int d;
        cin>>d;
        del[d-1]=1;
        vector<point> p;
        for (int i = 0; i < n; ++i)
            if(del[i]==0)
                p.push_back(pts[i]);
        cout<<solve(p)<<endl;
    }
    return 0;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st numbers differ - expected: '34724.8554753593', found: '11.0000000000', error = '0.9996832240'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st numbers differ - expected: '34724.8554753593', found: '11.0000000000', error = '0.9996832240'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st numbers differ - expected: '32934.3604541195', found: '73.0000000000', error = '0.9977834699'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 929 ms 1056 KB 1st numbers differ - expected: '1042655967.3918291330', found: '883.0000000000', error = '0.9999991531'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB 1st numbers differ - expected: '34724.8554753593', found: '11.0000000000', error = '0.9996832240'
2 Halted 0 ms 0 KB -