# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
397331 | peuch | Shortcut (IOI16_shortcut) | C++17 | 1 ms | 204 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 "shortcut.h"
#include<bits/stdc++.h>
using namespace std;
vector<long long> val;
vector<long long> maxL, maxR;
vector<long long> dist;
vector<long long> D;
int N;
long long cost;
struct maxQueue{
deque<pair<long long, int> > d;
long long soma;
int ini, fim;
maxQueue(){
soma = 0;
ini = 0, fim = -1;
}
void push(long long val){
while(!d.empty() && d.back().first <= val - soma) d.pop_back();
d.push_back(make_pair(val - soma, ++fim));
}
void pop(){
if(!d.empty() && ini == d.front().second) d.pop_front();
ini++;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |