# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685447 | OrazB | Bigger segments (IZhO19_segments) | C++14 | 93 ms | 38588 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>
#define N 500005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
using namespace std;
ll a[N], mx, n, ind[N];
vector<int> vec;
ll pref[N], dp[N][5];
int calc(int x){
int l = 0, r = vec.size()-1, pos = 0;
while(l <= r){
int md = (l+r)/2;
if (vec[md] > x) r = md - 1;
else{
pos = vec[md];
l = md + 1;
}
}
return pos;
}
int binary(int i, ll x){
int l = i+1, r = n, idx=i;
# | 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... |