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 <vector>
#include <algorithm>
#include <iostream>
#define pb push_back
using namespace std;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
vector<pair<pair<int,int>,int>> arr;
for(int i=0;i<n;i++){
arr.pb({{s[i],t[i]},i});
}
sort(arr.begin(),arr.end());
int cur_speed = 1;
int ans = 0;
for(int i=0;i<n;i++){
// cout << arr[i].second << " " << arr[i].first.first << " " << arr[i].first.second << " " << cur_speed << endl;
if(arr[i].first.first < cur_speed){
ans += (cur_speed - arr[i].first.first);
}
cur_speed = arr[i].first.second;
}
return ans;
}
# | 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... |