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 "railroad.h"
#include <bits/stdc++.h>
#define lli long long int
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
using namespace std;
const int N = 2e5 + 30;
int n, sm[N];
pair <int, int> a[N];
long long plan_roller_coaster(vector<int> s, vector<int> t)
{
n = s.size();
sort(all(s));
sort(all(t));
for (int i = 0; i < n; i++)
{
int i1 = upper_bound(all(t), s[i]) - t.begin();
if(i1 < i) return 1;
}
return 0;
}
# | 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... |