# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
35526 | sinhriv | medians (balkan11_medians) | C++14 | 189 ms | 15056 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;
const int N = 200010;
int n;
int a[N];
int b[N];
vector < pair < int, int > > relate;
int d(int x){
if(x < 0) return abs(x);
return n + n - x;
}
int getopp(int x){
return x / abs(x);
}
bool cmp(pair < int, int > x, pair < int, int > y){
if(getopp(x.first) != getopp(y.first)){
return getopp(x.first) < getopp(y.first);
}
return d(x.first) < d(y.first);
}
set < int > unused;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |