oj.uz

Submission #949513

# Submission time Handle Problem Language Result Execution time Memory
949513 2024-03-19T10:05:25 Z LucaIlie Olympiads (BOI19_olympiads) C++17
13 / 100
 2000 ms 448 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], dp[MAX_N + 1][MAX_K + 1];
 
int m, cnt;
void bckt( int c, int s, int p, int n, team crt ) {
    if ( cnt >= m )
        return;
 
 
    if ( c == 0 ) {
        if ( crt.total >= s )
            cnt++;
        return;
    }
 
    for ( int i = p + 1; i <= n; i++ )
        bckt( c - 1, s, i, n, crt + students[i] );
}
 
int main() {
    int n, k;
 
    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];
        }
    }
 
    int st = 0, dr = 3e6 + 1;
    while ( dr - st > 1 ) {
        int mij = (st + dr) / 2;
 
        cnt = 0;
        team crt;
        crt.init();
        bckt( k, mij, 0, n, crt );
 
        if ( cnt < m )
            dr = mij;
        else
            st = mij;
    }
 
    cout << st;
 
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 348 KB Output is correct
2 Correct 25 ms 348 KB Output is correct
3 Correct 27 ms 448 KB Output is correct
4 Correct 16 ms 448 KB Output is correct

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 909 ms 424 KB Output is correct
2 Incorrect 6 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

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

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 348 KB Output is correct
2 Correct 25 ms 348 KB Output is correct
3 Correct 27 ms 448 KB Output is correct
4 Correct 16 ms 448 KB Output is correct
5 Correct 909 ms 424 KB Output is correct
6 Incorrect 6 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -