Submission #261515

#TimeUsernameProblemLanguageResultExecution timeMemory
261515amallaRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
105 ms5180 KiB
#include "railroad.h" #include<bits/stdc++.h> using namespace std; long long plan_roller_coaster(vector<int> s, vector<int> t) { long long n = (long long) s.size(), curr_speed = 1, need = 0; vector<pair<int,int> > S(n); for (int i = 0; i<n; ++i) { S[i].first = s[i]; S[i].second = t[i]; } sort(S.begin(), S.end()); for (int i = 0; i<n; ++i) { if (curr_speed>S[i].first) need += curr_speed-S[i].first; curr_speed = S[i].second; } return need; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...