| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 304437 | urd05 | Carnival Tickets (IOI20_tickets) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
long long dp[81][6400];
const long long INF=1e18;
int zero[80];
int one[80];
typedef pair<int,int> P;
long long find_maximum(int k, vector<vector<int>> v) {
int n = v.size();
int m = v[0].size();
vector<vector<int>> answer(n,vector<int>(m));
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
answer[i][j]=-1;
}
}
dp[0][0]=0;
for(int i=1;i<=(n*k)/2;i++) {
dp[0][i]=-INF;
}
for(int i=1;i<=n;i++) {
for(int j=0;j<=(n*k)/2;j++) {
dp[i][j]=-INF;
long long sum=0;
for(int l=0;l<k;l++) {
sum-=v[i-1][l];
}
for(int l=0;l<=k&&l<=j;l++) {
dp[i][j]=max(dp[i][j],dp[i-1][j-l]+sum);
if (l!=k) {
sum+=v[i-1][m-l-1];
sum+=v[i-1][k-l-1];
}
}
}
}
long long ret=dp[n][(n*k)/2];
int now=(n*k)/2;
for(int i=n-1;i>=0;i--) {
int val;
long long sum=0;
for(int j=0;j<k;j++) {
sum-=v[i][j];
}
for(int j=0;j<=k&&j<=now;j++) {
if (dp[i][now-j]+sum==dp[i+1][now]) {
val=j;
now-=j;
break;
}
sum+=v[i][m-j-1];
sum+=v[i][k-j-1];
}
zero[i]=k-val;
one[i]=val;
}
for(int cnt=0;cnt<k;cnt++) {
vector<int> ind;
priority_queue<P> pq;
int pick=n/2;
for(int i=0;i<n;i++) {
if (zero[i]==0) {
ind.push_back(i);
pick--;
}
if (one[i]==0) {
continue;
}
pq.push(P(one[i]-zero[i],i));
}
for(int i=0;i<pick;i++) {
ind.push_back(pq.top().second);
pq.pop();
}
sort(ind.begin(),ind.end());
for(int i=0;i<n;i++) {
if (binary_search(ind.begin(),ind.end(),i)) {
answer[i][m-one[i]]=cnt;
one[i]--;
}
else {
answer[i][zero[i]-1]=cnt;
zero[i]--;
}
}
}
allocate_tickets(answer);
return ret;
}