oj.uz

Submission #932593

# Submission time Handle Problem Language Result Execution time Memory
932593 2024-02-23T19:43:39 Z tminh_hk20 SIR (COI15_sir) C++14
0 / 100
 314 ms 24588 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
const int N=6e5+5;

struct vec{
    int x, y;
}a[N+10], b[N+10];

vec operator - (vec a, vec b){
    return {a.x-b.x,a.y-b.y};
}

bool operator < (vec a, vec b){
    if (a.x==b.x) return a.y<b.y;
    return a.x<b.x;
}

int cross(vec a, vec b){
    return a.x*b.y-b.x*a.y;
}

int n, m, c, s[N+10];
vector<vec> v;

void convexhull(){
    sort(b+1,b+m+1);

    //upper
    v.push_back(b[1]);
    for (int i=2;i<=m;i++){
        while(v.size()>=2 && cross(b[i]-v[v.size()-1],v[v.size()-2]-v[v.size()-1])>0) v.pop_back();
        v.push_back(b[i]);
    }

    // lower
    for (int i=m-1;i>=1;i--){
        while(v.size()>=2 && cross(b[i]-v[v.size()-1],v[v.size()-2]-v[v.size()-1])>0) v.pop_back();
        v.push_back(b[i]);
    }

    if (v.size()>1) v.pop_back();
}


int get(vec a, vec b, vec c){
    if(a.x==b.x&&a.y==b.y)  return 0;
	return abs(a.x*(b.y-c.y)+b.x*(c.y-a.y)+c.x*(a.y-b.y));
}
vec luu[N];
signed main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>luu[i].x>>luu[i].y;
    }
        reverse(a,a+n);
//    for (int i=0;i<n;i++) cout <<">"<< a[i].x<<" "<<a[i].y<<endl;
    for (int i=1;i<=n;i++) a[n-1+i] = a[i-1];

    cin>>m;
    for(int i=1;i<=m;i++) cin>>b[i].x>>b[i].y;
    convexhull();

    int j =0; c = v.size();
    for (int i=0;i<c;i++){
        if (cross(v[j]-a[0],v[i]-a[0])<=0){
            j = i;
        }
    }

    int res = 0;
    int far = 1;
    int tmp = 0;
    for (int i=0;i<n;i++){
        while(!(cross(v[j]-a[i],v[(j+1)%c]-a[i])<=0)){
            j++; j%=c;
        }
        while(cross(a[far+1]-a[i],v[j]-a[i])<0) tmp+=get(a[i],a[far],a[far+1]), far++;
        res = max(res, tmp);
//        cout <<i<<" "<<j<<" "<<far<<endl;
        tmp-=get(a[i],a[i+1],a[far]);
    }

    cout <<res<<endl;
}

//>1 4
//>2 4
//>3 0
//>4 1
//>5 3

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Incorrect 314 ms 24588 KB Output isn't correct
2 Halted 0 ms 0 KB -