Submission #304440

#TimeUsernameProblemLanguageResultExecution timeMemory
304440Jarif_RahmanCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms384 KiB
#include "tickets.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
vector<vector<int>> r;
long long find_maximum(int k, vector<vector<int>>rrrr){
    r = rrrr;
    ll b = r[0][r[0].size()/2 - 1];
    ll s = 0;
    for(ll x: r[0]) s+=abs(x - b);
    allocate_tickets(vector<vector<int>>(1, vector<int>(r[0].size(), 0)));
    return s;
}
#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...