# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24056 | gs14004 | Roller Coaster Railroad (IOI16_railroad) | C++11 | 576 ms | 30132 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;
// s[i] -> t[i]
// inf amount of i -> i+1, if needed
// outdegree = -1
// indegree = 1
// ok if eulerable in every comp.
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]]++;
int ans = 0;
for(auto &i : mp) v.push_back(pi(i.first, i.second));
for(int i=0; i<v.size(); i++){
if(i+1 < v.size() && v[i].second < 0){
v[i+1].second -= v[i].second;
}
if(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... |