Submission #421268

#	Time	Username	Problem	Language	Result	Execution time	Memory
421268		Monchito	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	204 KiB

tickets

#include "tickets.h"
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
 
int n, m, K;
vector<vi> answer;
 
ll find_maximum(int k, vvi x){
	n = x.size();
	m = x[0].size();
 
	answer = vvi(n, vi(m, -1));
    
    int a[n];
    for(int i=0; i<n; i++) a[i] = x[i][0];
    sort(a, a+n);

    ll mid_floor = a[n/2];
    ll mid_ceil = a[n/2 - 1];
 
    ll s1, s2; s1 = s2 = 0;
    for(int i=0; i<n; i++) s1 += abs((ll)x[i][0] - mid_floor);
    for(int i=0; i<n; i++) s2 += abs((ll)x[i][0] - mid_ceil);
    
  	allocate_tickets(answer);
    return min(s1, s2);
}

• Subtask 1: 0 / 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