# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933529 | Hanksburger | Examination (JOI19_examination) | C++17 | 380 ms | 19400 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;
vector<pair<pair<int, int>, pair<int, int> > > vec;
int bit[600005], ans[100005];
map<int, int> mp;
void upd(int x, int y)
{
for (int i=x; i<=6e5; i+=i&(-i))
bit[i]+=y;
}
int qry(int x)
{
int res=0;
for (int i=x; i; i-=i&(-i))
res+=bit[i];
return res;
}
void recur(int l, int r)
{
if (l==r)
return;
int mid=(l+r)/2;
vector<pair<pair<int, int>, int> > a;
vector<pair<int, int> > b;
for (int i=l; i<=mid; i++)
if (vec[i].first.second)
a.push_back({vec[i].second, vec[i].first.second});
for (int i=mid+1; i<=r; i++)
if (!vec[i].first.second)
b.push_back(vec[i].second);
Compilation message (stderr)
# | 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... |