# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
752774 | math_rabbit_1028 | Abracadabra (CEOI22_abracadabra) | C++14 | 338 ms | 34324 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;
int n, q, arr[202020];
int ans[1010101];
int res[202020];
int nxt[202020];
stack< pair<int, int> > S;
int qnum = 0;
struct query {
int time, idx, ord;
bool operator<(const query &other) const {
if (time == other.time) return idx < other.idx;
return time > other.time;
}
} queries[1010101];
struct segment {
int first, st, ed, sz;
bool operator<(const segment &other) const {
return first > other.first;
}
};
set<segment> segs;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
# | 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... |