Submission #276650

#TimeUsernameProblemLanguageResultExecution timeMemory
276650arayiRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
139 ms6008 KiB
#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();
     for (int i = 0; i < n; i++)
     {
         a[i].fr = s[i];
         if(s[i] >= t[i]) sm[i]++;
         a[i].sc = i;
     }
     sort(a, a + n);
     bool bl = false;
     if(t[a[0].sc] > a[n - 1].fr) bl = true;
     sort(all(t));
     if(bl && a[0].fr < t[0]) return 1;
     for (int i = 0; i < n; i++)
     {
        int i1 = upper_bound(all(t), a[i].fr) - t.begin();
        if(i == 1 && a[0].fr < t[0]) i1 -= sm[a[i].sc];
        if(i1 < i) return 1;
     }
     return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...