結果

問題 No.705 ゴミ拾い Hard
ユーザー mcfx0mcfx0
提出日時 2019-07-05 01:55:22
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 159 ms / 1,500 ms
コード長 3,964 bytes
コンパイル時間 2,222 ms
コンパイル使用メモリ 162,868 KB
実行使用メモリ 9,344 KB
最終ジャッジ日時 2024-09-19 10:51:14
合計ジャッジ時間 6,232 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 3 ms
5,376 KB
testcase_15 AC 3 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 3 ms
5,376 KB
testcase_22 AC 3 ms
5,376 KB
testcase_23 AC 3 ms
5,376 KB
testcase_24 AC 142 ms
9,204 KB
testcase_25 AC 105 ms
9,168 KB
testcase_26 AC 100 ms
9,216 KB
testcase_27 AC 97 ms
9,260 KB
testcase_28 AC 97 ms
9,184 KB
testcase_29 AC 109 ms
9,316 KB
testcase_30 AC 154 ms
9,088 KB
testcase_31 AC 107 ms
9,088 KB
testcase_32 AC 97 ms
9,216 KB
testcase_33 AC 75 ms
9,196 KB
testcase_34 AC 76 ms
9,236 KB
testcase_35 AC 84 ms
9,184 KB
testcase_36 AC 92 ms
9,344 KB
testcase_37 AC 79 ms
9,160 KB
testcase_38 AC 92 ms
9,216 KB
testcase_39 AC 159 ms
9,208 KB
testcase_40 AC 2 ms
5,376 KB
testcase_41 AC 2 ms
5,376 KB
testcase_42 AC 2 ms
5,376 KB
testcase_43 AC 94 ms
9,260 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void solve(int, int, int, int)’:
main.cpp:76:23: warning: ‘bp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   76 |         if(l<mid)solve(l,mid-1,ql,bp);
      |                  ~~~~~^~~~~~~~~~~~~~~
main.cpp:77:23: warning: ‘bp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |         if(mid<r)solve(mid+1,r,bp,qr);
      |                  ~~~~~^~~~~~~~~~~~~~~
main.cpp:72:26: warning: ‘bp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |         int mid=(l+r)>>1,bp;
      |                          ^~
main.cpp:77:23: warning: ‘bp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |         if(mid<r)solve(mid+1,r,bp,qr);
      |                  ~~~~~^~~~~~~~~~~~~~~
main.cpp:77:23: warning: ‘bp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |         if(mid<r)solve(mid+1,r,bp,qr);
      |                  ~~~~~^~~~~~~~~~~~~~~
main.cpp:72:26: warning: ‘bp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |         int mid=(l+r)>>1,bp;
      |                          ^~
main.cpp:72:26: warning: ‘bp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
main.cpp: In function ‘void work(int, int)’:
main.cpp:77:23: warning: ‘bp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |         if(mid<r)solve(mid+1,r,bp,qr);
      |                  ~~~~~^~~~~~~~~~~~~~~
main.cpp:72:26: note: ‘bp’ was declared here
   72 |         int mid=(l+r)>>1,bp;
      |                          ^~
main.cpp:77:23: warning: ‘bp’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |         if(mid<r)solve(mid+1,r,bp,qr);
      |                  ~~~~~^~~~~~~~~~~~~~~
main.cpp:72:26: note: ‘bp’ was declared here
   72 |         int mid=(l+r)>>1,bp;
      |                          ^~
main.cpp:72:26: warning: ‘bp’

ソースコード

diff # 

#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I __attribute__((always_inline))inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof((x).end())i=(x).begin();i!=(x).end();++i)
#define fre(i,x)for(__typeof((x).rend())i=(x).rbegin();i!=(x).rend();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define UC unsigned char
#define RX x=0;UC t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;UC t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int&x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char&x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char*x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf&x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf&x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint&x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull&x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){UC s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char*x){while(*x)P(*x++);RT}
I Fw&OP()(const char*x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=300007;

int n,s[N],x[N],y[N];
ll f[N];

inline ll cal(int l,int r)
{
	int a=abs(s[r]-x[l]),b=y[l];
	return (ll)a*a*a+(ll)b*b*b;
}

inline void solve(int l,int r,int ql,int qr)
{
	int mid=(l+r)>>1,bp;
	ll best=1e18;
	fo(i,ql,min(mid-1,qr))if(repl(best,f[i]+cal(i+1,mid)))bp=i;
	repl(f[mid],best);
	if(l<mid)solve(l,mid-1,ql,bp);
	if(mid<r)solve(mid+1,r,bp,qr);
}

inline void work(int l,int r)
{
	if(l==r)
	{
		repl(f[l],f[l-1]+cal(l,l));
		return;
	}
	int mid=(l+r)>>1;
	work(l,mid);
	solve(mid+1,r,l-1,mid);
	work(mid+1,r);
}

int main()
{
	in,n;
	fo1(i,n)in,s[i];
	fo1(i,n)in,x[i];
	fo1(i,n)in,y[i];
	fo1(i,n)f[i]=1e18;
	work(1,n);
	out,f[n],'\n';
}
0