oj.uz

답안 #775808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
775808 2023-07-07T04:00:45 Z marvinthang Chorus (JOI23_chorus) C++17
61 / 100
 6272 ms 399744 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; }

// end of template

const int MAX = 5005;
const long long INF = 1e18;

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

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

long long cost[MAX][MAX];
long long dp[MAX];
int cnt[MAX];

void calc(long long c) {
	FORE(i, 1, N) {
		dp[i] = INF;
		cnt[i] = i;
		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);
		}
	}
}

void process(void) {
	REP(i, 2 * N) pos[S[i] - 'A'].push_back(i);
	REP(l, N) {
		int p = l;
		long long cur = 0;
		FOR(r, l, N) {
			while (p < N && pos[1][p] < pos[0][r]) ++p;
			cur += p - l;
			cost[l][r] = cur;
		}
	}
	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:86:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   86 |   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:98:2: note: in expansion of macro 'file'
   98 |  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:98:2: note: in expansion of macro 'file'
   98 |  file("chorus");
      |  ^~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 10 ms 3360 KB Output is correct
19 Correct 10 ms 3284 KB Output is correct
20 Correct 9 ms 3284 KB Output is correct
21 Correct 9 ms 3284 KB Output is correct
22 Correct 9 ms 3284 KB Output is correct
23 Correct 9 ms 3284 KB Output is correct
24 Correct 12 ms 3356 KB Output is correct
25 Correct 11 ms 3352 KB Output is correct
26 Correct 11 ms 3356 KB Output is correct
27 Correct 10 ms 3344 KB Output is correct
28 Correct 9 ms 3352 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 10 ms 3360 KB Output is correct
19 Correct 10 ms 3284 KB Output is correct
20 Correct 9 ms 3284 KB Output is correct
21 Correct 9 ms 3284 KB Output is correct
22 Correct 9 ms 3284 KB Output is correct
23 Correct 9 ms 3284 KB Output is correct
24 Correct 12 ms 3356 KB Output is correct
25 Correct 11 ms 3352 KB Output is correct
26 Correct 11 ms 3356 KB Output is correct
27 Correct 10 ms 3344 KB Output is correct
28 Correct 9 ms 3352 KB Output is correct
29 Correct 5650 ms 114256 KB Output is correct
30 Correct 6068 ms 117488 KB Output is correct
31 Correct 6133 ms 117492 KB Output is correct
32 Correct 6257 ms 117568 KB Output is correct
33 Correct 6183 ms 117476 KB Output is correct
34 Correct 6272 ms 117484 KB Output is correct
35 Correct 6099 ms 117484 KB Output is correct
36 Correct 6241 ms 117488 KB Output is correct
37 Correct 6149 ms 117496 KB Output is correct
38 Correct 6101 ms 117500 KB Output is correct
39 Correct 6000 ms 117568 KB Output is correct
40 Correct 6099 ms 117452 KB Output is correct
41 Correct 6086 ms 117456 KB Output is correct
42 Correct 6127 ms 117488 KB Output is correct

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 10 ms 3360 KB Output is correct
19 Correct 10 ms 3284 KB Output is correct
20 Correct 9 ms 3284 KB Output is correct
21 Correct 9 ms 3284 KB Output is correct
22 Correct 9 ms 3284 KB Output is correct
23 Correct 9 ms 3284 KB Output is correct
24 Correct 12 ms 3356 KB Output is correct
25 Correct 11 ms 3352 KB Output is correct
26 Correct 11 ms 3356 KB Output is correct
27 Correct 10 ms 3344 KB Output is correct
28 Correct 9 ms 3352 KB Output is correct
29 Correct 5650 ms 114256 KB Output is correct
30 Correct 6068 ms 117488 KB Output is correct
31 Correct 6133 ms 117492 KB Output is correct
32 Correct 6257 ms 117568 KB Output is correct
33 Correct 6183 ms 117476 KB Output is correct
34 Correct 6272 ms 117484 KB Output is correct
35 Correct 6099 ms 117484 KB Output is correct
36 Correct 6241 ms 117488 KB Output is correct
37 Correct 6149 ms 117496 KB Output is correct
38 Correct 6101 ms 117500 KB Output is correct
39 Correct 6000 ms 117568 KB Output is correct
40 Correct 6099 ms 117452 KB Output is correct
41 Correct 6086 ms 117456 KB Output is correct
42 Correct 6127 ms 117488 KB Output is correct
43 Runtime error 2971 ms 399744 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 1108 KB Output is correct
18 Correct 10 ms 3360 KB Output is correct
19 Correct 10 ms 3284 KB Output is correct
20 Correct 9 ms 3284 KB Output is correct
21 Correct 9 ms 3284 KB Output is correct
22 Correct 9 ms 3284 KB Output is correct
23 Correct 9 ms 3284 KB Output is correct
24 Correct 12 ms 3356 KB Output is correct
25 Correct 11 ms 3352 KB Output is correct
26 Correct 11 ms 3356 KB Output is correct
27 Correct 10 ms 3344 KB Output is correct
28 Correct 9 ms 3352 KB Output is correct
29 Correct 5650 ms 114256 KB Output is correct
30 Correct 6068 ms 117488 KB Output is correct
31 Correct 6133 ms 117492 KB Output is correct
32 Correct 6257 ms 117568 KB Output is correct
33 Correct 6183 ms 117476 KB Output is correct
34 Correct 6272 ms 117484 KB Output is correct
35 Correct 6099 ms 117484 KB Output is correct
36 Correct 6241 ms 117488 KB Output is correct
37 Correct 6149 ms 117496 KB Output is correct
38 Correct 6101 ms 117500 KB Output is correct
39 Correct 6000 ms 117568 KB Output is correct
40 Correct 6099 ms 117452 KB Output is correct
41 Correct 6086 ms 117456 KB Output is correct
42 Correct 6127 ms 117488 KB Output is correct
43 Runtime error 2971 ms 399744 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -