# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24061 | gs14004 | Roller Coaster Railroad (IOI16_railroad) | C++11 | 656 ms | 30140 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 pair<int, int> pi;
map<int, int> mp;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
vector<pi> v;
int n = (int) s.size();
for(int i=0; i<n; i++) mp[s[i]]--, mp[t[i]]++;
for(auto &i : mp) v.push_back(pi(i.first, i.second));
bool shortage = 0;
for(int i=1; i<v.size(); i++) v[i].second += v[i-1].second;
for(int i=1; i<v.size(); i++){
if(v[i-1].second < 0 && v[i].second < 0) return 1;
}
return 0;
}
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... |