| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 331626 | pggp | 카니발 티켓 (IOI20_tickets) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
#include "tickets.h"
using namespace std;
void allocate_tickets(vector < vector < int > > s);
long long find_maximum(int k, vector < vector < int > > x){
vector < vector < int > > to_allocate;
vector < int > v;
for(vector < int > t : x){
vector < int > a;
to_allocate.push_back(a);
for(int i : t){
to_allocate[to_allocate.size() - 1].push_back(0);
v.push_back(i);
}
}
allocate_tickets(to_allocate);
sort(v.begin(), v.end());
long long ans = 0;#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
void allocate_tickets(vector < vector < int > > s);
long long find_maximum(int k, vector < vector < int > > x){
int n = x.size();
int m = x[0].size();
long long ans = 0;
vector < vector < int > > to_allocate;
for(vector < int > t : x){
vector < int > a;
to_allocate.push_back(a);
for(int i : t){
to_allocate[to_allocate.size() - 1].push_back(-1);
}
}
if(m == 1){
vector < int > v;
for(int i = 0; i < x.size(); i++){
for(int j = 0; j < x[i].size(); j++){
to_allocate[i][j] = 0;
v.push_back(x[i][j]);
}
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); ++i)
{
if(i < v.size() / 2){
ans -= v[i];
}
else{
ans += v[i];
}
}
}
allocate_tickets(to_allocate);
return ans;
}
for (int i = 0; i < v.size(); ++i)
{
if(i < v.size() / 2){
ans -= v[i];
}
else{
ans += v[i];
}
}
return ans;
}
