Submission #832766

#	Time	Username	Problem	Language	Result	Execution time	Memory
832766		Jokubas	Crosses on the Grid (FXCUP4_cross)	C++17	100 / 100	263 ms	32560 KiB

cross

#include <iostream>
#include <bits/stdc++.h>
#define pb push_back
typedef long long ll;

using namespace std;

ll SelectCross (int K, vector<int> I, vector<int> O)
{
    ll ats = 0;

    int N = I.size();

    map<int, vector<int>> lol;

    vector<pair<int, int>> visi;

    for(int i = 0; i<N; i++)
    {
        visi.pb({I[i], O[i]});

        lol[I[i]].pb(O[i]);
    }

    sort(visi.begin(), visi.end());
    reverse(visi.begin(), visi.end());

    int kiek = lol.size();

    int kur = 0;
    int isviso = 0;

    //vector<int> didziausi;
    //deque<int> didziausi;

    priority_queue<int, vector<int>, greater<int>> didziausi;

    for(int i = 0; i<kiek; i++)
    {
        int dabar = visi[kur].first;

        int kiekisI = lol[dabar].size();

        isviso += kiekisI;


        for(int j = 0; j<kiekisI; j++)
        {
            didziausi.push(visi[kur + j].second);

            if(didziausi.size()>K)
            {
                didziausi.pop();
            }
        }

        /*
        int k = 0;
        int j = 0;

        while(j < K && k < kiekisI)
        {
            int db = visi[kur + k].second;

            if((int)didziausi.size() <= j)
            {
                didziausi.pb(visi[kur + k].second);
                j++; k++;
                continue;
            }


            if(db <= didziausi[min((int)didziausi.size()-1, K-1)])
            {
                j = min((int)didziausi.size()-1, K-1) + 1;
                continue;
            }


            if(db >= didziausi[j])
            {
                didziausi.insert(didziausi.begin() + j, db);
                k++; j++;
                continue;
            }






            int r = j;
            int l = min((int)didziausi.size()-1, K-1);

            bool skip = 0;
            while(r<l)
            {
                int m = (r+l)/2;

                if(db < didziausi[m])
                {
                    r = m;

                }
                if(db > didziausi[m])
                {
                    l = m;
                }
                if(db == didziausi[m])
                {
                    didziausi.insert(didziausi.begin() + j, db);
                    k++;
                    r = l+1;
                    skip = 1;

                }
            }
        }*/

        if(isviso < K)
        {
            kur = isviso;
            continue;
        }

        //ll plotas = (ll)dabar*(2*(ll)didziausi[K-1] - (ll)dabar);

        ll plotas = (ll)dabar*(2*(ll)didziausi.top() - (ll)dabar);

        ats = max(ats, plotas);


        kur = isviso;
    }


    return ats;
}

Compilation message (stderr)

cross.cpp: In function 'll SelectCross(int, std::vector<int>, std::vector<int>)':
cross.cpp:51:32: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |             if(didziausi.size()>K)
      |                ~~~~~~~~~~~~~~~~^~

• Subtask 1: 8 / 8
• Subtask 2: 55 / 55
• Subtask 3: 37 / 37