| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 956828 | Lukap | Abracadabra (CEOI22_abracadabra) | C++14 | 648 ms | 524288 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 MAXN = 2e5 + 500;
int n, q, t;
int niz[MAXN];
vector<int> v, novi;
vector<vector<int> > rj;
bool da = false;
int cnt;
void solve () {
for (int i = 0; i < n; i++) v.push_back (niz[i]);
for (int i = 0; i < n; i++) novi.push_back(niz[i]);
while (!da) {
v = novi;
novi.clear ();
int ind1 = 0, ind2 = n / 2;
while (ind1 < n / 2 || ind2 < n) {
if (ind1 == n / 2 || (ind2 < n && v[ind2] < v[ind1])) {
novi.push_back (v[ind2]);
ind2++;
}
else {
novi.push_back (v[ind1]);
ind1++;
| # | 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... | ||||