Submission #745732

#	Time	Username	Problem	Language	Result	Execution time	Memory
745732		inventiontime	Catfish Farm (IOI22_fish)	C++17	6 / 100	92 ms	17764 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[2][n];
    loop(i, n) {
        fish[0][i] = 0;
        fish[1][i] = 0;
    }
    loop(i, m) 
        fish[x[i]][y[i]] = w[i];

    ll res = 0;
    loop1(i, n-1) fish[0][i] += fish[0][i-1];
    loop1(i, n-1) fish[1][i] += fish[1][i-1];
    res = max(fish[0][n-1], fish[1][n-1]);
    if(n >= 3) 
        loop(i, n) 
            ckmax(res, fish[1][n-1] + fish[0][i] - fish[1][i]);
    
    return res;

}

• 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