oj.uz

답안 #146936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146936 2019-08-26T17:21:40 Z Vlatko Olympiads (BOI19_olympiads) C++14
31 / 100
 20 ms 632 KB 
#include <bits/stdc++.h>
using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 500;
const int maxk = 6;

int n, k, c;
int p[maxn][maxk];

struct State {
    int score, start;
    int best[maxk]; // indices of people in team
    bitset<maxk> forbidden; // indices already used

    State() {
        start = 0;
        calc_score();
    }
    State(State* pre, int new_start) {
        start = new_start;
        forbidden = pre->forbidden;
        forbidden[pre->best[start]] = true;
        for (int i = 0; i < start; ++i) {
            best[i] = pre->best[i];
        }
        calc_score();
    }
    void calc_score() {
        for (int j = start; j < k; ++j) {
            int besti = -1;
            for (int i = 0; i < n; ++i) {
                if (forbidden[i] || in_best(j, i)) {
                    continue;
                }
                if (besti == -1 || p[i][j] > p[besti][j]) {
                    besti = i;
                }
            }
            if (besti == -1) {
                score = -1e9;
                return;
            }
            best[j] = besti;
        }
        score = 0;
        for (int j = 0; j < k; ++j) {
            int res = 0;
            for (int i = 0; i < k; ++i) {
                res = max(res, p[best[i]][j]);
            }
            score += res;
        }
    }
    bool in_best(int end, int x) {
        for (int i = 0; i < end; ++i) {
            if (best[i] == x) {
                return true;
            }
        }
        return false;
    }
};

struct State_Compare {
    bool operator () (State* l, State* r) {
        return l->score < r->score;
    }
};

priority_queue<State*, vector<State*>, State_Compare> pq;

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> n >> k >> c;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < k; ++j) {
            cin >> p[i][j];
        }
    }
    int ans = 0;
    pq.push(new State());
    State* top;
    while (c--) {
        top = pq.top();
        pq.pop();
        ans = top->score;
        for (int i = top->start; i < k; ++i) {
            pq.push(new State(top, i));
        }
    }
    cout << ans << endl;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 6 ms 632 KB Output is correct
4 Correct 5 ms 504 KB Output is correct

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 632 KB Output is correct
2 Correct 9 ms 504 KB Output is correct
3 Incorrect 20 ms 504 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -