# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
408835 | victoriad | Fountain (eJOI20_fountain) | C++14 | 1590 ms | 27724 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 <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
#include <stack>
#include <fstream>
using namespace std;
vector<int>v;
vector<int>d;
vector<vector<int> >up;
int search(int l,vector<int>&ps,int r){
int low=0,hi=18,mid,re=-1;
if(ps[up[r][1]]<=l)return r+1;
while(low<=hi){
mid=low+(hi-low)/2;
if(ps[up[r][mid]]>l){
low=mid+1;
re=mid;
}
else{
hi=mid-1;
}
}
if(re==-1)return 0;
return search(l,ps,up[r][re]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |