oj.uz

답안 #832692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832692 2023-08-21T13:57:56 Z Jokubas 십자가 놓기 (FXCUP4_cross) C++17
8 / 100
 239 ms 28004 KB 
#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;

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

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

        isviso += kiekisI;

        int k = 0;
        int j = 0;

        while(j < K && k < kiekisI)
        {
            if((int)didziausi.size() - 1 <= j)
            {
                didziausi.pb(visi[kur + k].second);
                j++; k++;
                continue;
            }

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

            if(visi[kur + k].second >= didziausi[j])
            {
                didziausi.insert(didziausi.begin() + j, visi[kur + k].second);
                k++;
            }
            j++;
        }



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


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

        ats = max(ats, plotas);


        kur = isviso;
    }


    return ats;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 10 ms 2048 KB Output is correct
6 Correct 215 ms 27984 KB Output is correct
7 Correct 222 ms 28004 KB Output is correct
8 Correct 239 ms 27948 KB Output is correct

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 10 ms 2048 KB Output is correct
6 Correct 215 ms 27984 KB Output is correct
7 Correct 222 ms 28004 KB Output is correct
8 Correct 239 ms 27948 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 2132 KB Output is correct
13 Incorrect 77 ms 15808 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 10 ms 2048 KB Output is correct
6 Correct 215 ms 27984 KB Output is correct
7 Correct 222 ms 28004 KB Output is correct
8 Correct 239 ms 27948 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 2132 KB Output is correct
13 Incorrect 77 ms 15808 KB Output isn't correct
14 Halted 0 ms 0 KB -