제출 #1054476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1054476		ProtonDecay314	메기 농장 (IOI22_fish)	C++17	6 / 100	66 ms	19552 KiB

fish

#include "fish.h"

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef vector<vpi> vvpi;
typedef vector<vpll> vvpll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef short int si;
typedef vector<si> vsi;
typedef vector<vsi> vvsi;
#define IOS ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define L(varll, mn, mx) for(ll varll = (mn); varll < (mx); varll++)
#define LR(varll, mx, mn) for(ll varll = (mx); varll > (mn); varll--)
#define LI(vari, mn, mx) for(int vari = (mn); vari < (mx); vari++)
#define LIR(vari, mx, mn) for(int vari = (mx); vari > (mn); vari--)
#define INPV(varvec) for(auto& varveci : (varvec)) cin >> varveci
#define fi first
#define se second
#define pb push_back
#define INF(type) numeric_limits<type>::max()
#define NINF(type) numeric_limits<type>::min()
#define TCASES int t; cin >> t; while(t--)

ll max_weights(int N, int M, vi X, vi Y, vi W) {
    vvll g;
    L(i, 0ll, 2ll) {
        vll gr(N, 0ll);
        g.pb(gr);
    }

    L(i, 0ll, M) {
        g[X[i]][Y[i]] = W[i];
    }

    ll ans = 0ll;

    ll sum0 = 0ll;
    ll sum1 = 0ll;

    for(ll i = 0ll; i < M; i++) {
        (X[i] == 0 ? sum0 : sum1) += (ll)W[i];
    }

    if(N == 2) {
        ans = max(sum0, sum1);
    } else {
        vll pref_0(N + 1ll, 0ll);
        vll suff_1(N + 1ll, 0ll);

        L(i, 0ll, N) {
            pref_0[i + 1ll] = pref_0[i] + g[0ll][i];
        }

        LR(i, N - 1ll, -1ll) {
            suff_1[i] = suff_1[i + 1ll] + g[1ll][i];
        }

        L(i, 0ll, N + 1ll) {
            ans = max(ans, pref_0[i] + suff_1[i]);            
        }
    }
    
    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