oj.uz

Submission #1104405

# Submission time Handle Problem Language Result Execution time Memory
1104405 2024-10-23T16:42:56 Z alexdd Olympiads (BOI19_olympiads) C++17
44 / 100
 2000 ms 240620 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
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]);
        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 - p[alesi[poz]];
        alesi[poz] = newv;
        hsh = hsh + p[alesi[poz]];
        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))
                {
                    aux.schimba(s,i);
                    if(aux.sumval <= aux.sumval && !inq[aux])
                    {
                        pq.push(aux);
                        inq[aux]=1;
                    }
                }
            }
            aux.schimba(s,vechi);
        }
    }
    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:111:35: warning: self-comparison always evaluates to true [-Wtautological-compare]
  111 |                     if(aux.sumval <= aux.sumval && !inq[aux])
      |                        ~~~~~~~~~~ ^~ ~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1889 ms 38092 KB Output is correct
2 Correct 1691 ms 37996 KB Output is correct
3 Correct 1812 ms 38120 KB Output is correct
4 Correct 1328 ms 14452 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 34864 KB Output is correct
2 Correct 422 ms 32452 KB Output is correct
3 Correct 501 ms 32492 KB Output is correct
4 Correct 430 ms 32492 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2057 ms 240620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1889 ms 38092 KB Output is correct
2 Correct 1691 ms 37996 KB Output is correct
3 Correct 1812 ms 38120 KB Output is correct
4 Correct 1328 ms 14452 KB Output is correct
5 Correct 406 ms 34864 KB Output is correct
6 Correct 422 ms 32452 KB Output is correct
7 Correct 501 ms 32492 KB Output is correct
8 Correct 430 ms 32492 KB Output is correct
9 Execution timed out 2057 ms 240620 KB Time limit exceeded
10 Halted 0 ms 0 KB -