# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284481 | AlexLuchianov | Hacker (BOI15_hac) | C++14 | 94 ms | 21756 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>
#include <cassert>
#include <cmath>
#include <deque>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 1000000;
ll v[1 + nmax], sum[1 + nmax];
std::deque<std::pair<int, ll>> dq;
void _insert(int k, ll number) {
while(0 < dq.size() && number <= dq.back().second)
dq.pop_back();
dq.push_back({k, number});
}
void _clear(int lim) {
while(dq.front().first <= lim)
dq.pop_front();
}
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
# | 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... |