# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37840 | mirbek01 | Divide and conquer (IZhO14_divide) | C++14 | 179 ms | 57732 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>
# define pb push_back
# define fr first
# define sc second
# define mk make_pair
using namespace std;
const int inf = 1e9 + 7;
const int N = 1e5 + 5;
typedef long long ll;
int n, a[N];
ll ans, b[N], c[N], cb[N], cc[N], s1, s2;
vector < pair <ll, ll> > t[N * 4];
void Merge(vector < pair <ll, ll> > a, vector < pair <ll, ll> > b, vector < pair <ll, ll> > &c)
{
int i = 0, j = 0;
while(i < a.size() && j < b.size())
if(a[i] < b[j])
c.pb(a[i ++]);
else
c.pb(b[j ++]);
while(i < a.size())
c.pb(a[i ++]);
while(j < b.size())
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... |