# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831724 | QwertyPi | Abracadabra (CEOI22_abracadabra) | C++14 | 799 ms | 42436 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<int> shuffle(vector<int> a){
int n = a.size();
vector<int> a1(a.begin(), a.begin() + n / 2), a2(a.begin() + n / 2, a.end());
a1.push_back(1 << 30); a2.push_back(1 << 30);
int l = 0, r = 0;
vector<int> b;
for(int i = 0; i < n; i++){
if(a1[l] < a2[r]) b.push_back(a1[l++]);
else b.push_back(a2[r++]);
}
return b;
}
const int MAXN = 2e5 + 11;
const int MAXQ = 1e6 + 11;
int ans[MAXQ];
struct query{
int t, i, id;
bool operator< (const query& o) const {
return t < o.t;
}
};
struct BIT{
int bit[MAXN];
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... |