# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463593 | Quentolosse | Fountain (eJOI20_fountain) | C++14 | 416 ms | 1964 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.
//sous-tache 2
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main ()
{
int nbReservoirs, nbQuestions;
pair<int,int> entree;
vector<int> reservoirs;
cin >> nbReservoirs >> nbQuestions;
for (int i = 0; i < nbReservoirs; i++)
{
cin >> entree.first >> entree.second;
reservoirs.push_back(entree.second);
}
for (int i = 1; i < nbReservoirs; i++)
{
reservoirs[i] += reservoirs[i-1];
}
for (int question = 0; question < nbQuestions; question++)
{
int resultat, numReservoir, volumeReservoir, min = 0, max = nbReservoirs - 1;
cin >> numReservoir >> volumeReservoir;
if (reservoirs[nbReservoirs - 1] - reservoirs[numReservoir - 2] < volumeReservoir)
{
cout << 0 << endl;
continue;
}
while (min <= max)
{
if (reservoirs[(max + min) / 2] - reservoirs[numReservoir - 2] > volumeReservoir)
{
resultat = (max + min) / 2;
max = ((max + min) / 2) - 1;
}
else
{
min = ((max + min) / 2) + 1;
}
}
cout << resultat + 1<< endl;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |