Submission #1211599

#	Time	Username	Problem	Language	Result	Execution time	Memory
1211599		thelegendary08	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	1 ms	836 KiB

tickets

#include "tickets.h"
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f0r(i,n) for(int i = 0; i<n; i++)
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define vi vector<long long>
#define vvi vector<vi>
#define pii pair<int,int>
#define vb vector<bool>
#define vout(v) for(auto u : v)cout<<u<<' '; cout<<'\n';
#define dout(x) cout<<x<<' '<<#x<<'\n';
using namespace std;

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);
	*/
	
	vector<vector<int>> ans(n, vector<int>(m));
	f0r(i,n)f0r(j,m)ans[i][j] = 0;
	vi v;
	f0r(i,n)f0r(j,m)v.pb(x[i][j]);
	sort(v.begin(), v.end());
	
	long long mid = v[n/2];
	long long anss = 0;
	f0r(i, n){
		anss += abs(v[i] - mid);
	}
	
	allocate_tickets(ans);
	return anss;
}

• 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