oj.uz

Submission #711993

# Submission time Handle Problem Language Result Execution time Memory
711993 2023-03-17T21:44:30 Z tutis Potatoes and fertilizers (LMIO19_bulves) C++17
100 / 100
 242 ms 30292 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;
	}
	map<ll, ll>S;
	ll F = 1e6;
	ll pr = -5e11;
	S[pr] = -F;
	S[0] = F;
	ll v0 = F * -pr;
	ll sh = 0;
	ll sl = 0;
	for (int i = 0; i < N; i++)
	{
		sh += a[i];
		sl--;
		S[sh] += 2;
		auto it = --S.end();
		if (it->second == 1)
			S.erase(it);
		else
			it->second--;
		v0 += abs(pr - sh);
	}
	while ((--S.end())->first >= sh)
		S.erase(--S.end());
	S[sh] = 0;
	while (S.size() >= 2)
	{
		pair<ll, ll>x = *S.begin();
		sl += x.second;
		S.erase(S.begin());
		v0 += (S.begin()->first - x.first) * sl;
	}
	cout << v0 << "\n";
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	solve();
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 16 ms 2304 KB Output is correct
5 Correct 38 ms 3680 KB Output is correct
6 Correct 70 ms 4220 KB Output is correct
7 Correct 206 ms 30292 KB Output is correct
8 Correct 134 ms 17872 KB Output is correct
9 Correct 242 ms 25200 KB Output is correct
10 Correct 54 ms 2260 KB Output is correct
11 Correct 58 ms 2260 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 16 ms 2304 KB Output is correct
5 Correct 38 ms 3680 KB Output is correct
6 Correct 70 ms 4220 KB Output is correct
7 Correct 206 ms 30292 KB Output is correct
8 Correct 134 ms 17872 KB Output is correct
9 Correct 242 ms 25200 KB Output is correct
10 Correct 54 ms 2260 KB Output is correct
11 Correct 58 ms 2260 KB Output is correct
12 Correct 41 ms 4124 KB Output is correct
13 Correct 107 ms 9164 KB Output is correct
14 Correct 223 ms 28720 KB Output is correct
15 Correct 163 ms 23140 KB Output is correct
16 Correct 228 ms 17620 KB Output is correct
17 Correct 48 ms 2260 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 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 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 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 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 16 ms 2304 KB Output is correct
12 Correct 38 ms 3680 KB Output is correct
13 Correct 70 ms 4220 KB Output is correct
14 Correct 206 ms 30292 KB Output is correct
15 Correct 134 ms 17872 KB Output is correct
16 Correct 242 ms 25200 KB Output is correct
17 Correct 54 ms 2260 KB Output is correct
18 Correct 58 ms 2260 KB Output is correct
19 Correct 41 ms 4124 KB Output is correct
20 Correct 107 ms 9164 KB Output is correct
21 Correct 223 ms 28720 KB Output is correct
22 Correct 163 ms 23140 KB Output is correct
23 Correct 228 ms 17620 KB Output is correct
24 Correct 48 ms 2260 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 39 ms 4648 KB Output is correct
34 Correct 101 ms 10828 KB Output is correct
35 Correct 187 ms 17484 KB Output is correct
36 Correct 220 ms 17880 KB Output is correct
37 Correct 149 ms 24180 KB Output is correct
38 Correct 216 ms 17872 KB Output is correct
39 Correct 94 ms 10064 KB Output is correct
40 Correct 110 ms 13860 KB Output is correct
41 Correct 52 ms 2260 KB Output is correct
42 Correct 52 ms 2260 KB Output is correct
43 Correct 50 ms 2260 KB Output is correct
44 Correct 48 ms 2260 KB Output is correct
45 Correct 198 ms 18100 KB Output is correct
46 Correct 113 ms 8400 KB Output is correct
47 Correct 109 ms 13996 KB Output is correct