結果
| 問題 | No.703 ゴミ拾い Easy |
| ユーザー |
 smiken_61
|
| 提出日時 | 2019-02-27 16:23:12 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
AC
|
| 実行時間 | 213 ms / 1,500 ms |
| コード長 | 14,945 bytes |
| コンパイル時間 | 2,137 ms |
| コンパイル使用メモリ | 170,896 KB |
| 実行使用メモリ | 41,076 KB |
| 最終ジャッジ日時 | 2023-08-30 19:04:09 |
| 合計ジャッジ時間 | 7,965 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge11 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 3 ms
9,488 KB |
| testcase_01 | AC | 3 ms
9,492 KB |
| testcase_02 | AC | 3 ms
9,508 KB |
| testcase_03 | AC | 3 ms
9,692 KB |
| testcase_04 | AC | 3 ms
9,540 KB |
| testcase_05 | AC | 3 ms
9,532 KB |
| testcase_06 | AC | 3 ms
9,556 KB |
| testcase_07 | AC | 3 ms
9,528 KB |
| testcase_08 | AC | 3 ms
9,600 KB |
| testcase_09 | AC | 3 ms
9,484 KB |
| testcase_10 | AC | 2 ms
9,476 KB |
| testcase_11 | AC | 3 ms
9,468 KB |
| testcase_12 | AC | 3 ms
9,468 KB |
| testcase_13 | AC | 2 ms
9,556 KB |
| testcase_14 | AC | 4 ms
9,672 KB |
| testcase_15 | AC | 3 ms
9,660 KB |
| testcase_16 | AC | 4 ms
9,756 KB |
| testcase_17 | AC | 3 ms
9,732 KB |
| testcase_18 | AC | 3 ms
9,876 KB |
| testcase_19 | AC | 4 ms
9,660 KB |
| testcase_20 | AC | 4 ms
9,664 KB |
| testcase_21 | AC | 3 ms
9,656 KB |
| testcase_22 | AC | 3 ms
9,644 KB |
| testcase_23 | AC | 3 ms
9,668 KB |
| testcase_24 | AC | 210 ms
38,188 KB |
| testcase_25 | AC | 210 ms
39,456 KB |
| testcase_26 | AC | 212 ms
38,204 KB |
| testcase_27 | AC | 211 ms
39,368 KB |
| testcase_28 | AC | 211 ms
41,076 KB |
| testcase_29 | AC | 210 ms
39,596 KB |
| testcase_30 | AC | 209 ms
38,260 KB |
| testcase_31 | AC | 210 ms
38,716 KB |
| testcase_32 | AC | 210 ms
39,716 KB |
| testcase_33 | AC | 213 ms
40,492 KB |
| testcase_34 | AC | 93 ms
24,852 KB |
| testcase_35 | AC | 94 ms
26,084 KB |
| testcase_36 | AC | 95 ms
24,672 KB |
| testcase_37 | AC | 94 ms
25,912 KB |
| testcase_38 | AC | 91 ms
24,252 KB |
| testcase_39 | AC | 94 ms
26,260 KB |
| testcase_40 | AC | 96 ms
26,536 KB |
| testcase_41 | AC | 92 ms
25,412 KB |
| testcase_42 | AC | 92 ms
25,384 KB |
| testcase_43 | AC | 91 ms
24,372 KB |
| testcase_44 | AC | 3 ms
9,512 KB |
| testcase_45 | AC | 2 ms
9,700 KB |
| testcase_46 | AC | 108 ms
25,188 KB |
| testcase_47 | AC | 107 ms
26,936 KB |
| testcase_48 | AC | 4 ms
9,660 KB |
| testcase_49 | AC | 3 ms
9,652 KB |
ソースコード
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
using namespace std;
class pa3{
public:
int x;
int y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
int x;
int y,z,w;
pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
#define pl pair<int,pas>
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
pa operator+(const pa & l,const pa & r) {
return {l.first+r.first,l.second+r.second};
}
pa operator-(const pa & l,const pa & r) {
return {l.first-r.first,l.second-r.second};
}
int pr[1200010];
int inv[1200010];
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
wa%=warukazu;
if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
ll zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
double bekid(double w,int r){
if(r==0) return 1.0;
if(r==1) return w;
if(r%2) return bekid(w,r-1)*w;
double f=bekid(w,r/2);
return f*f;
}
int comb(int nn,int rr){
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<=ert;i++){
pr[i]=(pr[i-1]*i)%mod;
}
for(int i=0;i<=ert;i++) inv[i]=beki(pr[i],mod-2,mod);
}
// cin.tie(0);
// ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
struct convex_hull{
// 1
// 2 3
// 4 5 6 7
struct line{
int a;
int b;
};
/*
typedef struct node{
int l;
int r;
// 閉区間!!
int line_id;
node* l_c;
node* r_c;
}node;
*/
private:
public:
/*
node* new_node(int l,int r,int line_id){
node* v=new node();
v->l=l;
v->r=r;
v->line_id=line_id;
return v;
}
*/
int f(line s,int x){
return s.a*x+s.b;
}
// (1<<15)=32768
// 1<<16 = 65536
// 1<<17 = 131072
// 1<<18 = 262144
int inff=inf*2000000000ll*2ll;
int n;
int cor=1;
vector<line> lines;
vector<int> points;
vector<pa4> vec;
map<int,int> point_to_id;
void add_pos(int x){
points.pb(x);
}
void shoki(){
// cout<<inff<<endl;
sort(points.begin(), points.end());
points.erase(unique(points.begin(),points.end()),points.end());
n=points.size();
for(int i=0;i<n;i++){
point_to_id[points[i]]=i;
}
lines.pb({0,inff});
cor=1;
while(cor<=n)cor*=2;
while(points.size()<cor)points.pb(points.back()+1);
vec.resize(2*cor+3,{0,inff,inff,inff});
}
int getmin(int pos){
assert(point_to_id.count(pos));
int id=point_to_id[pos]+cor;
int ans=inff;
while(id){
ans=min(ans,f(lines[vec[id].x],pos));
id/=2;
}
return ans;
}
void add_line(int a,int b){// ax+b
// cout<<"line "<<a<<" "<<b<<endl;
int id=1;
int l=0;
int r=cor;
line new_line={a,b};
lines.pb(new_line);
int line_id=lines.size()-1;
while(1){
// 1:l
// 2:m=(l+r)/2
// 3:r-1
// p: current
// q: new
int m=(l+r)/2;
int p1=f(lines[line_id],points[l]);
int p2=f(lines[line_id],points[m]);
int p3=f(lines[line_id],points[r-1]);
if(p1>=vec[id].y && p3>=vec[id].w) break;
if(p1<=vec[id].y && p3<=vec[id].w){
vec[id]={line_id,p1,p2,p3};
break;
}
if(p2<=vec[id].z){
swap(vec[id].x,line_id);
swap(vec[id].y,p1);
swap(vec[id].z,p2);
swap(vec[id].w,p3);
}
if(id>=cor)break;
if(p1<=vec[id].y){
id=2*id;
r=m;
}
else if(p3<=vec[id].w){
id=2*id+1;
l=m;
}
else assert(0);
}
}
};
int dp[300020];
int a[300030];
int x[300030];
int y[300030];
convex_hull ss;
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=n;i++)cin>>x[i];
for(int i=1;i<=n;i++)cin>>y[i];
dp[0]=0;
for(int i=1;i<=n;i++){
// cin>>d[i];
ss.add_pos(a[i]);
}
ss.shoki();
for(int i=1;i<=n;i++){
int j=i;
ss.add_line(-2*x[j],y[j]*y[j]+x[j]*x[j]+dp[j-1]);
dp[i]=ss.getmin(a[i])+a[i]*a[i];
//cout<<dp[i]<<endl;
}
cout<<dp[n]<<endl;
return 0;
}