Submission #1168886

#TimeUsernameProblemLanguageResultExecution timeMemory
1168886SmuggingSpunCarnival Tickets (IOI20_tickets)C++20
11 / 100
3 ms6728 KiB
#include "tickets.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; const int lim = 1505; int n, m, k, a[lim][lim]; namespace sub1{ ll solve(){ vector<int>A; vector<vector<int>>s(n, vector<int>(m)); for(int i = 0; i < n; i++){ A.emplace_back(a[i][0]); s[i][0] = 0; } allocate_tickets(s); sort(A.begin(), A.end()); int median = A[n >> 1]; ll ans = 0; for(int& x : A){ ans += abs(x - median); } return ans; } } ll find_maximum(int _k, vector<vector<int>>_x){ n = _x.size(); m = _x[0].size(); k = _k; for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ a[i][j] = _x[i][j]; } } if(m == 1){ return sub1::solve(); } }

Compilation message (stderr)

tickets.cpp: In function 'll find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
   37 | }
      | ^
#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...