Submission #684207

#	Time	Username	Problem	Language	Result	Execution time	Memory
684207		Urvuk3	Catfish Farm (IOI22_fish)	C++17	0 / 100	24 ms	5640 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>

using namespace std;

#define ll long long
const int INF=1e9;
const ll LINF=1e18;
#define fi first
#define se second
#define pii pair<int,int>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define PRINT(x) cerr<<#x<<'='<<x<<endl;
#define pb push_back
#define PRINTvec(niz) { cerr<<#niz<<"="; for(auto _i:niz) cerr<<_i<<" "; cerr<<endl; }

long long max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W){
    ll res=0;
    bool subtask1=true;
    for(auto x:X){
        subtask1&=(x%2==0);
    }
    if(subtask1){
        ll res=0;
        for(auto x:W) res+=x;
    }
    bool subtask2=true;
    for(auto x:X){
        subtask2&=(x<=1);
    }
    if(subtask2){
        ll res=0;
        ll sum0=0,sum1=0;
        for(int i=0;i<N;i++){
            if(X[i]==0){
                sum0+=W[i];
            }
            else{
                sum1+=W[i];
            }
        }
        res=max(sum1,sum0);
        sum0=0;
        vector<vector<int>> we(2,vector<int>(N,0));
        for(int i=0;i<N;i++){
            we[X[i]][Y[i]]=W[i];
        }
        for(int k=0;k<N;k++){
            sum0+=we[0][k];
            sum1-=we[1][k];
            res=max(res,sum0+sum1);
        }
    }
    return res;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 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