Submission #745735

#	Time	Username	Problem	Language	Result	Execution time	Memory
745735		inventiontime	Catfish Farm (IOI22_fish)	C++17	0 / 100	26 ms	4308 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define re resize
#define ff first
#define ss second

#define all(x) (x).begin(), (x).end()
#define all1(x) (x).begin()+1, (x).end()
#define loop(i, n) for(int i = 0; i < n; i++)
#define loop1(i, n) for(int i = 1; i <= n; i++)

#define print(x) cout << #x << ": " << x << endl << flush

template<class T> bool ckmin(T&a, T b) { bool B = a > b; a = min(a, b); return B; }
template<class T> bool ckmax(T&a, T b) { bool B = a < b; a = max(a, b); return B; }

typedef long long ll;
typedef vector<int> vi;

ll max_weights(int n, int m, vi x, vi y, vi w) {

    ll fish[n+1];
    loop(i, n+1) fish[i] = 0;
    loop(i, m)
        fish[x[i]+1] = w[i];
    
    ll dp[n+1][2];
    dp[0][0] = 0;
    dp[0][1] = 0;

    loop1(i, n) {
        dp[i][0] = max(dp[i-1][0], dp[i-1][1]);
        dp[i][1] = dp[i-1][0] + fish[i];
    }
    
    return max(dp[n][0], dp[n][1]);

}

• 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