Submission #825237

#TimeUsernameProblemLanguageResultExecution timeMemory
825237Marco_Escandon카니발 티켓 (IOI20_tickets)C++17
0 / 100
1 ms212 KiB
#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(1);
	ll me=0;
	for (int i = 0; i < n; i++) {
        m+=x[i][0];
		answer[0].push_back(x[i][0]);
	}
	me/=n;
	ll bs=10000000000000;
	for(int i=me-2; i<me+2; i++)
    {
        ll st=0;
        for (int j = 0; j < n; j++) {
            st=abs(x[j][0]-i);
		}
		bs=min(bs,st);
    }
	allocate_tickets(answer);
	return bs;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...