Submission #412065

#TimeUsernameProblemLanguageResultExecution timeMemory
412065SuhaibSawalha1Carnival Tickets (IOI20_tickets)C++17
11 / 100
2 ms716 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; long long calc (vector<long long> &a) { int n = a.size(); long long sum = accumulate(a.begin(), a.end(), 0LL), m = LLONG_MAX, sum2 = 0; sort(a.begin(), a.end()); for (int i = 0; i < n; ++i) { sum -= a[i]; m = min(m, a[i] * i - sum2 + sum - a[i] * (n - i - 1)); sum2 += a[i]; } return m; } long long find_maximum(int k, vector<vector<int>> a) { int n = a.size(); int m = a[0].size(); vector<vector<int>> g(n, vector<int>(m, -1)); vector<vector<array<int, 2>>> a2(n, vector<array<int, 2>>(m)); long long ans = 0; for (int i = 0; i < n; ++i) { for (int j = 0; j < m; ++j) { a2[i][j] = {a[i][j], j}; } sort(a2[i].begin(), a2[i].end()); } for (int i = 0; i < m; ++i) { vector<long long> ask; for (int j = 0; j < n; ++j) { ask.push_back(a2[j][i][0]); g[j][a2[j][i][1]] = i; } ans += calc(ask); } allocate_tickets(g); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...