# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140080 | mlyean00 | Growing Vegetable is Fun 3 (JOI19_ho_t3) | C++17 | 50 ms | 508 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>
#ifdef DEBUG
#include "debug.hpp"
#else
#pragma GCC optimize("Ofast")
#define trace(...)
#include <bits/stdc++.h>
#define endl '\n'
#endif
using namespace std;
const string COL = "RGY";
int count_inversions(vector<int>& v, int l, int r) {
if (r - l == 1) return 0;
int mid = (l + r) / 2;
int ans = 0;
ans += count_inversions(v, l, mid);
ans += count_inversions(v, mid, r);
vector<int> m;
m.reserve(r - l);
int ptr1 = l, ptr2 = mid;
while (ptr1 < mid || ptr2 < r) {
if (ptr1 == mid) {
m.push_back(v[ptr2++]);
# | 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... |