Submission #1036370

#TimeUsernameProblemLanguageResultExecution timeMemory
1036370Mr_Husanboy카니발 티켓 (IOI20_tickets)C++17
11 / 100
1 ms860 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define ff first #define ss second #define all(a) (a).begin(), (a).end() template<typename T> int len(T &a){ return a.size(); } mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<vector<int>> ans(n, vector<int>(m)); vector<int> v; for(int i = 0; i < n; i ++){ for(int j = 0; j < m; j ++){ ans[i][j] = 0; v.push_back(x[i][j]); } } sort(all(v)); ll mx = 0; allocate_tickets(ans); for(int i = 0; i < n; i ++){ mx += abs(v[i] - v[n / 2]); } return mx; }
#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...