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>
using namespace std;
#include "railroad.h"
const int MAX = 2e5;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
map<int, int> interest;
interest[1]--;
for (int i = 0; i < n; i++) {
interest[s[i]]++;
interest[t[i]]--;
}
long long value = 0;
long long balance = 0;
for (pair<int, int> p : interest)
{
value += p.second;
balance += max((long long)0, value);
}
return balance;
}
# | 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... |