# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337648 | blue | Remittance (JOI19_remittance) | C++11 | 1 ms | 492 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;
/*
Let T[i] be the total number of yen transferred from i to i+1
A[i] - B[i] == 2*T[i] - T[i-1]
A[i+1] - B[i+1] == 2*T[i+1] - T[i]
T[i] = 2*T[i+1] + B[i+1] - A[i+1]
*/
long long N;
long long A[1000001];
long long B[1000001];
long long sumT = 0;
void b_search(long long l, long long r)
{
//cout << l << ' ' << r << '\n';
if(l == r)
{
long long temp = r;
long long S = r;
//cout << r << ' ';
for(long long i = N-1; i >= 1; i--)
{
temp = 2*temp + B[i+1] - A[i+1];
if(temp < 0)
{
cout << "No\n";
return;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |