oj.uz

Submission #711996

# Submission time Handle Problem Language Result Execution time Memory
711996 2023-03-17T22:15:47 Z tutis Potatoes and fertilizers (LMIO19_bulves) C++17
100 / 100
 209 ms 22544 KB 
/*input
6
1 2
0 0
2 0
0 0
0 0
0 1

*/
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename A, typename B>
using omap = tree <A, B, less<A>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename A>
using oset = tree <A, null_type, less<A>, rb_tree_tag, tree_order_statistics_node_update>;
const ll mod = 1e9 + 7;
ll ran(ll a, ll b)
{
	//return a + (ll)(rng() % (b - a + 1));
	return uniform_int_distribution<ll>(a, b)(rng);
}
ll power(ll x, ll p)
{
	if (abs(x) >= mod)
		x %= mod;
	if (x < 0)
		x += mod;
	if (abs(p) >= mod - 1)
		p %= mod - 1;
	if (p < 0)
		p += mod - 1;
	ll r = 1;
	while (p)
	{
		if (p % 2)
			r = (r * x) % mod;
		x = (x * x) % mod;
		p /= 2;
	}
	return r;
}
void solve()
{
	int N;
	cin >> N;
	int a[N];
	for (int i = 0; i < N; i++)
	{
		int f, b;
		cin >> f >> b;
		a[i] = f - b;
	}
	priority_queue<pair<ll, ll>>S;
	ll F = 1e6;
	ll pr = -5e11;
	S.push({pr, -F});
	S.push({0, F});
	ll v0 = F * -pr;
	ll sh = 0;
	ll sl = 0;
	for (int i = 0; i < N; i++)
	{
		sh += a[i];
		sl--;
		S.push({sh, 2});
		if (S.top().second == 1)
			S.pop();
		else
		{
			pair<ll, ll>x = S.top();
			S.pop();
			x.second--;
			S.push(x);
		}
		v0 += abs(pr - sh);
	}
	while (S.top().first >= sh)
		S.pop();
	S.push({sh, 0});
	vector<pair<ll, ll>>V;
	while (!S.empty())
	{
		V.push_back(S.top());
		S.pop();
	}
	reverse(V.begin(), V.end());
	for (int i = 0; i + 1 < V.size(); i++)
	{
		sl += V[i].second;
		v0 += (V[i + 1].first - V[i].first) * sl;
	}
	cout << v0 << "\n";
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	solve();
}

Compilation message

bulves.cpp: In function 'void solve()':
bulves.cpp:96:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |  for (int i = 0; i + 1 < V.size(); i++)
      |                  ~~~~~~^~~~~~~~~~

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 15 ms 1748 KB Output is correct
5 Correct 27 ms 2368 KB Output is correct
6 Correct 89 ms 3448 KB Output is correct
7 Correct 203 ms 21652 KB Output is correct
8 Correct 145 ms 10568 KB Output is correct
9 Correct 173 ms 20392 KB Output is correct
10 Correct 122 ms 6472 KB Output is correct
11 Correct 129 ms 10564 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 15 ms 1748 KB Output is correct
5 Correct 27 ms 2368 KB Output is correct
6 Correct 89 ms 3448 KB Output is correct
7 Correct 203 ms 21652 KB Output is correct
8 Correct 145 ms 10568 KB Output is correct
9 Correct 173 ms 20392 KB Output is correct
10 Correct 122 ms 6472 KB Output is correct
11 Correct 129 ms 10564 KB Output is correct
12 Correct 44 ms 2924 KB Output is correct
13 Correct 100 ms 5704 KB Output is correct
14 Correct 209 ms 21176 KB Output is correct
15 Correct 146 ms 10608 KB Output is correct
16 Correct 154 ms 9660 KB Output is correct
17 Correct 139 ms 14716 KB Output is correct
18 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 340 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 15 ms 1748 KB Output is correct
12 Correct 27 ms 2368 KB Output is correct
13 Correct 89 ms 3448 KB Output is correct
14 Correct 203 ms 21652 KB Output is correct
15 Correct 145 ms 10568 KB Output is correct
16 Correct 173 ms 20392 KB Output is correct
17 Correct 122 ms 6472 KB Output is correct
18 Correct 129 ms 10564 KB Output is correct
19 Correct 44 ms 2924 KB Output is correct
20 Correct 100 ms 5704 KB Output is correct
21 Correct 209 ms 21176 KB Output is correct
22 Correct 146 ms 10608 KB Output is correct
23 Correct 154 ms 9660 KB Output is correct
24 Correct 139 ms 14716 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 38 ms 3228 KB Output is correct
34 Correct 94 ms 9984 KB Output is correct
35 Correct 161 ms 12348 KB Output is correct
36 Correct 148 ms 12344 KB Output is correct
37 Correct 153 ms 15676 KB Output is correct
38 Correct 157 ms 12272 KB Output is correct
39 Correct 155 ms 19372 KB Output is correct
40 Correct 121 ms 11852 KB Output is correct
41 Correct 146 ms 19260 KB Output is correct
42 Correct 141 ms 19508 KB Output is correct
43 Correct 127 ms 18752 KB Output is correct
44 Correct 122 ms 12472 KB Output is correct
45 Correct 162 ms 12348 KB Output is correct
46 Correct 164 ms 22544 KB Output is correct
47 Correct 106 ms 11004 KB Output is correct