Submission #626820

#	Time	Username	Problem	Language	Result	Execution time	Memory
626820		ionan6ix	Catfish Farm (IOI22_fish)	C++17	3 / 100	84 ms	7272 KiB

fish

    #include "fish.h"

    #include <vector>
    #include<algorithm>
    using namespace std;

    long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                          std::vector<int> W) {

        bool flag = true;

        for(auto it:X)
            if(it%2)
            {
                flag = false;
                break;
            }

        if(flag)
        {
            long long sol = 0;
            for(auto it:W)
                sol+=it;

            return sol;
        }

        flag = true;

        for(auto it:X)
            if(it>1)
            {
                flag = false;
                break;
            }

        if(flag)
        {
            std::vector<pair<int,int> > y0;
            std::vector<pair<int,int> > y1;

            int sz = X.size();

            for(int i=0;i<sz;i++)
                if(X[i]==0) y0.emplace_back(Y[i],W[i]);
                    else y1.emplace_back(Y[i],W[i]);

            std::sort(y0.begin(),y0.end());
            std::sort(y1.begin(),y1.end());

            long long sol = 0LL;
            long long sum = 0LL;

            for(auto it:y1)
                sum += 1LL*it.second;

            sol = sum;

            /**
             * Pana la un anumit punct luam din 0, apoi din 1
             */

            int pnt0 = -1;
            int pnt1 = 0;
            long long sum0 = 0;
            for(int i=0;i<(int)y0.size();i++)
            {
                pnt0++;
                sum0 += 1LL * y0[pnt0].second;

                while(pnt1<(int)y1.size() && y1[pnt1].first<=y0[pnt0].first)
                {
                    sum -= 1LL * y1[pnt1].second;
                    pnt1++;
                }
                sol = max(sol,sum+sum0);
            }

            sum0 = 0LL;
            for(auto it:y0)
                sum0+=1LL*it.second;

            sol = max(sol,sum0);
            

            return sol;
        }
        return 0;
    }

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