forked from isanchez-aguilar/CodeForces
-
Notifications
You must be signed in to change notification settings - Fork 0
/
1165F2 - Microtransactions (hard version).cpp
103 lines (81 loc) · 1.79 KB
/
1165F2 - Microtransactions (hard version).cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
/*
* User: Isanchez_Aguilar
* Problem: CodeForces 1165F2 - Microtransactions (hard version)
*/
#include <bits/stdc++.h>
#define LAST_DAY 400000
using namespace std;
int n, m;
vector<int> k;
vector< pair<int, int> > sales;
inline bool isPossible(const int& maxDay)
{
vector<int> lastSale(n, -1);
for (int i = 0; i < m; ++i)
{
if (sales[i].first <= maxDay)
lastSale[sales[i].second] = max(lastSale[sales[i].second], sales[i].first);
}
vector< vector<int> > salesCurrentDay(200001);
for (int i = 0; i < n; ++i)
{
if (lastSale[i] != -1)
salesCurrentDay[lastSale[i]].push_back(i);
}
int currentMoney = 0;
vector<int> remaining = k;
for (int day = 0; day <= maxDay; ++day)
{
++currentMoney;
if (day <= 200000)
{
for (int typeSale : salesCurrentDay[day])
{
if (remaining[typeSale] <= currentMoney)
{
currentMoney -= remaining[typeSale];
remaining[typeSale] = 0;
}
else
{
remaining[typeSale] -= currentMoney;
currentMoney = 0;
break;
}
}
}
}
return 2 * accumulate(begin(remaining), end(remaining), 0) <= currentMoney;
}
int main(void)
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
k = vector<int>(n);
sales = vector< pair<int, int> >(m);
for (int i = 0; i < n; ++i)
cin >> k[i];
for (int i = 0; i < m; ++i)
{
cin >> sales[i].first >> sales[i].second;
--sales[i].first;
--sales[i].second;
}
int leftDay = 0;
int ans = LAST_DAY;
int rightDay = LAST_DAY;
while (leftDay <= rightDay)
{
const int middleDay = (leftDay + rightDay) / 2;
if (isPossible(middleDay))
{
ans = middleDay;
rightDay = middleDay - 1;
}
else
leftDay = middleDay + 1;
}
cout << ans + 1 << "\n";
return 0;
}