Submission #1245197

#	Time	Username	Problem	Language	Result	Execution time	Memory
1245197		DeathIsAwe	Catfish Farm (IOI22_fish)	C++20	6 / 100	61 ms	12356 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
using namespace std;
int n, m;
vector<int> x, y, w;
ll bruh[2][100000];


ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    for (int i=0;i<2;i++) {
        for (int j=0;j<100000;j++) {
            bruh[i][j] = 0;
        }
    }
    n = N; m = M; x = X; y = Y; w = W;
    ll sum1 = 0, sum2 = 0;
    for (int i=0;i<m;i++) {
        bruh[x[i]][y[i]] = w[i];
    }
    ll ans = 0;
    for (int i=0;i<n;i++) {
        sum1 += bruh[0][i];
    }
    ans = sum1;
    if (n == 2) return max(bruh[0][0] + bruh[0][1], bruh[1][0] + bruh[1][1]);
    for (int i=n-1;i>-1;i--) {
        sum1 -= bruh[0][i];
        sum2 += bruh[1][i];
        ans = max(ans, sum1 + sum2);
    }
    return ans;
}

• 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