# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289373 | Saboon | Roller Coaster Railroad (IOI16_railroad) | C++17 | 2074 ms | 5612 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 "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll plan_roller_coaster(vector<int> s, vector<int> t){
int n = (int)s.size();
vector<int> C;
for (int i = 0; i < n; i++)
C.push_back(s[i]), C.push_back(t[i]);
sort(C.begin(),C.end());
C.resize(unique(C.begin(),C.end())-C.begin());
ll ret = 0;
for (int it = 0; it+1 < C.size(); it++){
int i = C[it], j = C[it+1];
int go = 0, back = 0;
for (int idx = 0; idx < n; idx++){
if (s[idx] <= i and t[idx] >= j)
go ++;
if (s[idx] >= j and t[idx] <= i)
back ++;
}
ret += (j-i)*max(0,go-back-1);
}
return ret;
}
Compilation message (stderr)
# | 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... |