Submission #932619

#TimeUsernameProblemLanguageResultExecution timeMemory
932619vjudge1SIR (COI15_sir)C++17
100 / 100
310 ms32276 KiB
#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)); } signed main(){ cin>>n; for(int i=0;i<n;i++) cin>>a[i].x>>a[i].y; reverse(a,a+n); 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
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...