oj.uz

Submission #735481

# Submission time Handle Problem Language Result Execution time Memory
735481 2023-05-04T07:57:40 Z Vanilla Olympiads (BOI19_olympiads) C++17
44 / 100
 368 ms 16832 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 501;
const int maxk = 10;
int dp[maxk * 10 + 1]; // dp[i] -> nr of teams with total score i
vector <int> v;
int a[maxn][maxk];
int comb[maxk];
int n,k,c;

void back (int step) {
    if (step == k) {
        vector <int> rs(k);
        for (int i = 1; i <= k; i++){
            for (int j = 0; j < k; j++){
                rs[j] = max(rs[j], a[comb[i]][j]);
            }
        }
        int s = 0;
        for (int i = 0; i < k; i++) s+=rs[i];
        v.push_back(s);
        return;
    }
    for (int i = comb[step] + 1; i < n; i++){
        comb[step + 1] = i;
        back(step + 1);
        comb[step + 1] = -1;
    }
}

void solve(int id){
    
    return;
}


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    cin >> n >> k >> c;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < k; j++){
            cin >> a[i][j];
        }
    }
    if (k <= 2 || n <= 40) { // subtask 1-2
        comb[0] = -1;
        back(0);
        nth_element(v.begin(), v.begin() + c - 1, v.end(), greater <int> ());
        cout << v[c-1];
    }
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 984 KB Output is correct
2 Correct 10 ms 984 KB Output is correct
3 Correct 5 ms 984 KB Output is correct
4 Correct 4 ms 984 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 368 ms 16764 KB Output is correct
2 Correct 329 ms 16828 KB Output is correct
3 Correct 299 ms 16832 KB Output is correct
4 Correct 296 ms 16752 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 984 KB Output is correct
2 Correct 10 ms 984 KB Output is correct
3 Correct 5 ms 984 KB Output is correct
4 Correct 4 ms 984 KB Output is correct
5 Correct 368 ms 16764 KB Output is correct
6 Correct 329 ms 16828 KB Output is correct
7 Correct 299 ms 16832 KB Output is correct
8 Correct 296 ms 16752 KB Output is correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -