# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50146 | spencercompton | Bitaro’s Party (JOI18_bitaro) | C++17 | 2092 ms | 426024 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 buf;
bool inside[100000];
vector<pair<int, int> > mg(vector<pair<int, int> > a, vector<pair<int, int> > b){
//first = val
//second = loc
vector<pair<int, int> > ret;
int p1 = 0;
int p2 = 0;
int sz1 = a.size();
int sz2 = b.size();
while((p1<sz1 || p2<sz2) && ret.size()<buf){
bool add1 = false;
if(p1==sz1){
//add2
}
else if(p2==sz2){
add1 = true;
}
else{
if(a[p1]<b[p2]){
add1 = true;
}
else{
//add2
}
}
if(add1){
if(inside[a[p1].second]){
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... |