Submission #643985

#	Time	Username	Problem	Language	Result	Execution time	Memory
643985		mychecksedad	Olympiads (BOI19_olympiads)	C++17	44 / 100	485 ms	16940 KiB

olympiads

/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 305, F = 2147483646, K = 20;



int n, k, c, a[600][7];
void solve(){
    cin >> n >> k >> c;
    for(int i = 1; i <= n; ++i) for(int j = 0; j < 6; ++j) a[i][j] = 0;
    for(int i = 1; i <= n; ++i){
        for(int j = 0; j < k; ++j) cin >> a[i][j];
    }
    if(k <= 2){
        vector<int> v;
        for(int i = 1; i <= n; ++i){
            for(int j = i + 1; j <= n; ++j){
                int x = 0, y = 0;
                x = max(a[i][0], a[j][0]);
                y = max(a[i][1], a[j][1]);
                v.pb(x + y);
            }
        }
        sort(all(v), greater<int>());
        cout << v[c - 1];
    }else if(n <= 40){
        vector<int> v;
        if(k == 1){
            for(int h = 1; h <= n; ++h){
                int sum = 0;
                for(int x = 0; x < k; ++x){
                    sum += a[h][x];
                }
                v.pb(sum);
            }
        }else if(k == 2){
            for(int p = 1; p <= n; ++p){
                for(int h = p + 1; h <= n; ++h){
                    int sum = 0;
                    for(int x = 0; x < k; ++x){
                        sum += max({a[p][x], a[h][x]});
                    }
                    v.pb(sum);
                }
            }
        }else if(k == 3){
            for(int o = 1; o <= n; ++o){
                for(int p = o + 1; p <= n; ++p){
                    for(int h = p + 1; h <= n; ++h){
                        int sum = 0;
                        for(int x = 0; x < k; ++x){
                            sum += max({a[o][x], a[p][x], a[h][x]});
                        }
                        v.pb(sum);
                    }
                }
            }
        }else if(k == 4){
            for(int l = 1; l <= n; ++l){
                for(int o = l + 1; o <= n; ++o){
                    for(int p = o + 1; p <= n; ++p){
                        for(int h = p + 1; h <= n; ++h){
                            int sum = 0;
                            for(int x = 0; x < k; ++x){
                                sum += max({a[l][x], a[o][x], a[p][x], a[h][x]});
                            }
                            v.pb(sum);
                        }
                    }
                }
            }
        }else if(k == 5){
            for(int j = 1; j <= n; ++j){
                for(int l = j + 1; l <= n; ++l){
                    for(int o = l + 1; o <= n; ++o){
                        for(int p = o + 1; p <= n; ++p){
                            for(int h = p + 1; h <= n; ++h){
                                cout << j << ' ' << l << ' ' << o << ' ' << p << ' ' << h << '\n';
                                int sum = 0;
                                for(int x = 0; x < k; ++x){
                                    sum += max({a[j][x], a[l][x], a[o][x], a[p][x], a[h][x]});
                                }
                                v.pb(sum);
                            }
                        }
                    }
                }
            }
        }else{
            for(int i = 1; i <= n; ++i){
                for(int j = i + 1; j <= n; ++j){
                    for(int l = j + 1; l <= n; ++l){
                        for(int o = l + 1; o <= n; ++o){
                            for(int p = o + 1; p <= n; ++p){
                                for(int h = p + 1; h <= n; ++h){
                                    int sum = 0;
                                    for(int x = 0; x < k; ++x){
                                        sum += max({a[i][x], a[j][x], a[l][x], a[o][x], a[p][x], a[h][x]});
                                    }
                                    v.pb(sum);
                                }
                            }
                        }
                    }
                }
            }
        }
        sort(all(v), greater<int>());
        cout << v[c - 1];
    }
}



int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message (stderr)

olympiads.cpp: In function 'int main()':
olympiads.cpp:127:16: warning: unused variable 'aa' [-Wunused-variable]
  127 |     int T = 1, aa;
      |                ^~

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