Submission #1082159

#	Time	Username	Problem	Language	Result	Execution time	Memory
1082159		wood	Carnival Tickets (IOI20_tickets)	C++17	0 / 100	1 ms	348 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ll long long
#define pb push_back

long long find_maximum(int k, std::vector<std::vector<int>> x) {
    int n = x.size(), m = x[0].size();
    vector<vi> ans;
    for(int i = 0; i<m; i++) ans.pb({x[i][0]});
    int l = 0, r = 2e9;
    while (r-l>1){
		int mid = (r+l)/2;
		ll dif = 0;
		for(int i = 0; i<n; i++) dif+=mid-ans[i][0];
		if(dif<0) l = mid;
		else r=mid;
    }
    int ldif = 0, rdif = 0;
    for(int i = 0; i<n; i++) ldif+=abs(l-ans[i][0]);
    for(int i = 0; i<n; i++) rdif+=abs(r-ans[i][0]);
    return min(ldif,rdif);
}

• 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