oj.uz

답안 #880866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880866 2023-11-30T07:30:19 Z vjudge1 Olympiads (BOI19_olympiads) C++17
44 / 100
 372 ms 262144 KB 
/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;

template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;

constexpr int MOD = 1e9 + 7, N = 2e5 + 8, M = 1e5, SQ = 300, INF = 2e18 + 8, LGN = 21, mod = 998244353, P = 131113;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, k, c;
vector <int> v;
vector <int> p[508];

int32_t main(){
  fast_io;
  cin >> n >> k >> c;
  for (int i = 0; i < n; ++ i){
    for (int j = 0; j < k; ++ j){
      int aa;
      cin >> aa;
      p[i].pb(aa);
    }
  }
  if (k == 6){
    for (int i1 = 0; i1 < n; ++ i1){
      int tmp = 0;
      for (int i2 = 0; i2 < i1; ++ i2){
        for (int i3 = 0; i3 < i2; ++ i3){
          for (int i4 = 0; i4 < i3; ++ i4){
            for (int i5 = 0; i5 < i4; ++ i5){
              for (int i6 = 0; i6 < i5; ++ i6){
                tmp = 0;
                for (int o = 0; o < k; ++ o){
                  tmp += max (p[i1][o], max (p[i2][o], max (p[i3][o], max (p[i4][o], max (p[i5][o], p[i6][o])))));
                }
                v.pb(tmp);
              }
            }
          }
        }
      }
    }
    sort (all(v));
    cout << v[v.size()-c] << '\n';
  }
  if (k == 5){
    for (int i1 = 0; i1 < n; ++ i1){
      int tmp = 0;
      for (int i2 = 0; i2 < i1; ++ i2){
        for (int i3 = 0; i3 < i2; ++ i3){
          for (int i4 = 0; i4 < i3; ++ i4){
            for (int i5 = 0; i5 < i4; ++ i5){
              tmp = 0;
              for (int o = 0; o < k; ++ o){
                tmp += max (p[i1][o], max (p[i2][o], max (p[i3][o], max (p[i4][o], p[i5][o]))));
              }
              v.pb(tmp);
            }
          }
        }
      }
    }
    sort (all(v));
    cout << v[v.size()-c] << '\n';
  }
  if (k == 4){
    for (int i1 = 0; i1 < n; ++ i1){
      int tmp = 0;
      for (int i2 = 0; i2 < i1; ++ i2){
        for (int i3 = 0; i3 < i2; ++ i3){
          for (int i4 = 0; i4 < i3; ++ i4){
            tmp = 0;
            for (int o = 0; o < k; ++ o){
              tmp += max (p[i1][o], max (p[i2][o], max (p[i3][o], p[i4][o])));
            }
            v.pb(tmp);
          }
        }
      }
    }
    sort (all(v));
    cout << v[v.size()-c] << '\n';
  }
  if (k == 3){
    for (int i1 = 0; i1 < n; ++ i1){
      int tmp = 0;
      for (int i2 = 0; i2 < i1; ++ i2){
        for (int i3 = 0; i3 < i2; ++ i3){
          tmp = 0;
          for (int o = 0; o < k; ++ o){
            tmp += max (p[i1][o], max (p[i2][o], p[i3][o]));
          }
          v.pb(tmp);
        }
      }
    }
    sort (all(v));
    cout << v[v.size()-c] << '\n';
  }
  if (k == 2){
    for (int i = 0; i < n; ++ i){
      int tmp = 0;
      for (int j = 0; j < i; ++ j){
        tmp = 0;
        for (int o = 0; o < k; ++ o){
          tmp += max (p[i][o], p[j][o]);
        }
        v.pb(tmp);
      }
    }
    sort (all(v));
    cout << v[v.size()-c] << '\n';
  }
  if (k == 1){
    for (int i = 0; i < n; ++ i){
      int tmp = 0;
      for (int o = 0; 0 < k; ++ o){
        tmp += p[i][o];
      }
      v.pb(tmp);
    }
    sort (all(v));
    cout << v[v.size()-c] << '\n';
  }
  return 0;
}

// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

Subtask #1
13.0 / 13.0

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

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 305 ms 35364 KB Output is correct
2 Correct 296 ms 34480 KB Output is correct
3 Correct 295 ms 34988 KB Output is correct
4 Correct 307 ms 33976 KB Output is correct

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 372 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1492 KB Output is correct
2 Correct 6 ms 1492 KB Output is correct
3 Correct 5 ms 1496 KB Output is correct
4 Correct 3 ms 1496 KB Output is correct
5 Correct 305 ms 35364 KB Output is correct
6 Correct 296 ms 34480 KB Output is correct
7 Correct 295 ms 34988 KB Output is correct
8 Correct 307 ms 33976 KB Output is correct
9 Runtime error 372 ms 262144 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -