# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
959535 | AndreiBOTO | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
///#include <tryhardmode>
///#include <GODMODE::ON>
using namespace std;
const int NMAX=2e5+5;
queue<int>right_shoe[NMAX];
queue<int>left_shoe[NMAX];
bool viz[NMAX];
int aib[NMAX];
int v[NMAX];
int n;
int lsb(int x)
{
return x&(-x);
}
void update(int p,int val)
{
while(p<=n)
{