oj.uz

Submission #776296

# Submission time Handle Problem Language Result Execution time Memory
776296 2023-07-07T15:25:15 Z Arturgo Chorus (JOI23_chorus) C++14
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int INFINI = 1e18;

int N, K;
string types;

vector<int> ouvrantes, fermantes;
vector<int> derFermantes, cumOuvrAvant;

// bornes incluses
int cout_transition(int i, int j) {
	int df = derFermantes[j];
	
	if(df < i) return 0;
	
	int deb = i;
	int fin = min(j, df);
	
	return (j + 1) * (fin - deb + 1)
	- (cumOuvrAvant[fin + 1] - cumOuvrAvant[deb]);
}

pair<int, int> calc(int coutGroupe) {
	vector<pair<int, int>> dyns;
	
	dyns.push_back({0, 0});
	for(int pos = 0;pos < N;pos++) {
		pair<int, int> mini = {INFINI, 0};
		
		for(int deb = 0;deb <= pos;deb++) {
			mini = min(mini, {
				cout_transition(deb, pos)
				+ dyns[deb].first
				+ coutGroupe, 
				dyns[deb].second + 1
			});
		}
		
		dyns.push_back(mini);
	}
	
	return dyns.back();
}

signed main() {
	cin >> N >> K;
	cin >> types;
	
	cumOuvrAvant.push_back(0);
	
	for(int i = 0;i < 2 * N;i++) {
		if(types[i] == 'A') {
			ouvrantes.push_back(i);
			derFermantes.push_back((int)fermantes.size() - 1);
		}
		else {
			fermantes.push_back(i);
			cumOuvrAvant.push_back(
				cumOuvrAvant.back()
				+ (int)ouvrantes.size()			
			);
		}
	}
	
	int deb = 0, fin = 1000ll * 1000 * 1000 * 1000ll;
	
	while(fin - deb > 1) {
		int mil = (deb + fin) / 2;
		
		pair<int, int> solOpt = calc(mil);
		if(solOpt.second > K) {
			deb = mil;
		}
		else {
			fin = mil;
		}
	}
	
	pair<int, int> solOpt = calc(deb + 1);
	cout << solOpt.first - (deb + 1) * solOpt.second << endl;
	return 0;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -