oj.uz

답안 #949596

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949596 2024-03-19T11:48:20 Z LucaIlie Olympiads (BOI19_olympiads) C++17
13 / 100
 2000 ms 568 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 500;
const int MAX_K = 6;

struct team {
    int total;
    int score[MAX_K];

    void init() {
        total = 0;
        for ( int i = 0; i < MAX_K; i++ )
            score[i] = 0;
    }

    bool operator < ( const team &t ) const {
        return total < t.total;
    }

    team operator + ( const team &t ) const {
        team ans;

        ans.total = 0;
        for ( int i = 0; i < MAX_K; i++ ) {
            ans.score[i] = max( score[i], t.score[i] );
            ans.total += ans.score[i];
        }

        return ans;
    }
};

team students[MAX_N + 1];
int maxScore[MAX_N + 2][1 << MAX_K];

int n, k, m, cnt;
void bckt( int c, int s, int p, team crt ) {
    if ( cnt >= m )
        return;

    if ( c > n - p )
        return;

    if ( c == 0 ) {
        if ( crt.total >= s )
            cnt++;
        return;
    }

    int maxS = 0;
    for ( int mask = 0; mask < (1 << k); mask++ ) {
        int score = 0;
        for ( int j = 0; j < k; j++ ) {
            if ( (mask >> j) & 1 )
                continue;
            score += crt.score[j];
        }
        maxS = max( maxS, score + maxScore[p + 1][mask] );
    }

    if ( maxS < s )
        return;


    for ( int i = p + 1; i <= n; i++ )
        bckt( c - 1, s, i, crt + students[i] );
}

int main() {
    cin >> n >> k >> m;
    for ( int i = 1; i <= n; i++ ) {
        for ( int j = 0; j < k; j++ ) {
            cin >> students[i].score[j];
            students[i].total += students[i].score[j];
        }
    }

    for ( int i = n; i >= 1; i-- ) {
        for ( int maskPrv = 0; maskPrv < (1 << k); maskPrv++ ) {
            for ( int mask = 0; mask < (1 << k); mask++ ) {
                if ( (maskPrv & mask) > 0 )
                    continue;

                int s = 0;
                for ( int j = 0; j < k; j++ ) {
                    if ( (mask >> j) & 1 )
                        s += students[i].score[j];
                }

                int maskCrt = (maskPrv | mask);
                maxScore[i][maskCrt] = max( maxScore[i][maskCrt], maxScore[i + 1][maskPrv] + s );
            }
        }
    }

    int st = 0, dr = maxScore[1][(1 << k) - 1] + 1;
    while ( dr - st > 1 ) {
        int mij = (st + dr) / 2;

        cnt = 0;
        team crt;
        crt.init();
        bckt( k, mij, 0, crt );

        if ( cnt < m )
            dr = mij;
        else
            st = mij;
    }

    cout << st;

    return 0;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 348 KB Output is correct
2 Correct 10 ms 568 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1681 ms 428 KB Output is correct
2 Correct 1282 ms 428 KB Output is correct
3 Execution timed out 2056 ms 348 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 348 KB Output is correct
2 Correct 6 ms 348 KB Output is correct
3 Execution timed out 2086 ms 396 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 348 KB Output is correct
2 Correct 10 ms 568 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1681 ms 428 KB Output is correct
6 Correct 1282 ms 428 KB Output is correct
7 Execution timed out 2056 ms 348 KB Time limit exceeded
8 Halted 0 ms 0 KB -