# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
808994 | TheSahib | Dancing Elephants (IOI11_elephants) | C++14 | 9068 ms | 12492 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.
#pragma GCC optimize("O3")
#include "elephants.h"
#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
const int oo = 1e9 + 9;
const int MAX = 150005;
const int BLOCK = 380;
int n, l;
vector<int> st;
int arr[MAX];
struct DATA{
vector<int> v;
vector<pii> dp;
void update(int a, bool b){
auto itr = lower_bound(v.begin(), v.end(), a);
if(b){
v.insert(itr, a);
}
else{
v.erase(itr);
}
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... |