Submission #134131

#	Time	Username	Problem	Language	Result	Execution time	Memory
134131		dvdg6566	Olympiads (BOI19_olympiads)	C++14	44 / 100	1254 ms	262148 KiB

olympiads

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define mp make_pair
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define ALL(X) X.begin(),X.end()
#define SZ(X) (int)X.size()
#define MAXN 1001000
#define INF 1e9

int N,K,C;
int mem[510][10];
vi st;
vi cur;

void rec(){
    if (SZ(cur) == K+1){
        // for (auto i:cur)cout<<i<<' ';cout<<'\n';
        int ans = 0;
        for (int i=0;i<K;++i){
            int t=0;
            for (int j=1;j<SZ(cur);++j)t=max(t,mem[cur[j]][i]);
            ans += t;
        }
        st.pb(ans);
        return;
    }
    int lst = cur.back()+1;
    for (int i=lst;i<=N;++i){
        cur.pb(i);
        rec();
        cur.pop_back();
    }
}

int main(){
    // freopen("in.txt","r",stdin);
    cin>>N>>K>>C;
    for (int i=1;i<=N;++i)for (int j=0;j<K;++j)cin>>mem[i][j];
    cur.pb(0);
    rec();
    sort(ALL(st));
    // for (auto i : st)cout<<i<<' ';cout<<'\n';
    cout<<st[SZ(st) - C];
}

• Subtask 1: 13 / 13
• Subtask 2: 31 / 31
• Subtask 3: 0 / 24
• Subtask 4: 0 / 32