#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9+9;
int n,k,c;
int a[505][7];
int p[505];
struct config
{
int val[7],sumval;
int hsh;
vector<int> alesi;
void baga(int x)
{
alesi.push_back(x);
hsh = (hsh + p[x])%MOD;
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)
{
hsh = (hsh + MOD - p[alesi[poz]])%MOD;
alesi[poz] = newv;
hsh = (hsh + p[alesi[poz]])%MOD;
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;
return x.hsh < y.hsh;
}
bool ales[505];
config init;
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
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);
p[0]=1;
p[1]=997;
for(int i=2;i<=n;i++)
p[i] = p[i-1]*p[1]%MOD;
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;
while(!pq.empty())
{
config aux = pq.top();
pq.pop();
cnt++;
if(cnt==c)
{
cout<<aux.sumval;
return 0;
}
for(int s=0;s<k;s++)
{
int vechi = aux.alesi[s];
for(int i=1;i<=n;i++)
{
if(!aux.is_ales(i))
{
config newc = aux;
newc.schimba(s,i);
if(newc.sumval <= aux.sumval && !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 'int main()':
olympiads.cpp:104:17: warning: unused variable 'vechi' [-Wunused-variable]
104 | int vechi = aux.alesi[s];
| ^~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1529 ms |
38156 KB |
Output is correct |
2 |
Correct |
1571 ms |
37920 KB |
Output is correct |
3 |
Correct |
1824 ms |
38116 KB |
Output is correct |
4 |
Execution timed out |
2067 ms |
38092 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
414 ms |
34972 KB |
Output is correct |
2 |
Correct |
347 ms |
32568 KB |
Output is correct |
3 |
Correct |
373 ms |
32492 KB |
Output is correct |
4 |
Correct |
356 ms |
32492 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2078 ms |
240432 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1529 ms |
38156 KB |
Output is correct |
2 |
Correct |
1571 ms |
37920 KB |
Output is correct |
3 |
Correct |
1824 ms |
38116 KB |
Output is correct |
4 |
Execution timed out |
2067 ms |
38092 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |