# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568897 | almothana05 | Street Lamps (APIO19_street_lamps) | C++14 | 444 ms | 24168 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 mod 1000000007
#define inf 10000000000000000
using namespace std;
vector<int>num[200] , comp[3];
vector<string>ov;
vector<pair<int , int> >op;
int seg[2000000];
int sucher(int id , int l , int r , int gewl , int gewr){
// cout << id << ' ' << l << ' ' << r << "\n";
if(l > gewr || gewl > r){
return -1;
}
if(gewl <= l && r <= gewr){
// cout << l << ' ' << r << "\n\n";
return seg[id];
}
int m = (l + r)/2;
return max(sucher(id * 2 , l , m , gewl , gewr) , sucher(id * 2 + 1 , m + 1 , r , gewl , gewr));
}
int main(){
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
string s;
int menge , numm , nummer , ed , cmp , que ;;
cin >> menge >> que;
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... |