# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078286 | mindiyak | Carnival Tickets (IOI20_tickets) | C++14 | 1 ms | 760 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 "tickets.h"
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
#define F first
#define S second
typedef long long ll;
ll find_maximum(int k, std::vector<std::vector<int>> x) {
int n = x.size();
int m = x[0].size();
std::vector<std::vector<int>> answer(n,vector<int>(m,-1));
if(m == 1){
ll val = 0;
vector<int> temp;
for (int i = 0; i < n; i++) {
std::vector<int> row(m,-1);
row[0] = 0;
temp.push_back(x[i][0]);
answer.push_back(row);
}
sort(temp.begin(),temp.end());
for (int i = 0; i < n/2; i++)val -= temp[i];
for (int i = n/2; i < n; i++)val += temp[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... |