Submission #825111

#	Time	Username	Problem	Language	Result	Execution time	Memory
825111		PixelCat	Catfish Farm (IOI22_fish)	C++17	6 / 100	67 ms	8828 KiB

fish

#include "fish.h"

#ifdef NYAOWO
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second 
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;

inline void chmax(int &x, int val) { x = max(x, val); }

const int MAXN = 100'000;

int p0[MAXN + 10];
int p1[MAXN + 10];

long long max_weights(i32 N, i32 M, vector<i32> X, vector<i32> Y,
                      vector<i32> W) {
    For(i, 0, M - 1) {
        if(X[i] == 0) p0[Y[i]] += W[i];
        else p1[Y[i]] += W[i];
    }
    For(i, 1, N - 1) {
        p0[i] += p0[i - 1];
        p1[i] += p1[i - 1];
    }
    if(N == 2) return max(p0[N - 1], p1[N - 1]);
    int ans = p1[N - 1];
    For(i, 0, N - 1) {
        chmax(ans, p0[i] + p1[N - 1] - p1[i]);
    }
    return ans;
}

/*

5 4
0 2 5
1 1 2
4 4 1
3 3 3

8

*/

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