oj.uz

답안 #712000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
712000 2023-03-17T22:33:05 Z tutis Potatoes and fertilizers (LMIO19_bulves) C++17
100 / 100
 167 ms 21664 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;
}
struct por
{
	ll x;
	int y;
	por(ll x, int y): x(x), y(y)
	{

	}
};
bool operator<(const por &a, const por &b)
{
	return a.x < b.x;
}
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<por>S;
	ll F = 1e6;
	ll pr = -5e11;
	S.push(por(pr, -F));
	S.push(por(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(por(sh, 2));
		if (S.top().y == 1)
			S.pop();
		else
		{
			((por*)&S.top())->y--;
		}
		v0 += abs(pr - sh);
	}
	while (S.top().x >= sh)
		S.pop();
	S.push(por(sh, 0));
	vector<por>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].y;
		v0 += (V[i + 1].x - V[i].x) * 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:106:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<por, std::allocator<por> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |  for (int i = 0; i + 1 < V.size(); i++)
      |                  ~~~~~~^~~~~~~~~~

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 12 ms 1720 KB Output is correct
5 Correct 26 ms 2376 KB Output is correct
6 Correct 81 ms 3452 KB Output is correct
7 Correct 167 ms 21664 KB Output is correct
8 Correct 113 ms 10584 KB Output is correct
9 Correct 144 ms 20268 KB Output is correct
10 Correct 88 ms 6476 KB Output is correct
11 Correct 87 ms 6484 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 12 ms 1720 KB Output is correct
5 Correct 26 ms 2376 KB Output is correct
6 Correct 81 ms 3452 KB Output is correct
7 Correct 167 ms 21664 KB Output is correct
8 Correct 113 ms 10584 KB Output is correct
9 Correct 144 ms 20268 KB Output is correct
10 Correct 88 ms 6476 KB Output is correct
11 Correct 87 ms 6484 KB Output is correct
12 Correct 37 ms 2960 KB Output is correct
13 Correct 85 ms 5628 KB Output is correct
14 Correct 166 ms 21252 KB Output is correct
15 Correct 124 ms 10568 KB Output is correct
16 Correct 129 ms 9672 KB Output is correct
17 Correct 83 ms 12476 KB Output is correct
18 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 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 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 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 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 2 ms 340 KB Output is correct
9 Correct 1 ms 340 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 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 1 ms 340 KB Output is correct

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 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 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 12 ms 1720 KB Output is correct
12 Correct 26 ms 2376 KB Output is correct
13 Correct 81 ms 3452 KB Output is correct
14 Correct 167 ms 21664 KB Output is correct
15 Correct 113 ms 10584 KB Output is correct
16 Correct 144 ms 20268 KB Output is correct
17 Correct 88 ms 6476 KB Output is correct
18 Correct 87 ms 6484 KB Output is correct
19 Correct 37 ms 2960 KB Output is correct
20 Correct 85 ms 5628 KB Output is correct
21 Correct 166 ms 21252 KB Output is correct
22 Correct 124 ms 10568 KB Output is correct
23 Correct 129 ms 9672 KB Output is correct
24 Correct 83 ms 12476 KB Output is correct
25 Correct 1 ms 340 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 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 35 ms 3268 KB Output is correct
34 Correct 89 ms 9920 KB Output is correct
35 Correct 155 ms 12352 KB Output is correct
36 Correct 139 ms 12216 KB Output is correct
37 Correct 118 ms 15752 KB Output is correct
38 Correct 139 ms 12344 KB Output is correct
39 Correct 98 ms 12292 KB Output is correct
40 Correct 121 ms 11796 KB Output is correct
41 Correct 80 ms 12220 KB Output is correct
42 Correct 80 ms 12296 KB Output is correct
43 Correct 80 ms 12252 KB Output is correct
44 Correct 92 ms 12300 KB Output is correct
45 Correct 165 ms 12352 KB Output is correct
46 Correct 102 ms 18888 KB Output is correct
47 Correct 93 ms 11072 KB Output is correct