제출 #335675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335675		aanastasov	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	2 ms	748 KiB

tickets

#include "tickets.h"
#include <algorithm>
#include <cassert>
#include <vector>

long long find_maximum(int numRounds, std::vector<std::vector<int>> ticket) {
    const int length = ticket.size();
    const int numColors = ticket[0].size();

    auto answer = std::vector<std::vector<int>>(length, std::vector<int>(numColors, -1));
    assert(numColors == 1);
    auto values = std::vector<int>();
    for (int i = 0; i < length; ++i) {
        values.push_back(ticket[i][0]);
        answer[i][0] = 0;
    }
    std::sort(values.begin(), values.end());
    int b = values[length / 2];
    long long res = 0;
    for (auto x : values) res += llabs(x - b);
    allocate_tickets(answer);
    return res;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10