| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 766994 | Tenis0206 | Exercise Deadlines (CCO20_day1problem2) | C++11 | 110 ms | 13432 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>
using namespace std;
const int nmax = 2e5;
int n;
int v[nmax + 5];
int poz[nmax + 5];
set<int,greater<int>> s;
int aib[nmax + 5];
int ub(int x)
{
return (x & (-x));
}
void update(int poz, int val)
{
for(int i=poz;i<=n;i+=ub(i))
{
aib[i] += val;
}
}
int query(int qa, int qb)
{
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||