# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365766 | jasen_penchev | Cheerleaders (info1cup20_cheerleaders) | C++14 | 1220 ms | 7388 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 <algorithm>
#include <iostream>
#include <utility>
#include <string>
#include <vector>
#define endl '\n'
using namespace std;
const int MAXN = 17;
int N;
int a[(1ll << MAXN) + 5];
int b[(1ll << MAXN) + 5];
long long cnt1[MAXN + 5], cnt2[MAXN + 5];
void rec(int l, int r, int depth, vector< pair<int, int> > v)
{
if (r - l == 1) return;
int mid = (l + r) / 2;
vector< pair<int, int> > v1, v2;
for (int i = 0; i < v.size(); ++ i)
{
if (v[i].second < mid) v1.push_back(v[i]);
else v2.push_back(v[i]);
}
int pos = 0;
for (int i = 0; i < v2.size(); ++ i)
{
while (pos < v1.size() and v1[pos].first < v2[i].first) pos++;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |