oj.uz

답안 #577757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577757 2022-06-15T08:40:33 Z dorijanlendvaj Uplifting Excursion (BOI22_vault) C++14
20 / 100
 75 ms 1624 KB 
#include <bits/stdc++.h>
#define x first
#define y second
#define pii pair<int,int>
using namespace std;
using ll=long long;
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define eb emplace_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int n;
ll k,c0;
ll cl[N],cr[N];

struct maxqu
{
	queue<ll> q;
	deque<ll> d;
	void pop()
	{
		ll sto=q.front();
		q.pop();
		if (d.front()==sto) d.pop_front();
	}
	void push(ll x)
	{
		while (d.size() && d.back()<x) d.pop_back();
		d.pb(x);
		q.push(x);
	}
	ll get()
	{
		return d.front();
	}
};

struct minqu
{
	queue<ll> q;
	deque<ll> d;
	void pop()
	{
		ll sto=q.front();
		q.pop();
		if (d.front()==sto) d.pop_front();
	}
	void push(ll x)
	{
		while (d.size() && d.back()>x) d.pop_back();
		d.pb(x);
		q.push(x);
	}
	ll get()
	{
		return d.front();
	}
};

vl slidmax(vl v,int s)
{
	maxqu q;
	vl an;
	for (int i=0;i<(int)v.size();++i)
	{
		if (i>=s) q.pop();
		q.push(v[i]);
		an.pb(q.get());
	}
	return an;
}

vl slidmin(vl v,int s)
{
	minqu q;
	vl an;
	for (int i=0;i<(int)v.size();++i)
	{
		if (i>=s) q.pop();
		q.push(v[i]);
		an.pb(q.get());
	}
	return an;
}

vl dodma(vl cdp,int cn,int w)
{
	int s=cdp.size();
	vl no(s);
	for (int i=0;i<min(w,s);++i)
	{
		vl z;
		for (int j=0;j*w+i<s;++j) z.pb(cdp[j*w+i]-j);
		z=slidmax(z,cn+1);
		for (int j=0;j*w+i<s;++j) no[j*w+i]=z[j]+j;
	}
	return no;
}

vl dodmi(vl cdp,int cn,int w)
{
	int s=cdp.size();
	vl no(s);
	for (int i=0;i<min(w,s);++i)
	{
		vl z;
		for (int j=0;j*w+i<s;++j) z.pb(cdp[j*w+i]-j);
		z=slidmin(z,cn+1);
		for (int j=0;j*w+i<s;++j) no[j*w+i]=z[j]+j;
	}
	return no;
}

vl gen(vl c,ll l,ll r)
{
	if (r<0)
	{
		return vl(r-l+1,-LLINF);
	}
	int i=1;
	ll s=0,cc=0;
	vl dp(2*n*n+n,LLINF);
	dp[0]=0;
	while (1)
	{
		if (i<=n && c[i]*i+s<=r)
		{
			s+=c[i]*i;
			cc+=c[i];
			dp=dodmi(dp,min(c[i],MOD*1ll),i);
		}
		else
		{
			ll cn=(r-s+i-1)/i;
			if (i==n+1) cn=0;
			dp=dodmi(dp,cn,i);
			s+=cn*i;
			cc+=cn;
			vl dp1;
			for (ll x=l-n*n;x<=r;++x)
			{
				if (s>=x) dp1.pb(cc-dp[s-x]);
				else dp1.pb(-LLINF);
			}
			if (i<=n) dp1=dodma(dp1,min(c[i]-cn,MOD*1ll),i);
			for (int j=i+1;j<=n;++j) dp1=dodma(dp1,min(c[j],MOD*1ll),j);
			return vl(dp1.begin()+n*n,dp1.end());
		}
		++i;
	}
}

void pri(vl v)
{
	for (auto x: v) cout<<x<<' ';
	cout<<en;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>k;
	ll sl=0,sr=0;
	if (k<0)
	{
		k*=-1;
		for (int i=n;i>=1;--i) cin>>cr[i];
		cin>>c0;
		for (int i=1;i<=n;++i) cin>>cl[i];
	}
	else
	{
		for (int i=n;i>=1;--i) cin>>cl[i];
		cin>>c0;
		for (int i=1;i<=n;++i) cin>>cr[i];
	}
	for (int i=1;i<=n;++i) sl+=cl[i]*i,sr+=cr[i]*i;
	ll mal=min(sl,sr-k);
	ll mil=mal-n*n;
	ll mar=k+mal;
	ll mir=k+mil;
	vl r1=gen(vl(cl,cl+n+1),mil,mal),r2=gen(vl(cr,cr+n+1),mir,mar);
	/*cout<<mil<<' '<<mal<<' '<<mir<<' '<<mar<<en;
	pri(vl(cl,cl+n+1));
	pri(r1);
	pri(vl(cr,cr+n+1));
	pri(r2);*/
	ll ma=-LLINF;
	for (int i=0;i<=n*n;++i) ma=max(ma,r1[i]+r2[i]);
	if (ma>=0) cout<<ma+c0<<en;
	else cout<<"impossible\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 10 ms 676 KB Output is correct
7 Correct 10 ms 676 KB Output is correct
8 Correct 10 ms 616 KB Output is correct
9 Correct 10 ms 676 KB Output is correct
10 Correct 9 ms 676 KB Output is correct
11 Correct 10 ms 676 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 10 ms 676 KB Output is correct
7 Correct 10 ms 676 KB Output is correct
8 Correct 10 ms 616 KB Output is correct
9 Correct 10 ms 676 KB Output is correct
10 Correct 9 ms 676 KB Output is correct
11 Correct 10 ms 676 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 596 KB Output is correct
17 Correct 10 ms 676 KB Output is correct
18 Correct 10 ms 676 KB Output is correct
19 Correct 11 ms 676 KB Output is correct
20 Correct 10 ms 608 KB Output is correct
21 Correct 10 ms 676 KB Output is correct
22 Correct 10 ms 676 KB Output is correct
23 Correct 36 ms 1492 KB Output is correct
24 Correct 72 ms 1544 KB Output is correct
25 Correct 74 ms 1624 KB Output is correct
26 Correct 72 ms 1556 KB Output is correct
27 Correct 75 ms 1544 KB Output is correct
28 Correct 70 ms 1524 KB Output is correct
29 Correct 75 ms 1552 KB Output is correct

Subtask #3-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Runtime error 4 ms 724 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Runtime error 4 ms 724 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Runtime error 4 ms 724 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 10 ms 676 KB Output is correct
7 Correct 10 ms 676 KB Output is correct
8 Correct 10 ms 616 KB Output is correct
9 Correct 10 ms 676 KB Output is correct
10 Correct 9 ms 676 KB Output is correct
11 Correct 10 ms 676 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 3 ms 468 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Runtime error 4 ms 724 KB Execution killed with signal 11
17 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Runtime error 4 ms 724 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 10 ms 676 KB Output is correct
7 Correct 10 ms 676 KB Output is correct
8 Correct 10 ms 616 KB Output is correct
9 Correct 10 ms 676 KB Output is correct
10 Correct 9 ms 676 KB Output is correct
11 Correct 10 ms 676 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 596 KB Output is correct
17 Correct 10 ms 676 KB Output is correct
18 Correct 10 ms 676 KB Output is correct
19 Correct 11 ms 676 KB Output is correct
20 Correct 10 ms 608 KB Output is correct
21 Correct 10 ms 676 KB Output is correct
22 Correct 10 ms 676 KB Output is correct
23 Correct 36 ms 1492 KB Output is correct
24 Correct 72 ms 1544 KB Output is correct
25 Correct 74 ms 1624 KB Output is correct
26 Correct 72 ms 1556 KB Output is correct
27 Correct 75 ms 1544 KB Output is correct
28 Correct 70 ms 1524 KB Output is correct
29 Correct 75 ms 1552 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Runtime error 4 ms 724 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Runtime error 4 ms 724 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 10 ms 676 KB Output is correct
7 Correct 10 ms 676 KB Output is correct
8 Correct 10 ms 616 KB Output is correct
9 Correct 10 ms 676 KB Output is correct
10 Correct 9 ms 676 KB Output is correct
11 Correct 10 ms 676 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 5 ms 596 KB Output is correct
17 Correct 10 ms 676 KB Output is correct
18 Correct 10 ms 676 KB Output is correct
19 Correct 11 ms 676 KB Output is correct
20 Correct 10 ms 608 KB Output is correct
21 Correct 10 ms 676 KB Output is correct
22 Correct 10 ms 676 KB Output is correct
23 Correct 36 ms 1492 KB Output is correct
24 Correct 72 ms 1544 KB Output is correct
25 Correct 74 ms 1624 KB Output is correct
26 Correct 72 ms 1556 KB Output is correct
27 Correct 75 ms 1544 KB Output is correct
28 Correct 70 ms 1524 KB Output is correct
29 Correct 75 ms 1552 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 3 ms 468 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Runtime error 4 ms 724 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -