제출 #302947

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

tickets

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

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			if (j < k) {
				row[j] = j;
			} else {
				row[j] = -1;
			}
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);

    // calculate return value
    long long maximum = 0;
    std::vector<std::vector<int>> rounds(k);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            int r = answer[i][j];
            if (r != -1) {
                rounds[r].push_back(x[i][j]);
            }
        }
    }
    for (int i = 0; i < k; ++i) {
        std::sort(rounds[i].begin(), rounds[i].end());
        int b = rounds[i][n/2];
        for (int j = 0; j < n; ++j) {
            if (rounds[i][j] < b) {
                maximum += b - rounds[i][j];
            }
            else {
                maximum += rounds[i][j] - b;
            }
        }
    }

	return maximum;
}

• 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