# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
235657 | triple_fault | Arranging Shoes (IOI19_shoes) | C++14 | 1110 ms | 221968 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 "shoes.h"
#include <set>
#include <cstdio>
#include <algorithm>
#define ll long long
#define mid ((tl + tr) / 2)
#define lft (v * 2)
#define rht ((v * 2) + 1)
#define MAX 200000
using namespace std;
ll n;
vector<ll> shoes(MAX);
ll active_t[4 * MAX];
struct segtree {
segtree* left = NULL; segtree* right = NULL;
multiset<ll> here;
ll m_tl, m_tr;
void build(ll tl, ll tr) {
m_tl = tl, m_tr = tr;
if (tl == tr) {
here.insert(shoes[tl]);
return;
# | 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... |