| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 622322 | happypotato | Connecting Supertrees (IOI20_supertrees) | C++17 | 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 "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
#define pb push_back
//
const ll MAX = 1e18;
vector<vector<int>> a;
int n, m, k;
ll st1() {
vector<vector<int>> allo;
allo.resize(n, {0});
allocate_tickets(allo);
vector<ll> shit(n);
for (int i = 0; i < n; i++) shit[i] = a[i][0];
sort(shit.begin(), shit.end());
ll ans = MAX, cur = 0;
for (int i = 0; i < n; i++) {
cur += shit[i];
}
int delta = -n;
for (int i = 0; i < n; i++) {
cur += (shit[i] - (i == 0 ? 0 : shit[i - 1])) * delta;
ans = min(ans, cur);
delta += 2;
}
return ans;
}
long long find_maximum(int K, vector<vector<int>> x) {
n = x.size(); m = x[0].size(); k = K; a = x;
if (m == 1) return st1();
}