Submission #222101

#	Time	Username	Problem	Language	Result	Execution time	Memory
222101		Vimmer	Kisik (COCI19_kisik)	C++14	0 / 90	92 ms	131076 KiB

kisik

#include <bits/stdc++.h>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(998244353)

using namespace std;

typedef long long ll;

typedef long double ld;


int main()
{

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, k;

    cin >> n >> k;

    ll a[n], b[n];

    pair <ll, ll> dp[n + 1][k + 1];

    for (int i = 0; i < n; i++) cin >> a[i] >> b[i];

    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= k; j++) dp[i][j].F = dp[i][j].S = 1e9;

    dp[0][0].F = dp[0][0].S = 0;

    for (int i = 0; i < n; i++)
        for (int j = 0; j <= min(i, k); j++)
        {
            if (dp[i + 1][j].F * dp[i + 1][j].S > dp[i][j].F * dp[i][j].S) dp[i + 1][j] = dp[i][j];

            if (j == k) continue;

            ll len = dp[i][j].F + a[i];

            ll hg = max(b[i], dp[i][j].S);

            if (len * hg < dp[i + 1][j + 1].F * dp[i + 1][j + 1].S) {dp[i + 1][j + 1].F = len; dp[i + 1][j + 1].S = hg;}
        }
    cout << dp[n][k].F * dp[n][k].S;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10