# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
395320 | iulia13 | Coins (BOI06_coins) | C++14 | 303 ms | 10044 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
#define ll long long
struct ura{
int x, y;
};
ura v[500005];
ura ans;
int main()
{
ll n, k, s = 0, cnt = 0, nr = 0;
cin >> n >> k;
for(int i = 1; i <= n; i++)
{
ll c, tip;
cin >> c >> tip;
if (c > s && tip == 0) ///rest
{
if (ans.x < nr || (ans.x == nr && ans.y > s))
{
ans.x = nr;
ans.y = s;
}
while (cnt && v[cnt].y) ///useless
{
s -= v[cnt].x;
cnt--;
}
s += c;
nr++;
}
else
if (c <= s)
{
/*a1 + ... + ai >= aj
a1+.......+ai-1>= aj nu*/
s -= v[cnt].x;
if (v[cnt].y == 0)
nr--;
cnt--;
s += c;
if (tip == 0)
nr++;
}
if (s > k)
break;
cnt++;
v[cnt] = {c, tip};
}
if (s <= k)
{
if (ans.x < nr || (ans.x == nr && ans.y > s))
{
ans.x = nr;
ans.y = s;
}
}
cout << ans.x << '\n' << k - ans.y;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |