oj.uz

답안 #775817

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775817 2023-07-07T04:37:18 Z marvinthang Chorus (JOI23_chorus) C++17
61 / 100
 6 ms 2448 KB 
/*************************************
*    author: marvinthang             *
*    created: 07.07.2023 10:11:54    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

const long long INF = 1e18;

struct Line {
    long long a, b;
    int cnt;
    Line(long long a = 0, long long b = INF, int cnt = 0): a(a), b(b), cnt(cnt) {}
    long long eval(long long x) { return a * x + b; }
};

struct ConvexHullTrick {
    vector <Line> lines;
    int ptr;
    ConvexHullTrick(): ptr(0) {}
    bool bad(Line a, Line b, Line c) {
        return (long double) (c.b - a.b) / (a.a - c.a) < (long double) (b.b - a.b) / (a.a - b.a);
    }
    void addLine(long long a, long long b, int c) {
        Line l(a, b, c);
        while (lines.size() >= 2 && bad(lines.end()[-2], lines.back(), l)) lines.pop_back();
        lines.push_back(l);
    }
    Line getMin(long long x) {
        if (ptr >= (int) lines.size()) ptr = (int) lines.size() - 1;
        while (ptr < (int) lines.size() - 1 && lines[ptr].eval(x) > lines[ptr + 1].eval(x)) ++ptr;
        return lines[ptr];
    }
};

// end of template

const int MAX = 5005;

int N, K;
string S;
vector <int> pos[2];

void init(void) {
	cin >> N >> K >> S;
}

long long dp[MAX], pref[MAX], add[MAX];
int cnt[MAX], pf[MAX];

void calc(long long c) {
	ConvexHullTrick cht;
	FORE(i, 1, N) {
		int j = i - 1;
		cht.addLine(-j, dp[j] + j * j - pref[j] + add[j], cnt[j]);
		Line l = cht.getMin(i);
		dp[i] = l.eval(i) + pref[i] + c;
		cnt[i] = l.cnt + 1;
		// REP(j, i) {
		// 	if (minimize(dp[i], dp[j] + cost[j][i - 1] + c)) cnt[i] = cnt[j] + 1;
		// 	else if (dp[i] == dp[j] + cost[j][i - 1] + c) minimize(cnt[i], cnt[j] + 1);
		// }
		j = pf[j];
		if (j < i) {
			if (minimize(dp[i], dp[j] + c)) cnt[i] = cnt[j] + 1;
			else if (dp[i] == dp[j] + c) minimize(cnt[i], cnt[j] + 1);
		}
	}
}

void process(void) {
	REP(i, 2 * N) pos[S[i] - 'A'].push_back(i);
	int j = 0;
	REP(i, N) {
		while (j < N && pos[1][j] < pos[0][i]) ++j;
		pf[i] = j;
		pref[i + 1] = pref[i] + j;
	}
	j = 0;
	REP(i, N) {
		j = max(j, i);
		while (j < N && pf[j] <= i) ++j;
		add[i] = 1LL * (j - i) * i + pref[i] - pref[j];
	}

	long long l = 0, r = INF;
	while (l <= r) {
		long long m = l + r >> 1;
		calc(m);
		if (cnt[N] <= K) r = m - 1;
		else l = m + 1;
	}
	calc(l);
	cout << dp[N] - l * K << '\n';

}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("chorus");
	init();
	process();
	cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

chorus.cpp: In function 'void process()':
chorus.cpp:125:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  125 |   long long m = l + r >> 1;
      |                 ~~^~~
chorus.cpp: In function 'int main()':
chorus.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
chorus.cpp:137:2: note: in expansion of macro 'file'
  137 |  file("chorus");
      |  ^~~~
chorus.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
chorus.cpp:137:2: note: in expansion of macro 'file'
  137 |  file("chorus");
      |  ^~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 332 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 6 ms 960 KB Output is correct
30 Correct 6 ms 880 KB Output is correct
31 Correct 6 ms 892 KB Output is correct
32 Correct 4 ms 728 KB Output is correct
33 Correct 5 ms 728 KB Output is correct
34 Correct 5 ms 880 KB Output is correct
35 Correct 5 ms 860 KB Output is correct
36 Correct 6 ms 732 KB Output is correct
37 Correct 6 ms 744 KB Output is correct
38 Correct 5 ms 892 KB Output is correct
39 Correct 6 ms 880 KB Output is correct
40 Correct 5 ms 892 KB Output is correct
41 Correct 5 ms 876 KB Output is correct
42 Correct 5 ms 820 KB Output is correct

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 6 ms 960 KB Output is correct
30 Correct 6 ms 880 KB Output is correct
31 Correct 6 ms 892 KB Output is correct
32 Correct 4 ms 728 KB Output is correct
33 Correct 5 ms 728 KB Output is correct
34 Correct 5 ms 880 KB Output is correct
35 Correct 5 ms 860 KB Output is correct
36 Correct 6 ms 732 KB Output is correct
37 Correct 6 ms 744 KB Output is correct
38 Correct 5 ms 892 KB Output is correct
39 Correct 6 ms 880 KB Output is correct
40 Correct 5 ms 892 KB Output is correct
41 Correct 5 ms 876 KB Output is correct
42 Correct 5 ms 820 KB Output is correct
43 Runtime error 3 ms 2448 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 6 ms 960 KB Output is correct
30 Correct 6 ms 880 KB Output is correct
31 Correct 6 ms 892 KB Output is correct
32 Correct 4 ms 728 KB Output is correct
33 Correct 5 ms 728 KB Output is correct
34 Correct 5 ms 880 KB Output is correct
35 Correct 5 ms 860 KB Output is correct
36 Correct 6 ms 732 KB Output is correct
37 Correct 6 ms 744 KB Output is correct
38 Correct 5 ms 892 KB Output is correct
39 Correct 6 ms 880 KB Output is correct
40 Correct 5 ms 892 KB Output is correct
41 Correct 5 ms 876 KB Output is correct
42 Correct 5 ms 820 KB Output is correct
43 Runtime error 3 ms 2448 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -