# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915626 | SalihSahin | Osumnjičeni (COCI21_osumnjiceni) | C++14 | 561 ms | 31492 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 pb push_back
#define mp make_pair
using namespace std;
const int mod = 998244353;
int main(){
cin.tie(0); cout.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin>>n;
pair<int, int> a[n];
for(int i = 0; i < n; i++){
cin>>a[i].first>>a[i].second;
}
int K = 18, r = 0;
set<pair<int, int> > op;
int lift[K][n+1];
for(int l = 0; l < n; l++){
while(r < n){
bool ok = 1;
if(op.size()){
auto it = op.lower_bound(a[r]);
if(it != op.end() && (*it).first <= a[r].second) ok = 0;
if(it != op.begin()){
it--;
# | 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... |