# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332229 | evpipis | Trampoline (info1cup20_trampoline) | C++11 | 469 ms | 37996 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;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef pair<int, int> ii;
const int len = 2e5+5, lg = 30, inf = 1e9+5;
ii point[len];
int k, dp[len][lg];
int fir(int x, int y){
int l = 1, r = k, ans = k+1;
while (l <= r){
int mid = (l+r)/2;
if (point[mid] >= mp(x, y))
ans = mid, r = mid-1;
else
l = mid+1;
}
if (ans == k+1 || point[ans].fi > x)
return 0;
return ans;
}
int main(){
int n, m, q;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |