oj.uz

Submission #965727

# Submission time Handle Problem Language Result Execution time Memory
965727 2024-04-19T06:18:39 Z Der_Vlapos Copy and Paste 3 (JOI22_copypaste3) C++17
62 / 100
 3000 ms 337696 KB 
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>

#include <bits/stdc++.h>
#include <chrono>
#include <random>

// @author: Vlapos

namespace operators
{
	template <typename T1, typename T2>
	std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
	{
		in >> x.first >> x.second;
		return in;
	}

	template <typename T1, typename T2>
	std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
	{
		out << x.first << " " << x.second;
		return out;
	}

	template <typename T1>
	std::istream &operator>>(std::istream &in, std::vector<T1> &x)
	{
		for (auto &i : x)
			in >> i;
		return in;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}
}

// name spaces
using namespace std;
using namespace operators;
// end of name spaces

// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines

// usefull stuff

void boost()
{
	ios_base ::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
}

inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }

const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};

const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;

#define int ll

struct test
{
	void solve(int testcase)
	{
		boost();

		int n;
		cin >> n;

		string s;
		cin >> s;
		int a, b, c;
		cin >> a >> b >> c;

		vector<vector<int>> dp(n, vector<int>(n, INF));
		for (int i = 0; i < n; ++i)
			dp[i][i] = a;

		map<pii, vector<int>> last;
		vector<vector<int>> PR(n, vector<int>(n));

		for (int l = 0; l < n; ++l)
		{
			int h1 = 0, h2 = 0;
			for (int r = l; r < n; ++r)
			{
				h1 = ((h1 * 911) % MODFFT + s[r]) % MODFFT;
				h2 = ((h2 * 13) % MOD7 + s[r]) % MOD7;
				auto &v = last[{h1, h2}];
				auto it = lower_bound(all(v), l);
				if (it != v.begin())
					PR[l][r] = *prev(it) - (r - l);
				else
					PR[l][r] = -1;
				last[{h1, h2}].pb(r);
			}
		}

		for (int l = n - 1; l >= 0; --l)
			for (int r = l; r < n; ++r)
			{
				if (l - 1 >= 0)
					dp[l - 1][r] = min(dp[l - 1][r], dp[l][r] + a);
				if (r + 1 < n)
					dp[l][r + 1] = min(dp[l][r + 1], dp[l][r] + a);

				int prevL = l, prevR = r, len = r - l, cnt = 0, op = c;
				while (prevL != -1)
				{
					dp[prevL][r] = min(dp[prevL][r], dp[l][r] + cnt * a + b + op);

					op += c;
					cnt += prevL - 1;
					prevL = PR[prevL][prevR];
					prevR = prevL + len;
					cnt -= prevR;
				}
			}

		cout << dp[0][n - 1] << '\n';
	}
};

main()
{
	boost();
	int q = 1;
	// cin >> q;
	for (int i = 0; i < q; i++)
	{
		test t;
		t.solve(i);
	}
	return 0;
}
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
//                                                                                    //
//                               Coded by Der_Vlἀpos                                  //
//                                                                                    //
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//

Compilation message

copypaste3.cpp:158:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  158 | main()
      | ^~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 533 ms 71252 KB Output is correct
4 Correct 634 ms 82420 KB Output is correct
5 Correct 771 ms 96048 KB Output is correct
6 Correct 980 ms 113168 KB Output is correct
7 Correct 1176 ms 131936 KB Output is correct
8 Correct 1136 ms 131940 KB Output is correct
9 Correct 1174 ms 131936 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 2 ms 860 KB Output is correct
41 Correct 3 ms 1372 KB Output is correct
42 Correct 8 ms 3160 KB Output is correct
43 Correct 8 ms 3164 KB Output is correct
44 Correct 9 ms 3160 KB Output is correct
45 Correct 9 ms 3244 KB Output is correct
46 Correct 8 ms 3164 KB Output is correct
47 Correct 6 ms 1624 KB Output is correct
48 Correct 7 ms 2396 KB Output is correct
49 Correct 7 ms 2544 KB Output is correct
50 Correct 8 ms 2752 KB Output is correct
51 Correct 6 ms 2140 KB Output is correct
52 Correct 7 ms 2140 KB Output is correct
53 Correct 8 ms 3284 KB Output is correct

Subtask #5
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 2 ms 860 KB Output is correct
41 Correct 3 ms 1372 KB Output is correct
42 Correct 8 ms 3160 KB Output is correct
43 Correct 8 ms 3164 KB Output is correct
44 Correct 9 ms 3160 KB Output is correct
45 Correct 9 ms 3244 KB Output is correct
46 Correct 8 ms 3164 KB Output is correct
47 Correct 6 ms 1624 KB Output is correct
48 Correct 7 ms 2396 KB Output is correct
49 Correct 7 ms 2544 KB Output is correct
50 Correct 8 ms 2752 KB Output is correct
51 Correct 6 ms 2140 KB Output is correct
52 Correct 7 ms 2140 KB Output is correct
53 Correct 8 ms 3284 KB Output is correct
54 Correct 48 ms 14048 KB Output is correct
55 Correct 111 ms 21640 KB Output is correct
56 Correct 566 ms 69900 KB Output is correct
57 Correct 564 ms 70476 KB Output is correct
58 Correct 581 ms 70716 KB Output is correct
59 Correct 609 ms 70660 KB Output is correct
60 Correct 666 ms 70792 KB Output is correct
61 Correct 417 ms 43824 KB Output is correct
62 Correct 122 ms 22272 KB Output is correct
63 Correct 534 ms 57672 KB Output is correct
64 Correct 502 ms 58480 KB Output is correct
65 Correct 419 ms 45032 KB Output is correct
66 Correct 426 ms 45136 KB Output is correct
67 Correct 683 ms 70864 KB Output is correct

Subtask #6
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 533 ms 71252 KB Output is correct
14 Correct 634 ms 82420 KB Output is correct
15 Correct 771 ms 96048 KB Output is correct
16 Correct 980 ms 113168 KB Output is correct
17 Correct 1176 ms 131936 KB Output is correct
18 Correct 1136 ms 131940 KB Output is correct
19 Correct 1174 ms 131936 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 456 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 600 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 2 ms 860 KB Output is correct
58 Correct 3 ms 1372 KB Output is correct
59 Correct 8 ms 3160 KB Output is correct
60 Correct 8 ms 3164 KB Output is correct
61 Correct 9 ms 3160 KB Output is correct
62 Correct 9 ms 3244 KB Output is correct
63 Correct 8 ms 3164 KB Output is correct
64 Correct 6 ms 1624 KB Output is correct
65 Correct 7 ms 2396 KB Output is correct
66 Correct 7 ms 2544 KB Output is correct
67 Correct 8 ms 2752 KB Output is correct
68 Correct 6 ms 2140 KB Output is correct
69 Correct 7 ms 2140 KB Output is correct
70 Correct 8 ms 3284 KB Output is correct
71 Correct 48 ms 14048 KB Output is correct
72 Correct 111 ms 21640 KB Output is correct
73 Correct 566 ms 69900 KB Output is correct
74 Correct 564 ms 70476 KB Output is correct
75 Correct 581 ms 70716 KB Output is correct
76 Correct 609 ms 70660 KB Output is correct
77 Correct 666 ms 70792 KB Output is correct
78 Correct 417 ms 43824 KB Output is correct
79 Correct 122 ms 22272 KB Output is correct
80 Correct 534 ms 57672 KB Output is correct
81 Correct 502 ms 58480 KB Output is correct
82 Correct 419 ms 45032 KB Output is correct
83 Correct 426 ms 45136 KB Output is correct
84 Correct 683 ms 70864 KB Output is correct
85 Correct 2041 ms 175208 KB Output is correct
86 Execution timed out 3042 ms 337696 KB Time limit exceeded
87 Halted 0 ms 0 KB -