Submission #1290109

#TimeUsernameProblemLanguageResultExecution timeMemory
1290109eri16카니발 티켓 (IOI20_tickets)C++20
0 / 100
1 ms344 KiB
#include<bits/stdc++.h> #include "tickets.h" using namespace std; int fnd_ans(int k,vector<vector<int>> v,vector<vector<int>> ans){ vector <int> vv[k]; int n=v.size(); int m=v[0].size(); for (int i=0; i<n; i++){ for (int j=0; j<m; j++){ if (ans[i][j]!=-1){ vv[ans[i][j]].push_back(v[i][j]); } } } int sm=0,tt; for (int i=0; i<k; i++){ tt=vv[i][n/2LL]; for (int j=0; j<n; j++){ sm+=abs(tt-vv[i][j]); } } return sm; } long long find_maximum(int k, vector<vector<int>> v){ int n=v.size(); int m=v[0].size(); vector<vector<int>> ans(n); if (m==1){ for (int i=0; i<n; i++){ ans[i].push_back(0); } } allocate_tickets(ans); return fnd_ans(k,v,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...