Submission #1050458

#TimeUsernameProblemLanguageResultExecution timeMemory
1050458noyancanturkCarnival Tickets (IOI20_tickets)C++17
11 / 100
1 ms860 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; #define pb push_back using lint=long long; 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; for(int i=0;i<n;i++){ ans.pb(vector<int>(m)); } if(m==1){ vector<int>vals; for(int i=0;i<n;i++){ vals.pb(x[i][0]); ans[i][0]=0; } sort(vals.begin(),vals.end()); lint res=0; for(int i:vals){ res+=abs(i-vals[n/2]); } allocate_tickets(ans); return res; } return -1; }
#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...