# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210796 | dOAOb | Arranging Shoes (IOI19_shoes) | C++14 | 6 ms | 376 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<cmath>
#include "shoes.h"
using namespace std;
//#define int long long
#ifdef lioraju
#define ndbg(x)
#else
#define ndbg(x) x
#endif
typedef pair<int, int> pii;
struct FT
{
int N;
vector<int> v;
inline int query(int n)
{
int sum = 0;
for (n+=2; n; n-=n&-n)
sum += v[n];
return sum;
}
inline int ask(int a, int b)
# | 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... |