제출 #966197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
966197		andrej246	Catfish Farm (IOI22_fish)	C++17	6 / 100	68 ms	10068 KiB

fish

#include "fish.h"

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

#define NL '\n'
#define EL cout << NL
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define FORS(i,s,n) for(int i = (s); i < (n); i++)
#define PRINTV(v) for(auto a:v) {cout << a << " ";} EL;
#define PRINTVV(v) for(auto a:v) {PRINTV(a);}
#define f first
#define s second
#define all(v) (v).begin(),(v).end()
#define STRP(p) "{" << (p).f << "," << (p).s << "}"
#define PRINTVP(v) for(auto a:v) {cout << STRP(a) << " ";} EL;
#define PRINTVVP(v) for(auto a:v) {PRINTVP(a);}

typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<vpl> vvpl;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    vl left(N);
    vl right(N);
    FOR(i,M) {
        if (X[i] == 0) left[Y[i]] = W[i];
        else right[Y[i]] = W[i];
    }
    if (N == 2) {
        return max(right[0]+right[1],left[0]+left[1]);
    }
    ll ans = 0;
    FOR(i,N) {
        ans += right[i];
    }
    ll psum = ans;
    FOR(i,N) {
        psum += left[i]-right[i];
        ans = max(ans,psum);
    }
    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