Submission #825213

#	Time	Username	Problem	Language	Result	Execution time	Memory
825213		Marco_Escandon	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	1 ms	468 KiB

tickets

#include "tickets.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
	ll me=0;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
            row[j] = x[i][j];
            m+=x[i][j];
		}
		answer.push_back(row);
	}
	me/=n;
	ll bs=10000000000000;
	for(int i=me-2; i<me+2; i++)
    {
        ll st=0;
        for (int j = 0; j < n; j++) {
			if (j < k) {
                st=abs(x[j][0]-i);
			}
		}
		bs=min(bs,st);
    }
	allocate_tickets(answer);
	return bs;
}

• 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