oj.uz

Submission #742887

# Submission time Handle Problem Language Result Execution time Memory
742887 2023-05-17T05:33:24 Z flappybird Toilets (JOI16_toilets) C++17
100 / 100
 111 ms 9316 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 201010
#define MAXS 20
#define INF 1000000000000000001
#define bb ' '
#define ln '\n'
#define Ln '\n'
string str[MAX];
ll K[MAX];
int fs[MAX];
int ms[MAX];
struct node {
	ll sum = 0;
	ll lmx = 0;
	node(ll x = 0) { sum = lmx = x; }
};
node operator+(node n1, node n2) {
	node ret;
	ret.sum = n1.sum + n2.sum;
	ret.lmx = max(n1.lmx, n1.sum + n2.lmx);
	return ret;
}
node operator*(node n1, ll x) {
	if (!x) return node();
	if (!n1.sum) return n1;
	node res;
	res.sum = n1.sum * x;
	if (n1.sum < 0) res.lmx = n1.lmx;
	else res.lmx = (x - 1) * n1.sum + n1.lmx;
	return res;
}
node gets(int s, int n = -1) {
	if (!~n) n = str[s].size();
	int i;
	node ret;
	for (i = 0; i < n; i++) {
		if (str[s][i] == 'M') ret = ret + node(-1);
		else ret = ret + node(1);
	}
	return ret;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	ll N;
	int M;
	cin >> N >> M;
	int i, j;
	ll allf = 0;
	for (i = 1; i <= M; i++) {
		cin >> str[i] >> K[i];
		for (auto v : str[i]) if (v == 'F') fs[i]++;
		ms[i] = str[i].size() - fs[i];
		allf += 1ll * fs[i] * K[i];
	}
	if (allf < N) {
		cout << -1 << ln;
		return 0;
	}
	ll lim = (allf - N) * 2 + 1;
	ll l, r;
	l = -1;
	r = N * 2 - allf;
	while (r - l > 1) {
		ll m = l + r >> 1;
		ll rem = m;
		node res = node();
		int isend = 0;
		for (i = M; i >= 1; i--) {
			if (isend) {
				res = (gets(i) * K[i]) + res;
				continue;
			}
			if (rem >= 1ll * ms[i] * K[i]) {
				rem -= 1ll * ms[i] * K[i];
				res = res + node(fs[i] * K[i]);
			}
			else {
 				ll n = rem / ms[i];
				rem -= 1ll * ms[i] * n;
				res = res + node(fs[i] * n);
				if (rem) {
					int sfs = 0;
					for (j = str[i].size() - 1; j >= 0; j--) {
						if (str[i][j] == 'F') sfs++;
						else rem--;
						if (!rem) break;
					}
					res = gets(i, j) + node(sfs) + res;
					res = gets(i) * (K[i] - n - 1) + res;
				}
				else res = gets(i) * (K[i] - n) + res;
				isend = 1;
			}
		}
		res = node(-m) + res;
		assert((allf - N) * 2 == res.sum);
		if (res.lmx > lim) l = m;
		else r = m;
	}
	cout << r << ln;
}

Compilation message

toilets.cpp: In function 'int main()':
toilets.cpp:72:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   72 |   ll m = l + r >> 1;
      |          ~~^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 4 ms 6564 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 4 ms 6612 KB Output is correct
10 Correct 3 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 3 ms 6612 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 3 ms 6612 KB Output is correct
15 Correct 3 ms 6612 KB Output is correct
16 Correct 3 ms 6612 KB Output is correct
17 Correct 3 ms 6612 KB Output is correct
18 Correct 3 ms 6612 KB Output is correct
19 Correct 4 ms 6612 KB Output is correct
20 Correct 4 ms 6540 KB Output is correct
21 Correct 3 ms 6612 KB Output is correct
22 Correct 5 ms 6632 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 4 ms 6564 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 4 ms 6612 KB Output is correct
10 Correct 3 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 3 ms 6612 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 3 ms 6612 KB Output is correct
15 Correct 3 ms 6612 KB Output is correct
16 Correct 3 ms 6612 KB Output is correct
17 Correct 3 ms 6612 KB Output is correct
18 Correct 3 ms 6612 KB Output is correct
19 Correct 4 ms 6612 KB Output is correct
20 Correct 4 ms 6540 KB Output is correct
21 Correct 3 ms 6612 KB Output is correct
22 Correct 5 ms 6632 KB Output is correct
23 Correct 47 ms 6996 KB Output is correct
24 Correct 55 ms 6996 KB Output is correct
25 Correct 53 ms 6996 KB Output is correct
26 Correct 23 ms 6996 KB Output is correct
27 Correct 4 ms 6996 KB Output is correct
28 Correct 55 ms 6996 KB Output is correct
29 Correct 49 ms 6880 KB Output is correct
30 Correct 47 ms 6996 KB Output is correct
31 Correct 53 ms 6996 KB Output is correct
32 Correct 57 ms 6996 KB Output is correct
33 Correct 4 ms 6996 KB Output is correct
34 Correct 28 ms 6996 KB Output is correct
35 Correct 60 ms 6964 KB Output is correct
36 Correct 62 ms 6880 KB Output is correct
37 Correct 21 ms 6996 KB Output is correct
38 Correct 5 ms 6880 KB Output is correct
39 Correct 47 ms 6880 KB Output is correct
40 Correct 46 ms 6880 KB Output is correct

Subtask #3
64.0 / 64.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6612 KB Output is correct
2 Correct 3 ms 6612 KB Output is correct
3 Correct 3 ms 6612 KB Output is correct
4 Correct 4 ms 6612 KB Output is correct
5 Correct 3 ms 6612 KB Output is correct
6 Correct 4 ms 6564 KB Output is correct
7 Correct 4 ms 6612 KB Output is correct
8 Correct 3 ms 6612 KB Output is correct
9 Correct 4 ms 6612 KB Output is correct
10 Correct 3 ms 6612 KB Output is correct
11 Correct 3 ms 6612 KB Output is correct
12 Correct 3 ms 6612 KB Output is correct
13 Correct 3 ms 6612 KB Output is correct
14 Correct 3 ms 6612 KB Output is correct
15 Correct 3 ms 6612 KB Output is correct
16 Correct 3 ms 6612 KB Output is correct
17 Correct 3 ms 6612 KB Output is correct
18 Correct 3 ms 6612 KB Output is correct
19 Correct 4 ms 6612 KB Output is correct
20 Correct 4 ms 6540 KB Output is correct
21 Correct 3 ms 6612 KB Output is correct
22 Correct 5 ms 6632 KB Output is correct
23 Correct 47 ms 6996 KB Output is correct
24 Correct 55 ms 6996 KB Output is correct
25 Correct 53 ms 6996 KB Output is correct
26 Correct 23 ms 6996 KB Output is correct
27 Correct 4 ms 6996 KB Output is correct
28 Correct 55 ms 6996 KB Output is correct
29 Correct 49 ms 6880 KB Output is correct
30 Correct 47 ms 6996 KB Output is correct
31 Correct 53 ms 6996 KB Output is correct
32 Correct 57 ms 6996 KB Output is correct
33 Correct 4 ms 6996 KB Output is correct
34 Correct 28 ms 6996 KB Output is correct
35 Correct 60 ms 6964 KB Output is correct
36 Correct 62 ms 6880 KB Output is correct
37 Correct 21 ms 6996 KB Output is correct
38 Correct 5 ms 6880 KB Output is correct
39 Correct 47 ms 6880 KB Output is correct
40 Correct 46 ms 6880 KB Output is correct
41 Correct 25 ms 8148 KB Output is correct
42 Correct 102 ms 8188 KB Output is correct
43 Correct 3 ms 6612 KB Output is correct
44 Correct 3 ms 6612 KB Output is correct
45 Correct 3 ms 6612 KB Output is correct
46 Correct 104 ms 7268 KB Output is correct
47 Correct 93 ms 7064 KB Output is correct
48 Correct 94 ms 6996 KB Output is correct
49 Correct 67 ms 7060 KB Output is correct
50 Correct 50 ms 7016 KB Output is correct
51 Correct 111 ms 7380 KB Output is correct
52 Correct 98 ms 9316 KB Output is correct
53 Correct 97 ms 9256 KB Output is correct
54 Correct 97 ms 9272 KB Output is correct
55 Correct 49 ms 7016 KB Output is correct
56 Correct 51 ms 6996 KB Output is correct