oj.uz

답안 #1070853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070853 2024-08-22T19:44:07 Z AdamGS Uplifting Excursion (BOI22_vault) C++17
5 / 100
 722 ms 9500 KB 
    #include<bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    #define rep(a, b) for(int a = 0; a < (b); ++a)
    #define st first
    #define nd second
    #define pb push_back
    #define all(a) a.begin(), a.end()
    const ll INF=1e18+7;
    const int LIM=3e5+7;
    ll dp[LIM], dp2[LIM], A[LIM], B[LIM];
    int main() {
    	ios_base::sync_with_stdio(0); cin.tie(0);
    	ll n, m;
    	cin >> n >> m;
    	rep(i, n) cin >> A[n-i];
    	rep(i, n+1) cin >> B[i];
    	ll ans=0;
    	rep(i, n+1) ans+=B[i];
    	rep(i, n+1) ans+=A[i];
    	rep(i, n+1) m+=A[i]*(ll)i;
    	rep(i, n+1) m-=B[i]*(ll)i;
    	if(m<0) {
    		m*=-1;
    		rep(i, n+1) swap(A[i], B[i]);
    	}
    	rep(i, LIM) dp[i]=INF;
    	dp[0]=0;
    	for(ll i=n; i; --i) {
    		if(m>=LIM/2) {
    			ll p=m-LIM/2;
    			p=(p+i-1)/i;
    			p=min(p, A[i]);
    			A[i]-=p;
    			dp[0]+=p;
    			m-=p*i;	
    		}
    	}
    	if(m>=LIM) {
    		cout << "impossible\n";
    		return 0;
    	}
    	rep(xd, 2) {
    		for(ll i=1; i<=n; ++i) {
    			vector<ll>V[i], l(i);
    			rep(j, LIM) {
    				ll p=j%i;
    				while(l[p]<V[p].size() && (j-V[p][l[p]])/i>A[i]) ++l[p];
    				while(V[p].size()>0 && dp[j]<=dp[V[p].back()]+(j-V[p].back())/i) {
    					V[p].pop_back();
    					l[p]=min(l[p], (ll)V[p].size());
    				}
    				dp2[j]=dp[j];
    				if(l[p]<V[p].size()) {
    					dp2[j]=min(dp2[j], dp[V[p][l[p]]]+(j-V[p][l[p]])/i);
    				}
    				V[p].pb(j);
    			}
    			rep(j, LIM) dp[j]=dp2[j];
    		}
    		rep(i, LIM/2) swap(dp[i], dp[LIM-i]);
    		rep(i, n) swap(A[i], B[i]);
    	}
    	if(dp[m]==INF) {
    		cout << "impossible\n";
    		return 0;
    	}
    	cout << ans-dp[m] << '\n';
    }

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:48:19: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         while(l[p]<V[p].size() && (j-V[p][l[p]])/i>A[i]) ++l[p];
vault.cpp:54:16: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         if(l[p]<V[p].size()) {

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 7512 KB Output is correct
2 Correct 19 ms 7512 KB Output is correct
3 Correct 8 ms 7516 KB Output is correct
4 Correct 66 ms 7516 KB Output is correct
5 Correct 1 ms 5468 KB Output is correct
6 Correct 339 ms 8004 KB Output is correct
7 Correct 325 ms 7744 KB Output is correct
8 Correct 347 ms 7816 KB Output is correct
9 Correct 341 ms 8052 KB Output is correct
10 Correct 258 ms 7516 KB Output is correct
11 Correct 254 ms 7516 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 7512 KB Output is correct
2 Correct 19 ms 7512 KB Output is correct
3 Correct 8 ms 7516 KB Output is correct
4 Correct 66 ms 7516 KB Output is correct
5 Correct 1 ms 5468 KB Output is correct
6 Correct 339 ms 8004 KB Output is correct
7 Correct 325 ms 7744 KB Output is correct
8 Correct 347 ms 7816 KB Output is correct
9 Correct 341 ms 8052 KB Output is correct
10 Correct 258 ms 7516 KB Output is correct
11 Correct 254 ms 7516 KB Output is correct
12 Correct 14 ms 7512 KB Output is correct
13 Correct 19 ms 7516 KB Output is correct
14 Correct 8 ms 7516 KB Output is correct
15 Correct 62 ms 7516 KB Output is correct
16 Correct 1 ms 5468 KB Output is correct
17 Correct 335 ms 7852 KB Output is correct
18 Correct 329 ms 7620 KB Output is correct
19 Correct 335 ms 7884 KB Output is correct
20 Correct 340 ms 8056 KB Output is correct
21 Correct 254 ms 7600 KB Output is correct
22 Correct 252 ms 7516 KB Output is correct
23 Correct 2 ms 5468 KB Output is correct
24 Correct 690 ms 9500 KB Output is correct
25 Correct 662 ms 8048 KB Output is correct
26 Incorrect 722 ms 9412 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 7512 KB Output is correct
2 Correct 195 ms 9160 KB Output is correct
3 Incorrect 172 ms 9364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 7512 KB Output is correct
2 Correct 195 ms 9160 KB Output is correct
3 Incorrect 172 ms 9364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 7512 KB Output is correct
2 Correct 195 ms 9160 KB Output is correct
3 Incorrect 172 ms 9364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 7512 KB Output is correct
2 Correct 19 ms 7512 KB Output is correct
3 Correct 8 ms 7516 KB Output is correct
4 Correct 66 ms 7516 KB Output is correct
5 Correct 1 ms 5468 KB Output is correct
6 Correct 339 ms 8004 KB Output is correct
7 Correct 325 ms 7744 KB Output is correct
8 Correct 347 ms 7816 KB Output is correct
9 Correct 341 ms 8052 KB Output is correct
10 Correct 258 ms 7516 KB Output is correct
11 Correct 254 ms 7516 KB Output is correct
12 Correct 65 ms 7512 KB Output is correct
13 Correct 195 ms 9160 KB Output is correct
14 Incorrect 172 ms 9364 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 7512 KB Output is correct
2 Correct 195 ms 9160 KB Output is correct
3 Incorrect 172 ms 9364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 7512 KB Output is correct
2 Correct 19 ms 7512 KB Output is correct
3 Correct 8 ms 7516 KB Output is correct
4 Correct 66 ms 7516 KB Output is correct
5 Correct 1 ms 5468 KB Output is correct
6 Correct 339 ms 8004 KB Output is correct
7 Correct 325 ms 7744 KB Output is correct
8 Correct 347 ms 7816 KB Output is correct
9 Correct 341 ms 8052 KB Output is correct
10 Correct 258 ms 7516 KB Output is correct
11 Correct 254 ms 7516 KB Output is correct
12 Correct 14 ms 7512 KB Output is correct
13 Correct 19 ms 7516 KB Output is correct
14 Correct 8 ms 7516 KB Output is correct
15 Correct 62 ms 7516 KB Output is correct
16 Correct 1 ms 5468 KB Output is correct
17 Correct 335 ms 7852 KB Output is correct
18 Correct 329 ms 7620 KB Output is correct
19 Correct 335 ms 7884 KB Output is correct
20 Correct 340 ms 8056 KB Output is correct
21 Correct 254 ms 7600 KB Output is correct
22 Correct 252 ms 7516 KB Output is correct
23 Correct 2 ms 5468 KB Output is correct
24 Correct 690 ms 9500 KB Output is correct
25 Correct 662 ms 8048 KB Output is correct
26 Incorrect 722 ms 9412 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 7512 KB Output is correct
2 Correct 195 ms 9160 KB Output is correct
3 Incorrect 172 ms 9364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 7512 KB Output is correct
2 Correct 19 ms 7512 KB Output is correct
3 Correct 8 ms 7516 KB Output is correct
4 Correct 66 ms 7516 KB Output is correct
5 Correct 1 ms 5468 KB Output is correct
6 Correct 339 ms 8004 KB Output is correct
7 Correct 325 ms 7744 KB Output is correct
8 Correct 347 ms 7816 KB Output is correct
9 Correct 341 ms 8052 KB Output is correct
10 Correct 258 ms 7516 KB Output is correct
11 Correct 254 ms 7516 KB Output is correct
12 Correct 14 ms 7512 KB Output is correct
13 Correct 19 ms 7516 KB Output is correct
14 Correct 8 ms 7516 KB Output is correct
15 Correct 62 ms 7516 KB Output is correct
16 Correct 1 ms 5468 KB Output is correct
17 Correct 335 ms 7852 KB Output is correct
18 Correct 329 ms 7620 KB Output is correct
19 Correct 335 ms 7884 KB Output is correct
20 Correct 340 ms 8056 KB Output is correct
21 Correct 254 ms 7600 KB Output is correct
22 Correct 252 ms 7516 KB Output is correct
23 Correct 2 ms 5468 KB Output is correct
24 Correct 690 ms 9500 KB Output is correct
25 Correct 662 ms 8048 KB Output is correct
26 Incorrect 722 ms 9412 KB Output isn't correct
27 Halted 0 ms 0 KB -