제출 #666245

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

fish

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

using ll = long long;
#define double long double
#define endl '\n'
#define sz(a) (int)a.size()
#define pb push_back
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
ll const INF = LONG_LONG_MAX;


long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w)
{
    ll ans1=0, ans2=0, ans=0;
    if(n==2)
    {
        for(int i=0;i<m;i++)
        {
            if(x[i]==0){ans1+=w[i];}
            else{ans2+=w[i];}
        }
        ans=max(ans1, ans2);
    }
    else
    {
        vector<ll> val(n, 0);
        for(int i=0;i<m;i++)
        {
            if(x[i]==0){val[y[i]]+=w[i];}
            else if(x[i]==1) {ans+=w[i];val[y[i]]-=w[i];}
        }
        ll cur=ans;
        for(int i=0;i<n;i++)
        {
            cur+=val[i];
            ans=max(ans, cur);
        }
    }


    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