# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
369271 | Berted | Feast (NOI19_feast) | C++17 | 905 ms | 15588 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 <queue>
#include <set>
#define ll long long
#define pii pair<int,int>
#define fst first
#define snd second
#define ppp pair<pair<ll,int>,pii>
using namespace std;
int n,k,l=-1;ll ar[300001]={},to=0;set<pii> s;
priority_queue<ppp> pq;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>k;
for (int i=1;i<=n;i++)
{
cin>>ar[i];
if (ar[i]>=0)
{
if (l==-1) {l = i;}
}
else
{
if (l!=-1) {to+=ar[i-1] - ar[l-1];s.insert({l,i-1});l=-1;}
}
ar[i] += ar[i-1];
}
if (l!=-1) {s.insert({l,n});to+=ar[n] - ar[l-1];}
l = -1;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |