#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,k,c;
int a[505][7];
struct config
{
int val[7],sumval;
vector<int> alesi;
void baga(int x)
{
alesi.push_back(x);
sort(alesi.begin(),alesi.end());
sumval=0;
for(int i=1;i<=k;i++)
{
val[i] = max(val[i], a[x][i]);
sumval += val[i];
}
}
void schimba(int poz, int newv)
{
alesi[poz] = newv;
sort(alesi.begin(),alesi.end());
sumval=0;
for(int i=1;i<=k;i++)
{
val[i]=0;
for(int j:alesi)
val[i] = max(val[i], a[j][i]);
sumval += val[i];
}
}
bool is_ales(int x)
{
for(int i:alesi)
if(i==x)
return 1;
return 0;
}
};
bool operator<(config x, config y)
{
if(x.sumval < y.sumval)
return 1;
if(x.sumval > y.sumval)
return 0;
if((int)x.alesi.size() < (int)y.alesi.size())
return 1;
if((int)x.alesi.size() > (int)y.alesi.size())
return 0;
for(int i=0;i<x.alesi.size();i++)
{
if(x.alesi[i] < y.alesi[i])
return 1;
if(x.alesi[i] > y.alesi[i])
return 0;
}
return 0;
}
bool ales[505];
config init;
signed main()
{
cin>>n>>k>>c;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=k;j++)
{
cin>>a[i][j];
}
}
assert(k<=n);
for(int i=1;i<=k;i++)
{
int mxm=-1,unde=-1;
for(int j=1;j<=n;j++)
{
if(!ales[j] && a[j][i]>mxm)
{
mxm = a[j][i];
unde = j;
}
}
assert(unde!=-1);
ales[unde] = 1;
init.baga(unde);
}
priority_queue<config> pq;
map<config,int> inq;
pq.push(init);
inq[init]=1;
int cnt=0;
int prec=1e9;
while(!pq.empty())
{
config aux = pq.top();
pq.pop();
/*for(int i=0;i<aux.alesi.size();i++)
cerr<<aux.alesi[i]<<" ";
cerr<<" zzz\n";*/
assert(aux.sumval <= prec);
prec = aux.sumval;
cnt++;
if(cnt==c)
{
cout<<aux.sumval;
return 0;
}
for(int s=0;s<k;s++)
{
for(int i=1;i<=n;i++)
{
if(!aux.is_ales(i))
{
config newc = aux;
newc.schimba(s,i);
if(!inq[newc])
{
pq.push(newc);
inq[newc]=1;
}
}
}
}
}
assert(0==1);
return 0;
}
/*
5 4 4
7 0 4 9
3 0 8 4
1 1 3 7
5 1 3 4
4 2 2 9
*/
Compilation message
olympiads.cpp: In function 'bool operator<(config, config)':
olympiads.cpp:52:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
52 | for(int i=0;i<x.alesi.size();i++)
| ~^~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1846 ms |
36308 KB |
Output is correct |
2 |
Correct |
1708 ms |
36236 KB |
Output is correct |
3 |
Correct |
1848 ms |
36480 KB |
Output is correct |
4 |
Correct |
1441 ms |
8932 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
488 ms |
32796 KB |
Output is correct |
2 |
Correct |
480 ms |
29916 KB |
Output is correct |
3 |
Correct |
483 ms |
31360 KB |
Output is correct |
4 |
Correct |
436 ms |
29916 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2050 ms |
232208 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1846 ms |
36308 KB |
Output is correct |
2 |
Correct |
1708 ms |
36236 KB |
Output is correct |
3 |
Correct |
1848 ms |
36480 KB |
Output is correct |
4 |
Correct |
1441 ms |
8932 KB |
Output is correct |
5 |
Correct |
488 ms |
32796 KB |
Output is correct |
6 |
Correct |
480 ms |
29916 KB |
Output is correct |
7 |
Correct |
483 ms |
31360 KB |
Output is correct |
8 |
Correct |
436 ms |
29916 KB |
Output is correct |
9 |
Execution timed out |
2050 ms |
232208 KB |
Time limit exceeded |
10 |
Halted |
0 ms |
0 KB |
- |