제출 #301911

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

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define PB push_back
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define i2 array<int,2>
using namespace std;
typedef long long ll;
const int N = 200100;
vector<int> vc;
vector<i2> elms;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	vector<vector<int>> answer;

	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);

		for (int j = 0; j < m; j++)
            row[j] = j;

		answer.push_back(row);
	}

	allocate_tickets(answer);

	ll ans = 0;

	for (int j = 0; j < m; j++) {
        vc.clear();

        for (int i = 0; i < n; i++)
            vc.PB(x[i][j]);

        sort(all(vc));

        for (int i = 0; i < n; i++)
            ans += abs(vc[i] - vc[sz(vc) / 2]);
	}

	return ans;
}

• 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