# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502231 | JovanB | Osumnjičeni (COCI21_osumnjiceni) | C++17 | 315 ms | 28416 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;
using ll = long long;
using ld = long double;
const int N = 200000;
const int LOG = 20;
set <pair <int, int>> q;
bool intersects(int l, int r){
if(q.empty()) return 0;
auto x = q.lower_bound({l, -1});
if(x != q.end()){
if(x->first <= r) return 1;
}
if(x != q.begin()){
x--;
if(x->second >= l) return 1;
}
return 0;
}
int sl[N+5], sr[N+5];
int gde[LOG+1][N+5];
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cout.precision(10);
# | 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... |