oj.uz

답안 #660435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
660435 2022-11-21T20:29:19 Z mychecksedad Uplifting Excursion (BOI22_vault) C++17
0 / 100
 166 ms 320 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, F = 2147483646, K = 20;

ll m, l, a[N], sum, ans, b[N][2]; // + and - parts
int dp[700]; 
void solve(){
    cin >> m >> l;
    for(int i = 0; i < 2*m+1; ++i) cin >> a[i];
    sum = ans = 0;
    for(int i = 0; i < 2*m+1; ++i) sum += a[i] * (i - m), ans += a[i], b[i][0] = 0, b[i][1] = a[i];
    if(sum == l){
        cout << ans;
        return;
    }
    ll c;
    if(sum > l){
        c = 2*m;
        while(sum > l && c >= 0){
            if(c==m){
                c--;
                continue;
            }
            if(sum - a[c] * (c - m) >= l) sum -= a[c] * (c - m), ans -= a[c], b[c][0] = a[c], b[c][1] = 0;
            else{
                ll num = (sum - l + (c - m) - 1) / (c - m);
                ans -= num;
                sum -= num * (c - m);

                b[c][0] = num;
                b[c][1] = a[c] - num;

                break;
            }
            c--;
        }
    }else{
        c = 0;
        while(sum < l && c <= 2*m){
            if(c==m){
                c++;
                continue;
            }
            if(sum - a[c] * (c - m) <= l) sum -= a[c] * (c - m), ans -= a[c], b[c][0] = a[c], b[c][1] = 0;
            else{
                ll num = (sum - l) / (c - m);
                ans -= num;
                sum -= num * (c - m);

                b[c][0] = num;
                b[c][1] = a[c] - num;

                break;
            }
            c++;
        }
    }
    if(sum > l){
        cout << "impossible";
        return;
    }
    ll M = 1000;
    int v = l - sum + M;
    for(int i = 0; i <= 2*M; ++i) dp[i] = MOD;
    dp[M] = 0;
    for(int i = 0; i <= 2*m; ++i){
        if(i==m) continue;
        for(int j = 0; j <= 2*M; ++j){
            for(int k = 0; k <= min(b[i][0], M); ++k){
                int val = j + k * (i - m);
                if(val >= 0 && val <= 2*m){
                    dp[val] = min(dp[val], dp[j] - k);
                }
            }
        }
        for(int j = 2*M; j >= 0; --j){
            for(int k = 0; k <= min(b[i][1], M); ++k){
                int val = j - k * (i - m);
                if(val >= 0 && val <= 2*m){
                    dp[val] = min(dp[val], dp[j] + k);
                }
            }
        }
    } 
    if(dp[v] == MOD) cout << "impossible";
    else cout << ans - dp[v];
}




int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

vault.cpp: In function 'int main()':
vault.cpp:106:16: warning: unused variable 'aa' [-Wunused-variable]
  106 |     int T = 1, aa;
      |                ^~
vault.cpp: In function 'void solve()':
vault.cpp:76:41: warning: iteration 700 invokes undefined behavior [-Waggressive-loop-optimizations]
   76 |     for(int i = 0; i <= 2*M; ++i) dp[i] = MOD;
      |                                         ^
vault.cpp:76:22: note: within this loop
   76 |     for(int i = 0; i <= 2*M; ++i) dp[i] = MOD;
      |                    ~~^~~~~~
vault.cpp:77:9: warning: array subscript 1000 is above array bounds of 'int [700]' [-Warray-bounds]
   77 |     dp[M] = 0;
      |     ~~~~^
vault.cpp:18:5: note: while referencing 'dp'
   18 | int dp[700];
      |     ^~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 212 KB Output is correct
2 Incorrect 166 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 212 KB Output is correct
2 Incorrect 166 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 212 KB Output is correct
2 Incorrect 166 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 212 KB Output is correct
2 Incorrect 166 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 212 KB Output is correct
2 Incorrect 166 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -