# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
662299 | fatemetmhr | Abracadabra (CEOI22_abracadabra) | C++17 | 675 ms | 42100 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.
// heiy ... ye rooze jadid ...
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define pb push_back
#define fi first
#define se second
const int maxn5 = 1e6 + 10;
const int maxnt = 1e6 + 10;
int sum[maxnt], a[maxn5], rev[maxn5], out[maxn5], per[maxn5];
int rig[maxn5], sz[maxn5], t[maxn5], ind[maxn5], last[maxn5];
bool mark[maxn5];
vector <int> av;
inline bool cmp(int i, int j){return t[i] < t[j];}
void upd(int l, int r, int id, int val, int v){
if(r - l == 1){
sum[v] = val;
return;
}
int mid = (l + r) >> 1;
if(id < mid)
# | 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... |