이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "tickets.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
int l[2005],r[2005];
long long find_maximum(int k, vector<vector<int> > x) {
int n = x.size();
int m = x[0].size();
long long ans=0;
vector<vector<int> > answer;
for (int i = 0; i < n; i++) {
std::vector<int> row(m);
for (int j = 0; j < m; j++) {
row[j]=-1;
}
answer.push_back(row);
}
for(int i=0;i<n;i++){
l[i]=0;
r[i]=m-1;
}
for(int i=0;i<k;i++){
vector<pair<long long,int> >v;
for(int j=0;j<n;j++){
ans+=((long long)x[j][r[j]]);
v.pb({x[j][l[j]]+x[j][r[j]],j});
}
sort(v.begin(),v.end());
for(int j=0;j<n;j++){
int id=v[j].second;
if(j<(n/2)){
ans-=((long long)v[j].first);
answer[id][l[id]]=i;
l[id]++;
}
else{
answer[id][r[id]]=i;
r[id]--;
}
}
}
allocate_tickets(answer);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |