Submission #1273064

#TimeUsernameProblemLanguageResultExecution timeMemory
1273064goulthenFeast (NOI19_feast)C++20
Compilation error
0 ms0 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define per(i,a,b) for(int i = a; i >= b; i--)
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second

const int MAXN = 3e5+10;
const int INF = 1e18+10;
int a[MAXN];

int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(nullptr);
	int n,k; cin >> n >> k;
	rep(i,1,n) cin >> a[i];

	auto check = [&](int dx) {
		pii dp[n][2];

		dp[1][0] = {0,0};
		dp[1][1] = {a[1]-dx, 1};

		rep(i,2,n) {
			dp[i][0] = max(dp[i-1][0], dp[i-1][1]);

			dp[i][1] = max({dp[i-1][0].fi + a[i]-dx, dp[i-1][0].se + 1}, {dp[i-1][0].fi + a[i], dp[i-1][0].se});
		}

		return max(dp[n][0], dp[n][1]);
	}

	int lo = 0, hi = 1e18;
	while (lo < hi) {
		int mid = (lo+hi+1)/2;
		check(mid).se >= k ? lo =mid : hi = mid-1;
	}

	cout << solve(lo).fi + lo*k;

	return 0;
}

Compilation message (stderr)

feast.cpp: In lambda function:
feast.cpp:30:39: error: no matching function for call to 'max(<brace-enclosed initializer list>, <brace-enclosed initializer list>)'
   30 |                         dp[i][1] = max({dp[i-1][0].fi + a[i]-dx, dp[i-1][0].se + 1}, {dp[i-1][0].fi + a[i], dp[i-1][0].se});
      |                                    ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from feast.cpp:1:
/usr/include/c++/13/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
feast.cpp:30:39: note:   couldn't deduce template parameter '_Tp'
   30 |                         dp[i][1] = max({dp[i-1][0].fi + a[i]-dx, dp[i-1][0].se + 1}, {dp[i-1][0].fi + a[i], dp[i-1][0].se});
      |                                    ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note:   template argument deduction/substitution failed:
feast.cpp:30:39: note:   candidate expects 3 arguments, 2 provided
   30 |                         dp[i][1] = max({dp[i-1][0].fi + a[i]-dx, dp[i-1][0].se + 1}, {dp[i-1][0].fi + a[i], dp[i-1][0].se});
      |                                    ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
feast.cpp:30:39: note:   candidate expects 1 argument, 2 provided
   30 |                         dp[i][1] = max({dp[i-1][0].fi + a[i]-dx, dp[i-1][0].se + 1}, {dp[i-1][0].fi + a[i], dp[i-1][0].se});
      |                                    ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5805 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note:   template argument deduction/substitution failed:
feast.cpp:30:39: note:   couldn't deduce template parameter '_Compare'
   30 |                         dp[i][1] = max({dp[i-1][0].fi + a[i]-dx, dp[i-1][0].se + 1}, {dp[i-1][0].fi + a[i], dp[i-1][0].se});
      |                                    ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp: In function 'int32_t main()':
feast.cpp:4:13: error: expected ',' or ';' before 'long'
    4 | #define int long long
      |             ^~~~
feast.cpp:36:9: note: in expansion of macro 'int'
   36 |         int lo = 0, hi = 1e18;
      |         ^~~
feast.cpp:37:21: error: 'hi' was not declared in this scope; did you mean 'fi'?
   37 |         while (lo < hi) {
      |                     ^~
      |                     fi
feast.cpp:37:16: error: 'lo' was not declared in this scope; did you mean 'log'?
   37 |         while (lo < hi) {
      |                ^~
      |                log
feast.cpp:42:23: error: 'lo' was not declared in this scope; did you mean 'log'?
   42 |         cout << solve(lo).fi + lo*k;
      |                       ^~
      |                       log
feast.cpp:42:17: error: 'solve' was not declared in this scope
   42 |         cout << solve(lo).fi + lo*k;
      |                 ^~~~~