Submission #1223480

#	Time	Username	Problem	Language	Result	Execution time	Memory
1223480		trimkus	Catfish Farm (IOI22_fish)	C++20	3 / 100	309 ms	12788 KiB

fish

#include "fish.h"

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


long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    vector<ll> dp1(N + 1), dp2(N + 1);
    vector<ll> c(N + 1);
    for (int i = 0; i < M; ++i) {
        c[X[i]] += W[i];
    }
    // for (auto& u : c) {
    //   cout << u << " ";
    // }
    // cout << "\n";
    dp1[0] = 0;
    dp2[0] = c[0];
    for (int i = 1; i < N + 1; ++i) {
        dp2[i] = max(dp2[i], dp1[i - 1] + c[i]);
        dp1[i] = max(dp1[i], max(dp1[i - 1], dp2[i - 1]));
    }
    for (auto& u : dp1) {
      cerr << setw(5) << left << u << " ";
    }
    cerr << "\n";
    for (auto& u : dp2) {
      cerr << setw(5) << left << u << " ";
    }
    cerr << "\n";
    return max(dp1[N], dp2[N]);
}

• Subtask 1: 3 / 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