답안 #788481

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788481	2023-07-20T09:18:54 Z	hugo_pm	Chorus (JOI23_chorus)	C++17	40 / 100	7000 ms	880 KB

chorus

#include <bits/stdc++.h>
#define int long long
using namespace std;
	
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define sz(v) ((int)((v).size()))
	
template<typename T>
void chmax(T &x, const T &v) { if (x < v) x = v; }
template<typename T>
void chmin(T &x, const T &v) { if (x > v) x = v; }
	
using pii = pair<int, int>;
using vi = vector<int>;
	
string to_string(string s) { return s; }
template <typename T> string to_string(T v) {
	bool first = true;
	string res = "[";
	for (const auto &x : v) {
		if (!first)
			res += ", ";
		first = false;
		res += to_string(x);
	}
	res += "]";
	return res;
}
	
void dbg_out() { cout << endl; }
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T) {
	cout << ' ' << to_string(H);
	dbg_out(T...);
}
	
#ifdef DEBUG
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif
	
const int INF = 1e12;
struct Line {
	int m, p;
	int eval(int x) { return m*x+p; }
};

struct LineContainer {
	vector<Line> fs;
	void add(Line l) {
		fs.push_back(l);
	}
	int min(int x) {
		int ret = INF;
		for (Line f : fs) {
			chmin(ret, f.eval(x));
		}
		return ret;
	}
};

int N, K;
string S;
// ferme[i] = nombre d'ouvrants avant Fi
vector<int> ouvre, ferme;
vector<int> cumuFerme;
int coutExclus(int left, int right) {
	if (left >= right) {
		return 0;
	}
	int projExclus = min(right, ouvre[right-1]);
	if (projExclus <= left) return 0;
	return (projExclus - left)*(right) - (cumuFerme[projExclus] - cumuFerme[left]);
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> N >> K >> S;
	{
		int curOuvre = 0, curFerme = 0;
		cumuFerme.push_back(0);
		for (char c : S) {
			if (c == 'A') {
				++curOuvre;
				ouvre.push_back(curFerme);
			} else {
				++curFerme;
				ferme.push_back(curOuvre);
				cumuFerme.push_back(cumuFerme.back() + curOuvre);
			}
		}
	}
	
	vector<int> old(N+1, INF), now;
	old[N] = 0;
	rep(nbCoup, 1, K+1) {
		now.assign(N+1, INF);
		LineContainer cont;
		// [J EXCLUS]
		// gright(left) = (projExclus - left)*(right) - (cumuFerme[projExclus] - cumuFerme[left])
		// gj(x) = (pj - x)*j - (cf[pj] - cf[left])
		// gj(x) = -jx + (j*pj - cf[pj]) + cf[x]
		//         mx  + p               + terme fixe
		auto getWithFix = [&] (int x) {
			return cont.min(x) + cumuFerme[x];
		};
		auto proj = [&] (int j) {
			return min(j, ouvre[j-1]);
		};
		auto add = [&] (int j) {
			int pj = proj(j);
			cont.add({-j, old[j] + j*pj - cumuFerme[pj]});
		};
		int jToAdd = N;
		for (int left = N-1; left >= 0; --left) {
			while (jToAdd > 0 && left <= proj(jToAdd)) {
				add(jToAdd--);
			}
			chmin(now[left], getWithFix(left));
			if (jToAdd > 0) {
				chmin(now[left], old[jToAdd] + coutExclus(left, jToAdd));
			}
		}
		old = now;
	}
	cout << old[0] << '\n';
}

Subtask #1
16.0 / 16.0

#	결과	메모리	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct
8	Correct	212 KB	Output is correct
9	Correct	212 KB	Output is correct
10	Correct	212 KB	Output is correct
11	Correct	212 KB	Output is correct
12	Correct	212 KB	Output is correct
13	Correct	212 KB	Output is correct
14	Correct	212 KB	Output is correct
15	Correct	212 KB	Output is correct
16	Correct	212 KB	Output is correct

Subtask #2
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	14 ms	356 KB	Output is correct
19	Correct	34 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	64 ms	340 KB	Output is correct
23	Correct	67 ms	340 KB	Output is correct
24	Correct	2 ms	340 KB	Output is correct
25	Correct	64 ms	336 KB	Output is correct
26	Correct	53 ms	340 KB	Output is correct
27	Correct	22 ms	364 KB	Output is correct
28	Correct	22 ms	340 KB	Output is correct

Subtask #3
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	14 ms	356 KB	Output is correct
19	Correct	34 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	64 ms	340 KB	Output is correct
23	Correct	67 ms	340 KB	Output is correct
24	Correct	2 ms	340 KB	Output is correct
25	Correct	64 ms	336 KB	Output is correct
26	Correct	53 ms	340 KB	Output is correct
27	Correct	22 ms	364 KB	Output is correct
28	Correct	22 ms	340 KB	Output is correct
29	Execution timed out	7041 ms	880 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #4
0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	14 ms	356 KB	Output is correct
19	Correct	34 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	64 ms	340 KB	Output is correct
23	Correct	67 ms	340 KB	Output is correct
24	Correct	2 ms	340 KB	Output is correct
25	Correct	64 ms	336 KB	Output is correct
26	Correct	53 ms	340 KB	Output is correct
27	Correct	22 ms	364 KB	Output is correct
28	Correct	22 ms	340 KB	Output is correct
29	Execution timed out	7041 ms	880 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	14 ms	356 KB	Output is correct
19	Correct	34 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	64 ms	340 KB	Output is correct
23	Correct	67 ms	340 KB	Output is correct
24	Correct	2 ms	340 KB	Output is correct
25	Correct	64 ms	336 KB	Output is correct
26	Correct	53 ms	340 KB	Output is correct
27	Correct	22 ms	364 KB	Output is correct
28	Correct	22 ms	340 KB	Output is correct
29	Execution timed out	7041 ms	880 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

답안 #788481

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 24.0 / 24.0

Subtask #3 0 / 21.0

Subtask #4 0 / 26.0

Subtask #5 0 / 13.0

Subtask #1
16.0 / 16.0

Subtask #2
24.0 / 24.0

Subtask #3
0 / 21.0

Subtask #4
0 / 26.0

Subtask #5
0 / 13.0