# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123499 | baqargam | Roller Coaster Railroad (IOI16_railroad) | C++14 | 0 ms | 0 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"
#include "railroad.h"
using namespace std;
long long j,l,dp[16][1000000],g[100],res=1000000000000000000;
vector<pair<int,int> >v;
long long plan_roller_coaster(vector<int> s, vector<int> t) {
int n = (int) s.size();
for(int i=0;i<n;i++){
v.push_back({t[i],s[i]});
}
sort(v.being(),v.end());
for(int i=0;i<n-1;i++){
if(v[i].first>s[i+1])return 0;
}
return 1;
}