# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
650202 | activedeltorre | Arranging Shoes (IOI19_shoes) | C++14 | 246 ms | 275496 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 <vector>
#include <queue>
using namespace std;
queue<int>st[200005];
queue<int>st2[200005];
int fre[200005];
long long aib[200005];
int n;
void update (int poz,int val)
{
while(poz<=n)
{
aib[poz]=aib[poz]+val;
poz=poz+(poz&(-poz));
}
}
long long querry (int poz)
{
long long suma=0;
while(poz>0)
{
suma=suma+aib[poz];
poz=poz-(poz&(-poz));
}
return suma;
}
long long count_swaps(vector<int>v)
{
v.insert(v.begin(),0);
# | 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... |