# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445183 | JovanB | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 792 ms | 64072 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;
typedef long long ll;
typedef long double ld;
int a[200005];
int b[200005];
int sp[25][200005];
int g[200005];
int treba[200005];
int lg[200005];
int bit[600005];
pair <int, int> t[200005];
int k;
int nadji(int x){
/// poslednji manji jednak x
int l = 1, r = k, res = 0;
while(l <= r){
int mid = (l+r)/2;
if(t[mid].first <= x){
l = mid+1;
res = mid;
}
else r = mid-1;
}
return res;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |