# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
435815 | stoyan_malinin | Fountain (eJOI20_fountain) | C++17 | 151 ms | 16296 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>
#include <vector>
using namespace std;
const int MAXN = 2e5 + 5;
struct SmartStack
{
vector <pair <int, int>> v;
vector <int> prefSum;
int getSum(int ind)
{
if(ind==0) return prefSum.back();
return prefSum.back() - prefSum[ind-1];
}
void push(pair <int, int> x)
{
v.push_back(x);
if(prefSum.empty()==true) prefSum.push_back(x.second);
else
{
int sum = prefSum.back() + x.second;
prefSum.push_back(sum);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |