Submission #337287

#TimeUsernameProblemLanguageResultExecution timeMemory
337287RegisterCarnival Tickets (IOI20_tickets)C++14
27 / 100
638 ms51580 KiB
#include <bits/stdc++.h> #include "tickets.h" #define fi first #define se second using namespace std; typedef long long ll; typedef vector<int> vec; typedef vector<vec> vvec; const int N=1505; int n,m,d[N]; ll sum; vector<pair<int,int> > v; ll find_maximum(int k,vvec x){ n=x.size();m=x[0].size(); vvec ans(n,vec(m,-1)); for(int i=0;i<n;i++) for(int j=0;j<k;j++) {sum+=x[i][m-1-j];v.push_back(make_pair(x[i][j]+x[i][m-k+j],i));} sort(v.begin(),v.end()); for(int i=0;i<n*k/2;i++) {sum-=v[i].fi;d[v[i].se]++;} for(int i=0;i<n;i++) for(int j=0;j<k;j++) if(j<d[i]) ans[i][j]=j; else ans[i][m-k+j]=j; allocate_tickets(ans);return sum; }
#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...