oj.uz

Submission #591174

# Submission time Handle Problem Language Result Execution time Memory
591174 2022-07-07T00:14:57 Z tutis Boarding Passes (BOI22_passes) C++17
5 / 100
 3 ms 2832 KB 
/*input
ABABABAB
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[1 << 15];
int main()
{
	ios_base::sync_with_stdio(false);
	string s;
	cin >> s;
	for (int i = 0; i < (1 << 15); i++)
		dp[i] = 1e18;
	dp[0] = 0;
	vector<int>p[15];
	for (int i = 0; i < (int)s.size(); i++)
		p[s[i] - 'A'].push_back(i);
	int G = 15;
	while (p[G - 1].empty())
		G--;
	for (int msk = 0; msk < (1 << G); msk++)
	{
		for (int v = 0; v < G; v++)
		{
			if ((msk & (1 << v)) == 0)
			{
				int msk1 = msk ^ (1 << v);
				if (p[v].empty())
					dp[msk1] = min(dp[msk1], dp[msk]);
				else
				{
					ll L[p[v].size() + 2];
					ll R[p[v].size() + 2];
					for (ll i = 0; i <= (int)p[v].size(); i++)
					{
						L[i] = 0;
						R[i] = 0;
					}
					for (int j = 0; j < (int)s.size(); j++)
					{
						if (((1 << (s[j] - 'A'))&msk) != 0)
						{
							auto it = upper_bound(p[v].begin(), p[v].end(), j);
							L[it - p[v].begin() + 1] += 4;
							R[p[v].end() - it + 1] += 4;
						}
					}
					for (ll i = 1; i <= (int)p[v].size(); i++)
						L[i] += L[i - 1];
					for (ll i = 1; i <= (int)p[v].size(); i++)
						L[i] += i * (i - 1);

					for (ll i = 1; i <= (int)p[v].size(); i++)
						R[i] += R[i - 1];
					for (ll i = 1; i <= (int)p[v].size(); i++)
						R[i] += i * (i - 1);

					ll best = 1e18;
					for (int l = 0; l <= (int)p[v].size(); l++)
					{
						best = min(best, L[l] + R[(int)p[v].size() - l]);
					}
					dp[msk1] = min(dp[msk1], dp[msk] + best);
				}
			}
		}
	}
	ll ret = dp[(1 << G) - 1];
	cout << ret / 4;
	if (ret % 4 == 2)
	{
		cout << ".5";
	}
	else if (ret % 4 != 0)
	{
		cout << "." << 25 * (ret % 4);
	}
	cout << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 3 ms 2320 KB Output is correct
7 Correct 3 ms 2704 KB Output is correct
8 Correct 3 ms 2832 KB Output is correct
9 Correct 3 ms 2832 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Incorrect 1 ms 468 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Incorrect 1 ms 468 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 3 ms 2320 KB Output is correct
7 Correct 3 ms 2704 KB Output is correct
8 Correct 3 ms 2832 KB Output is correct
9 Correct 3 ms 2832 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Incorrect 1 ms 468 KB Output isn't correct
13 Halted 0 ms 0 KB -