Submission #1193718

#TimeUsernameProblemLanguageResultExecution timeMemory
1193718simona1230Carnival Tickets (IOI20_tickets)C++20
0 / 100
0 ms328 KiB
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int n,m;
int a[1501][1501];

long long find_maximum(int k, std::vector<std::vector<int>> x)
{
	n=x.size();
	m=x[0].size();

	for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            a[i][j]=x[i][j];
        }
    }

    if(m==1)
    {
        vector<int> h;
        for(int i=0;i<n;i++)
            h.push_back(a[i][0]);
        sort(h.begin(),h.end());
        long long sz=h.size()/2,ans=0;
        for(int i=0;i<n;i++)
            ans+=abs(h[i]-h[sz]);
        return ans;
    }
	return 1;
}
#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...