Submission #660494

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
660494	2022-11-22T05:53:02 Z	mychecksedad	Uplifting Excursion (BOI22_vault)	C++17	Compilation error	0 ms	0 KB

vault

/* 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], dp[N]; // + and - parts
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 > 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) - 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 < 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++;
        }
    }
    ll M = max(m * m, 10000);
    if(sum > l || l - sum > M){
        cout << "impossible"; 
        return;
    }
    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;
        if(i > m){
            for(int j = 2*M; j >= 0; --j){
                if(dp[j] > 2*m) continue;
                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 = 0; j <= 2*M; ++j){
                if(dp[j] > 2*m) continue;
                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);
                    }
                }
            }
        }else{
            for(int j = 0; j <= 2*M; ++j){
                if(dp[j] > 2*m) continue;
                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){
                if(dp[j] > 2*m) continue;
                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] > 1e7) 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 'void solve()':
vault.cpp:69:28: error: no matching function for call to 'max(ll, int)'
   69 |     ll M = max(m * m, 10000);
      |                            ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from vault.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
vault.cpp:69:28: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   69 |     ll M = max(m * m, 10000);
      |                            ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from vault.cpp:2:
/usr/include/c++/10/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  300 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
vault.cpp:69:28: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   69 |     ll M = max(m * m, 10000);
      |                            ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from vault.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3480:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3480 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3480:5: note:   template argument deduction/substitution failed:
vault.cpp:69:28: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   69 |     ll M = max(m * m, 10000);
      |                            ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from vault.cpp:2:
/usr/include/c++/10/bits/stl_algo.h:3486:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3486 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3486:5: note:   template argument deduction/substitution failed:
vault.cpp:69:28: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   69 |     ll M = max(m * m, 10000);
      |                            ^
vault.cpp: In function 'int main()':
vault.cpp:128:16: warning: unused variable 'aa' [-Wunused-variable]
  128 |     int T = 1, aa;
      |                ^~