Submission #789827

#	Time	Username	Problem	Language	Result	Execution time	Memory
789827		mindiyak	Roller Coaster Railroad (IOI16_railroad)	C++14	30 / 100	85 ms	10600 KiB

railroad

#include "railroad.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <unordered_map>
#include <climits>
#include <deque>

#define pb push_back
using namespace std;
#define ll long long

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    deque<pair<int,int>> s_start;
    deque<pair<int,int>> s_end;

    for(int i=0;i<n;i++){
        s_start.push_back({s[i],i});
        s_end.push_back({t[i],i});
    }

    sort(s_start.rbegin(),s_start.rend());
    sort(s_end.rbegin(),s_end.rend());

    for(int i=1;i<n;i++){
        if(s_end[i].second != s_start[0].second){
            if(s_end[i].first > s_start[0].first){
                return 1;
            }
        }else if(s_start.size() > 1){
            if(s_end[i].first > s_start[1].first){
                return 1;
            }
        }
        s_start.pop_front();        
    }
    return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 30 / 30
• Subtask 4: 0 / 36