# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078884 | Jawad_Akbar_JJ | Carnival Tickets (IOI20_tickets) | C++17 | 2 ms | 600 KiB |
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 <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include "tickets.h"
using namespace std;
#define f first
#define s second
long long find_maximum(int k, vector<vector<int>> x){
int n = x.size();
int m = x[0].size();
if (m == 1){
vector<int> vec;
for (int i=0;i<n;i++)
vec.push_back(x[i][0]), x[i][0] = 0;
sort(begin(vec), end(vec));
long long ans = 0;
for (int i=0;i<n;i++)
ans += abs(vec[n / 2] - vec[i]);
allocate_tickets(x);
return ans;
}
vector<pair<pair<int,int>,int>> vec;
for (int i=0;i<n;i++){
Compilation message (stderr)
# | 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... |