제출 #1178627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1178627		DeMen100ns	Olympiads (BOI19_olympiads)	C++20	44 / 100	1064 ms	327680 KiB

olympiads

/*
Author : DeMen100ns (Vo Khac Trieu)
School: University of Science, VNU-HCM
Aim: 
- International Grandmaster Codeforces (2600) 
- ICPC World Final 2025
*/

#include <bits/stdc++.h>

#define int long long

using namespace std;

const long long INF = numeric_limits<long long>::max() / 2;
const int INF_int = 1e9 + 7;

struct State{
    int val;
    vector <int> v;

    State(vector <int> v, vector <vector<int>> &a, int k): v(v){
        vector <int> ans(k, 0);
        for(int i = 0; i < k; ++i){
            for(int j = 0; j < k; ++j){
                ans[i] = max(ans[i], a[v[j]][i]);
            }
        }
        val = accumulate(ans.begin(), ans.end(), 0);
    }

    bool operator <(const State &a) const{
        return val < a.val;
    }
};

void solve(){
    int n, k, c; cin >> n >> k >> c;
    vector <vector<int>> a(n, vector<int>(k, 0));

    for(int i = 0; i < n; ++i){
        for(int j = 0; j < k; ++j) cin >> a[i][j];
    }
    
    vector <int> opt;
    vector <bool> choose(n, 0);
    for(int i = 0; i < k; ++i){
        vector <array<int, 2>> v;
        for(int j = 0; j < n; ++j){
            v.push_back({a[j][i], j});
        }
        sort(v.begin(), v.end(), greater<array<int, 2>>());
        for(auto[val, id]: v){
            if (!choose[id]){
                choose[id] = true;
                opt.push_back(id);
                break;
            }
        }
    }
    sort(opt.begin(), opt.end());

    priority_queue<State, vector<State>> pq;
    set <vector<int>> exist;
    pq.push(State(opt, a, k));
    exist.insert(opt);

    while (c--){
        State u = pq.top(); pq.pop();

        if (c == 0){
            cout << u.val << endl;
            return;
        }

        for(int i = 0; i < k; ++i){
            for(int val = 0; val < n; ++val){
                bool f = true;
                for(int i : u.v) f &= (i != val);
                if (!f) continue;

                vector <int> v = u.v;
                v[i] = val;
                sort(v.begin(), v.end());

                if (exist.find(v) != exist.end()) continue;
                pq.push(State(v, a, k));
                exist.insert(v);
            }
        }
    }
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    int t = 1; // cin >> t;
    for(int test = 1; test <= t; ++test){
        solve();
    }
}

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