oj.uz

Submission #946961

# Submission time Handle Problem Language Result Execution time Memory
946961 2024-03-15T08:33:16 Z vjudge1 Bulldozer (JOI17_bulldozer) C++17
100 / 100
 865 ms 89876 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 segTree
{
	struct Node
	{
		int mxSum = 0, mxPref = 0, mxSuff = 0, sum = 0;
	};
	vector<Node> tree;
	int sz = 0;

	Node merge(Node a, Node b)
	{
		Node res;
		res.sum = a.sum + b.sum;
		res.mxSum = max({a.mxSum, b.mxSum, res.mxSum, a.mxSuff + b.mxPref});
		res.mxPref = max(a.mxPref, a.sum + b.mxPref);
		res.mxSuff = max(b.mxSuff, b.sum + a.mxSuff);
		return res;
	}

	void init(int n)
	{
		sz = 1;
		while (sz < n)
			sz *= 2;
		tree.resize(2 * sz);
	}

	void set(int pos, int val, int v, int lv, int rv)
	{
		if (rv - lv == 1)
		{
			tree[v].mxPref = tree[v].mxSum = tree[v].mxSuff = max(val, 0LL);
			tree[v].sum = val;
			return;
		}
		int m = (lv + rv) >> 1;
		if (pos < m)
			set(pos, val, v * 2 + 1, lv, m);
		else
			set(pos, val, v * 2 + 2, m, rv);
		tree[v] = merge(tree[v * 2 + 1], tree[v * 2 + 2]);
	}

	void set(int pos, int val)
	{
		set(pos, val, 0, 0, sz);
	}
};

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

		int n;
		cin >> n;
		vector<pair<pii, int>> els(n);
		cin >> els;

		sort(all(els), [](pair<pii, int> a, pair<pii, int> b)
			 {if(a.f.f != b.f.f) return a.f.f < b.f.f; return a.f.s > b.f.s; });

		vector<pair<double, pii>> ks;
		for (int i = 0; i < n; ++i)
			for (int j = i + 1; j < n; ++j)
			{
				double cur = (els[j].f.f - els[i].f.f) ? ((double)els[j].f.s - els[i].f.s) / (els[j].f.f - els[i].f.f) : -BIG;
				ks.pb({cur, {i, j}});
			}
		sort(all(ks));

		// vector<pair<pii, int>> bf;
		// for (int i = 0; i < n; ++i)
		// 	bf.pb({{els[i].f.s, els[i].f.f}, i});
		// sort(all(bf));

		vector<int> pos(n);
		vector<int> cur(n), val(n);
		segTree tree;
		tree.init(n);
		for (int i = 0; i < n; ++i)
		{
			pos[i] = i;
			cur[i] = els[i].s;
			val[i] = i;

			// poses[bf[i].s] = i;
			// cur[i] = els[bf[i].s].s;
			tree.set(i, cur[i]);
		}

		int res = tree.tree[0].mxSum;
		vector<vector<int>> bck(n);
		vector<int> was(n, -1);
		vector<pii> HELP;
		for (int i = 0; i <= ks.size(); ++i)
		{
			if (i == ks.size() or (i != 0 and ks[i].f != ks[i - 1].f))
			{
				vector<int> vals;
				for (auto [a, b] : HELP)
				{
					if (pos[a] > pos[b])
						swap(a, b);
					bck[pos[a]].pb(pos[b]);
					vals.pb(pos[a]);
				}
				sort(all(vals));
				HELP.clear();

				int mx = -1;
				for (int el : vals)
				{
					if (was[el] == i or el <= mx)
					{
						bck[el].clear();
						continue;
					}
					was[el] = i;

					for (int cur : bck[el])
						mx = max(cur, mx);

					int mn = el;
					for (int i = 0; mn + i < mx - i; ++i)
					{
						tree.set(mn + i, cur[mx - i]);
						tree.set(mx - i, cur[mn + i]);

						swap(cur[mn + i], cur[mx - i]);
						swap(val[mn + i], val[mx - i]);
						swap(pos[val[mn + i]], pos[val[mx - i]]);
					}
					bck[el].clear();
				}
				// cout << cur << ": " << tree.tree[0].mxSum << "\n";
				res = max(res, tree.tree[0].mxSum);
			}
			if (i != ks.size())
			{
				HELP.pb(ks[i].s);
			}
		}
		cout << res << '\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

bulldozer.cpp: In member function 'void test::solve(long long int)':
bulldozer.cpp:191:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<double, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  191 |   for (int i = 0; i <= ks.size(); ++i)
      |                   ~~^~~~~~~~~~~~
bulldozer.cpp:193:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<double, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  193 |    if (i == ks.size() or (i != 0 and ks[i].f != ks[i - 1].f))
      |        ~~^~~~~~~~~~~~
bulldozer.cpp:234:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<double, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  234 |    if (i != ks.size())
      |        ~~^~~~~~~~~~~~
bulldozer.cpp: At global scope:
bulldozer.cpp:243:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  243 | main()
      | ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 792 KB Output is correct
2 Correct 1 ms 796 KB Output is correct
3 Correct 1 ms 796 KB Output is correct
4 Correct 2 ms 796 KB Output is correct
5 Correct 1 ms 796 KB Output is correct
6 Correct 1 ms 796 KB Output is correct
7 Correct 1 ms 796 KB Output is correct
8 Correct 1 ms 796 KB Output is correct
9 Correct 1 ms 796 KB Output is correct
10 Correct 1 ms 792 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 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 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 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 600 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 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 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 709 ms 51372 KB Output is correct
34 Correct 708 ms 50352 KB Output is correct
35 Correct 737 ms 51684 KB Output is correct
36 Correct 697 ms 50608 KB Output is correct
37 Correct 699 ms 50876 KB Output is correct
38 Correct 725 ms 51896 KB Output is correct
39 Correct 699 ms 50860 KB Output is correct
40 Correct 700 ms 51264 KB Output is correct
41 Correct 745 ms 50112 KB Output is correct
42 Correct 701 ms 51372 KB Output is correct
43 Correct 732 ms 51464 KB Output is correct
44 Correct 711 ms 49852 KB Output is correct
45 Correct 709 ms 50880 KB Output is correct
46 Correct 703 ms 50880 KB Output is correct
47 Correct 692 ms 50208 KB Output is correct
48 Correct 696 ms 51132 KB Output is correct
49 Correct 708 ms 51132 KB Output is correct
50 Correct 701 ms 51388 KB Output is correct
51 Correct 691 ms 50608 KB Output is correct
52 Correct 687 ms 50612 KB Output is correct
53 Correct 704 ms 50364 KB Output is correct
54 Correct 727 ms 50108 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 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 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 600 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 709 ms 51372 KB Output is correct
34 Correct 708 ms 50352 KB Output is correct
35 Correct 737 ms 51684 KB Output is correct
36 Correct 697 ms 50608 KB Output is correct
37 Correct 699 ms 50876 KB Output is correct
38 Correct 725 ms 51896 KB Output is correct
39 Correct 699 ms 50860 KB Output is correct
40 Correct 700 ms 51264 KB Output is correct
41 Correct 745 ms 50112 KB Output is correct
42 Correct 701 ms 51372 KB Output is correct
43 Correct 732 ms 51464 KB Output is correct
44 Correct 711 ms 49852 KB Output is correct
45 Correct 709 ms 50880 KB Output is correct
46 Correct 703 ms 50880 KB Output is correct
47 Correct 692 ms 50208 KB Output is correct
48 Correct 696 ms 51132 KB Output is correct
49 Correct 708 ms 51132 KB Output is correct
50 Correct 701 ms 51388 KB Output is correct
51 Correct 691 ms 50608 KB Output is correct
52 Correct 687 ms 50612 KB Output is correct
53 Correct 704 ms 50364 KB Output is correct
54 Correct 727 ms 50108 KB Output is correct
55 Correct 711 ms 50112 KB Output is correct
56 Correct 704 ms 50620 KB Output is correct
57 Correct 706 ms 51316 KB Output is correct
58 Correct 704 ms 50144 KB Output is correct
59 Correct 708 ms 51132 KB Output is correct
60 Correct 702 ms 51636 KB Output is correct
61 Correct 695 ms 51136 KB Output is correct
62 Correct 728 ms 51392 KB Output is correct
63 Correct 710 ms 50876 KB Output is correct
64 Correct 703 ms 51116 KB Output is correct
65 Correct 697 ms 50112 KB Output is correct
66 Correct 703 ms 51904 KB Output is correct
67 Correct 702 ms 51648 KB Output is correct
68 Correct 702 ms 51136 KB Output is correct
69 Correct 700 ms 51136 KB Output is correct
70 Correct 702 ms 50608 KB Output is correct
71 Correct 693 ms 50364 KB Output is correct
72 Correct 698 ms 50876 KB Output is correct
73 Correct 713 ms 49856 KB Output is correct
74 Correct 702 ms 51120 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 792 KB Output is correct
2 Correct 1 ms 796 KB Output is correct
3 Correct 1 ms 796 KB Output is correct
4 Correct 2 ms 796 KB Output is correct
5 Correct 1 ms 796 KB Output is correct
6 Correct 1 ms 796 KB Output is correct
7 Correct 1 ms 796 KB Output is correct
8 Correct 1 ms 796 KB Output is correct
9 Correct 1 ms 796 KB Output is correct
10 Correct 1 ms 792 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 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 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 348 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 2 ms 600 KB Output is correct
39 Correct 1 ms 600 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 1 ms 600 KB Output is correct
47 Correct 1 ms 600 KB Output is correct
48 Correct 709 ms 51372 KB Output is correct
49 Correct 708 ms 50352 KB Output is correct
50 Correct 737 ms 51684 KB Output is correct
51 Correct 697 ms 50608 KB Output is correct
52 Correct 699 ms 50876 KB Output is correct
53 Correct 725 ms 51896 KB Output is correct
54 Correct 699 ms 50860 KB Output is correct
55 Correct 700 ms 51264 KB Output is correct
56 Correct 745 ms 50112 KB Output is correct
57 Correct 701 ms 51372 KB Output is correct
58 Correct 732 ms 51464 KB Output is correct
59 Correct 711 ms 49852 KB Output is correct
60 Correct 709 ms 50880 KB Output is correct
61 Correct 703 ms 50880 KB Output is correct
62 Correct 692 ms 50208 KB Output is correct
63 Correct 696 ms 51132 KB Output is correct
64 Correct 708 ms 51132 KB Output is correct
65 Correct 701 ms 51388 KB Output is correct
66 Correct 691 ms 50608 KB Output is correct
67 Correct 687 ms 50612 KB Output is correct
68 Correct 704 ms 50364 KB Output is correct
69 Correct 727 ms 50108 KB Output is correct
70 Correct 711 ms 50112 KB Output is correct
71 Correct 704 ms 50620 KB Output is correct
72 Correct 706 ms 51316 KB Output is correct
73 Correct 704 ms 50144 KB Output is correct
74 Correct 708 ms 51132 KB Output is correct
75 Correct 702 ms 51636 KB Output is correct
76 Correct 695 ms 51136 KB Output is correct
77 Correct 728 ms 51392 KB Output is correct
78 Correct 710 ms 50876 KB Output is correct
79 Correct 703 ms 51116 KB Output is correct
80 Correct 697 ms 50112 KB Output is correct
81 Correct 703 ms 51904 KB Output is correct
82 Correct 702 ms 51648 KB Output is correct
83 Correct 702 ms 51136 KB Output is correct
84 Correct 700 ms 51136 KB Output is correct
85 Correct 702 ms 50608 KB Output is correct
86 Correct 693 ms 50364 KB Output is correct
87 Correct 698 ms 50876 KB Output is correct
88 Correct 713 ms 49856 KB Output is correct
89 Correct 702 ms 51120 KB Output is correct
90 Correct 762 ms 50868 KB Output is correct
91 Correct 703 ms 50884 KB Output is correct
92 Correct 705 ms 50108 KB Output is correct
93 Correct 705 ms 51116 KB Output is correct
94 Correct 706 ms 51900 KB Output is correct
95 Correct 747 ms 51424 KB Output is correct
96 Correct 705 ms 50368 KB Output is correct
97 Correct 719 ms 51884 KB Output is correct
98 Correct 705 ms 49668 KB Output is correct
99 Correct 722 ms 51372 KB Output is correct
100 Correct 438 ms 89876 KB Output is correct
101 Correct 447 ms 89000 KB Output is correct
102 Correct 429 ms 89504 KB Output is correct
103 Correct 448 ms 89568 KB Output is correct
104 Correct 441 ms 88016 KB Output is correct
105 Correct 531 ms 83136 KB Output is correct
106 Correct 513 ms 81936 KB Output is correct
107 Correct 508 ms 87504 KB Output is correct
108 Correct 523 ms 83652 KB Output is correct
109 Correct 516 ms 82840 KB Output is correct
110 Correct 573 ms 51648 KB Output is correct
111 Correct 567 ms 50880 KB Output is correct
112 Correct 568 ms 51668 KB Output is correct
113 Correct 571 ms 51392 KB Output is correct
114 Correct 564 ms 49856 KB Output is correct
115 Correct 581 ms 50880 KB Output is correct
116 Correct 571 ms 50368 KB Output is correct
117 Correct 568 ms 50112 KB Output is correct
118 Correct 562 ms 51888 KB Output is correct
119 Correct 567 ms 50716 KB Output is correct
120 Correct 0 ms 348 KB Output is correct
121 Correct 1 ms 348 KB Output is correct
122 Correct 731 ms 49856 KB Output is correct
123 Correct 805 ms 50872 KB Output is correct
124 Correct 865 ms 51904 KB Output is correct
125 Correct 787 ms 50596 KB Output is correct
126 Correct 729 ms 50112 KB Output is correct
127 Correct 798 ms 51112 KB Output is correct
128 Correct 712 ms 50624 KB Output is correct
129 Correct 713 ms 51392 KB Output is correct
130 Correct 715 ms 51896 KB Output is correct
131 Correct 775 ms 51384 KB Output is correct
132 Correct 691 ms 50912 KB Output is correct
133 Correct 706 ms 51896 KB Output is correct