# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
304933 | azberjibiou | Arranging Shoes (IOI19_shoes) | C++17 | 266 ms | 142356 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 <bits/stdc++.h>
#define ll long long
using namespace std;
const int mxN=101010;
queue <int> que[2*mxN];
bool Chk[2*mxN];
int seg[8*mxN];
void init(int idx, int s, int e)
{
seg[idx]=e-s+1;
if(s!=e)
{
int mid=(s+e)/2;
init(2*idx, s, mid);
init(2*idx+1, mid+1, e);
}
}
int sum(int idx, int s, int e, int str, int fin)
{
if(s>fin || str>e) return 0;
if(str<=s && e<=fin) return seg[idx];
int mid=(s+e)/2;
return sum(2*idx, s, mid, str, fin)+sum(2*idx+1, mid+1, e, str, fin);
}
void upd(int idx, int s, int e, int pos)
{
if(pos<s || pos>e) return;
seg[idx]--;
if(s!=e)
# | 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... |