| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1347304 | Ludissey | Carnival Tickets (IOI20_tickets) | C++20 | 1 ms | 836 KiB |
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
int n;
int calc(vector<int> v){
sort(all(v));
int med=v[(sz(v)-1)/2];
int ans=0;
for (int i = 0; i < sz(v); i++) ans+=abs(v[i]-med);
return ans;
}
long long find_maximum(signed k, std::vector<std::vector<signed>> x) {
n=sz(x);
int m=sz(x[0]);
vector<int> a(n);
vector<vector<signed>> ret(n,vector<signed>(m,-1));
for (int i = 0; i < n; i++)
{
a[i]=i;
}
int sm=0;
for (int j = 0; j < m; j++)
{
vector<int> v;
for (int i = 0; i < n; i++)
{
ret[i][j]=j;
v.push_back(x[i][j]);
}
sm+=calc(v);
}
allocate_tickets(ret);
return sm;
}| # | 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... | ||||
