# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
258362 | maximath_1 | Swap (BOI16_swap) | C++11 | 59 ms | 5300 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 <iostream>
using namespace std;
int n, arr[200005], used[400005];
const int inf = 1e9 + 69;
int query(int id){
int rs = inf;
for(; id; id >>= 1){
if(used[id] != 1) rs = min(rs, arr[id]);
if(!used[id]) break;
if(id % 2 == 1 && used[id - 1]){
rs = min(rs, arr[id - 1]);
if(used[id - 1] == 1) break;
}
}
return rs;
}
void erase(int id, int val){
for(; id; id >>= 1){
if(arr[id] == val){
used[id] = 0;
break;
}
if(id % 2 == 1){
if(arr[id - 1] == val){
used[id - 1] = used[id] = 1;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |