# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114571 | ly20 | Roller Coaster Railroad (IOI16_railroad) | C++14 | 1074 ms | 26232 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<bits/stdc++.h>
using namespace std;
#include "railroad.h"
const int MAXN=212345;
pair<int,int> v[MAXN];
set<pair<int,int> > se,ss;
long long plan_roller_coaster(vector<int> e,vector<int> s)
{
int n=e.size();
for(int i=0;i<n;i++)
{
se.insert(make_pair(e[i],i));ss.insert(make_pair(s[i],i));
}
long long resp1=0;
int ini;
int idk=(*(--ss.end())).second;
ss.erase(make_pair(s[idk],idk));
//ini=e[idk];
se.erase(make_pair(e[idk],idk));
int id1=idk;
idk=(*(se.begin())).second;
se.erase(make_pair(e[idk],idk));
//ini=s[idk];
ss.erase(make_pair(s[idk],idk));
int id2=idk;
se.insert(make_pair(e[id1],id1));
ss.insert(make_pair(s[id2],id2));
set<pair<int,int> >::iterator ite,its;
ite=se.begin();its=ss.begin();
while(ite!=se.end())
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... |