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]]++;
int ans = 1;
for(auto &i : mp){
ans += i.second;
if(ans < 0) return 1;
}
return 0;
}
# | 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... |