제출 #864441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
864441		suiyeet	Roller Coaster Railroad (IOI16_railroad)	C++14	0 / 100	394 ms	26228 KiB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
const int MAXN = -1;
const int inf=1000000500ll;
const long long oo =1000000000000000500ll;
const int MOD = (int)1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int> pi; 
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    multiset<pi> in, out;
    int n=s.size();
    for(int i=0;i<n;i++){
        debug(s[i],t[i]);
        in.insert({s[i],t[i]});
        out.insert({t[i],s[i]});
    }
    while((int)out.size() > 1){
        int mn=out.begin()->first;
        pi cur=*out.begin();
        out.erase(out.begin());
        in.erase(in.find({cur.second,cur.first}));
        auto iter=in.lower_bound({mn,0});
        if(iter == in.end()){
            return 1;
        }
        pi nxt=*iter;
        in.erase(iter);
        out.erase(out.find({nxt.second,nxt.first}));

        pi newtrack={cur.first,nxt.second};
        debug(cur.first,cur.second,nxt.first,nxt.second,newtrack.first,newtrack.second);
        in.insert({newtrack.first,newtrack.second});
        out.insert({newtrack.second,newtrack.first});
    }
    return 0;
}

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