This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
long long int fin(vector<vector<int> > a,int n,int m,int k){
for(int i=0;i<n;i++){
sort(a[i].begin(),a[i].end());
}
long long int ans=0;
for(int i=0;i<n;i++){
double mid=0;
for(int j=0;j<m;j++){
mid+=a[i][j];
}
mid/=m;
long long int ff=a[i][(m+1)/2];
for(int j=0;j<m;j++){
ans+=(long long int)(abs(ff-a[i][j]));
}
}
return ans;
}
long long int find_maximum(int k, vector<vector<int> > x){
/*int n=x.size();
int m=x[0].size();
if(m==1){
vector<vector<int> > ans(n);
vector<vector<int> > answ(k);
for(int i=0;i<n;i++){
ans[i].push_back(0);
answ[0].push_back(x[i][0]);
}
allocate_tickets(ans);
return fin(answ,k,n,k);
}
if(k==1){
vector<int>
}*/
int a[1500*1500];
sort(a,a+1500*1500);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |