oj.uz

답안 #584299

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
584299 2022-06-27T07:28:21 Z amunduzbaev Olympiads (BOI19_olympiads) C++17
13 / 100
 2000 ms 7468 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
typedef int64_t ll;
//~ #define int ll

const int K = 7;
vector<ar<int, K>> dp[2][K];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, k, c; cin>>n>>k>>c;
	dp[0][0].push_back({});
	
	auto add = [&](auto& a, auto& b){
		ar<int, K> res {};
		for(int j=1;j<K;j++){
			res[j] = max(a[j], b[j]);
			res[0] += res[j];
		} return res;
	};
	
	for(int i=1;i<=n;i++){
		ar<int, K> a {};
		for(int j=1;j<=k;j++){
			cin>>a[j];
		}
		
		int t = i & 1, p = !t;
		for(int j=0;j<=k;j++){
			dp[t][j].clear();
			dp[t][j].insert(dp[t][j].end(), dp[p][j].begin(), dp[p][j].end());
			if(j){
				for(auto x : dp[p][j - 1]){
					dp[t][j].push_back(add(x, a));
				}
				sort(dp[t][j].begin(), dp[t][j].end(), [&](auto& a, auto& b){
					return a[0] > b[0];
				});
				while((int)dp[t][j].size() > c * k) dp[t][j].pop_back();
			}
		}
	}
	
	assert((int)dp[n & 1][k].size() >= c);
	cout<<dp[n & 1][k][c - 1][0]<<"\n";
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 596 KB Output is correct
2 Correct 51 ms 712 KB Output is correct
3 Correct 53 ms 724 KB Output is correct
4 Correct 69 ms 712 KB Output is correct

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 76 ms 5108 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2061 ms 7468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 596 KB Output is correct
2 Correct 51 ms 712 KB Output is correct
3 Correct 53 ms 724 KB Output is correct
4 Correct 69 ms 712 KB Output is correct
5 Incorrect 76 ms 5108 KB Output isn't correct
6 Halted 0 ms 0 KB -