Submission #600525

#	Time	Username	Problem	Language	Result	Execution time	Memory
600525		wiwiho	Roller Coaster Railroad (IOI16_railroad)	C++14	0 / 100	95 ms	7876 KiB

railroad

#include "railroad.h"

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

long long plan_roller_coaster(vector<int> S, vector<int> T){
    int n = (int) S.size();
    
    vector<pii> v;
    for(int i = 0; i < n; i++){
        //cerr << "test " << i << " : " << S[i] << " " << T[i] << "\n";
        v.eb(mp(S[i], 1));
        v.eb(mp(T[i], -1));
    }
    v.eb(mp(0, -1));
    v.eb(mp(1000000001, 1));
    //printv(v, cerr);

    lsort(v);
    //printv(v, cerr);

    int t = 0;
    bool ok = true;
    for(pii i : v){
        t += -i.S;
        if(t < 0) ok = false;
    }
    if(t != 0) ok = false;

    return ok ? 0 : 1;
}

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