| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1289640 | bilgun | Carnival Tickets (IOI20_tickets) | C++20 | 1 ms | 404 KiB |
#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
long long find_maximum(int k, vector<vector<int>> vec){
int n = vec.size(), m = vec[0].size();
vector<vector<int>> ans;
int count = 0, s = 0;
for( int i = 0; i < n; i++){
ans[i].push_back(vec[i][0]);
count += vec[i][0];
}
count /= n;
for( int i = 0; i < n; i++){
s += abs(vec[i][0] - count);
}
allocate_tickets(ans);
return s;
}
| # | 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... | ||||
