Submission #352834

#TimeUsernameProblemLanguageResultExecution timeMemory
352834juggernautCarnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms364 KiB
#include"tickets.h" #include<bits/stdc++.h> #ifndef EVAL #include"grader.cpp" #endif using namespace std; long long find_maximum(int k,vector<vector<int>>x){ int n=x.size(); int m=x[0].size(); vector<vector<int>>answer(n,vector<int>(m,1)); vector<int>v; for(int i=0;i<n;i++)v.push_back(x[i][0]); sort(v.begin(),v.end()); int mid=v[n>>1]; long long res=0; for(int i=0;i<n;i++)res+=1ll*abs(v[i]-mid); allocate_tickets(answer); return res; }
#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...