# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412721 | ak2006 | Olympiads (BOI19_olympiads) | C++14 | 2081 ms | 5156 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.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vc = vector<char>;
using vvc = vector<vc>;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
void setIO()
{
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
int main()
{
setIO();
int n,m,k;
cin>>n>>m>>k;
vvl scores(n,vl(m));
for (int i = 0;i<n;i++)for (int j = 0;j<m;j++)cin>>scores[i][j];
vvi best_scores(m,vi(n));
for (int i = 0;i<m;i++){
for (int j = 0;j<n;j++)best_scores[i][j] = j;
sort(best_scores[i].begin(), best_scores[i].end(),[&](int a,int b){
return scores[a][i] > scores[b][i];
});
}
struct Item{
int score;
int pos;
vi current;
vb forbidden;
const bool operator<(const Item &other)const{
return score < other.score;
}
};
const auto evaluate = [&](const vi& cur)
{
vl res(m);
ll ret = 0;
for (int i = 0;i<cur.size();i++){
int pos = best_scores[i][cur[i]];
for (int j = 0;j<m;j++){
res[j] = max(res[j],scores[pos][j]);
}
ret += res[i];
}
return ret;
};
Item best;
best.score = 0,best.pos = 0;
best.current.assign(m,-1);
best.forbidden.assign(n,0);
for (int i = 0;i<m;i++){
int pos = 0;
while (pos < n && best.forbidden[best_scores[i][pos]])pos++;
if (pos < n){
best.current[i] = pos;
best.forbidden[best_scores[i][pos]] = 1;
}
}
best.score = evaluate(best.current);
k--;
priority_queue<Item>pq;
pq.push(best);
while (k--){
Item now = pq.top();
pq.pop();
for (int j = now.pos;j<m;j++){
int pos = now.current[j];
while (pos < n && now.forbidden[best_scores[j][pos]])pos++;
if (pos < n){
Item next = now;
next.pos = j;
next.current[j] = pos;
next.score = evaluate(next.current);
next.forbidden[best_scores[j][pos]] = 1;
pq.push(next);
}
}
}
cout<<pq.top().score;
return 0;
}
Compilation message (stderr)
# | 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... |