Submission #643634

#	Time	Username	Problem	Language	Result	Execution time	Memory
643634		Dextar	Catfish Farm (IOI22_fish)	C++17	0 / 100	1087 ms	3556 KiB

fish

#include <cstdio>
#ifdef DEBUG
    #define D(X) X
#else
    #define D(X)
#endif
#include <bits/stdc++.h>
#define F first
#define S second
#define ll long long
#define pi 3.14159265359
#define pub push_back
#define pob pop_back
//#include <fish.h>

using namespace std;

const int INF = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w)
    {
        ll cnt[n];
        for(int i=0; i<n; i++) {
            cnt[i] = 0;
        }
        for(int i=0; i<m; i++) {
            cnt[x[i]] += w[i];   //cout<<cnt[x[i]]<<endl;
        }
        ll dp[n+1];
        dp[n] = 0;
        dp[n-1] = cnt[n-1];
        for(int i=n-2; i>=0; i--) {
            dp[i] = dp[i+2] + cnt[i];   //cout<<dp[i]<<endl;
            for(int j=i+2; j<=n; j++) {
                if(j>=n-1) {
                    dp[i] = max(dp[i], cnt[j-1]);
                } else
                {
                    dp[i] = max(dp[i], cnt[j-1] + dp[j+1]);
                }
            }
        }
        return dp[0];
    }

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16