Submission #1289641

#TimeUsernameProblemLanguageResultExecution timeMemory
1289641bilgunCarnival Tickets (IOI20_tickets)C++20
0 / 100
1 ms340 KiB
#include<bits/stdc++.h> #include "tickets.h" using namespace std; long long find_maximum(int k, vector<vector<int>> vec){ int n = vec.size(), m = vec[0].size(); vector<vector<int>> ans(n); int count = 0, s = 0; for( int i = 0; i < n; i++){ ans[i].push_back(vec[i][0]); count += vec[i][0]; } count /= n; for( int i = 0; i < n; i++){ s += abs(vec[i][0] - count); } allocate_tickets(ans); return s; }
#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...