Submission #1158352

#	Time	Username	Problem	Language	Result	Execution time	Memory
1158352		ackhava	Stations (IOI20_stations)	C++20	67.23 / 100	305 ms	5260 KiB

stations

#include "stations.h"
#include <vector>
#include <bits/stdc++.h>
#define REP(v, i, j) for (long long v = i; v != j; v++)
#define FORI(v) for (auto i : v)
#define FORJ(v) for (auto j : v)

#define OUT(v, a) \
    FORI(v)       \
    cout << i << a;
#define OUTS(v, a, b)      \
    cout << v.size() << a; \
    OUT(v, b)
#define in(a, n) \
    REP(i, 0, n) \
    cin >> a[i];

#define SORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define MEMSET(m) memset(m, -1, sizeof m)

#define pb push_back
#define fi first
#define se second

#define detachIO                      \
    ios_base::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0);
    
using namespace std;

template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
bool operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
    if(__x.size() != __y.size()) return false;
    return std::equal(__x.begin(), __x.end(), __y.begin());
}


typedef pair<long long, long long> pii;
typedef pair<pii, long long> piii;
typedef pair<pii, pii> piiii;

const long long MOD = 1e9+7;

struct modint {
    long long val;

    modint() = default;
    modint(int _val): val(_val){}
    modint operator+(modint b){ return ((this->val + b.val)%MOD); }
    modint operator-(modint b){ return ((MOD + this->val - b.val)%MOD); }
    modint operator*(modint b){ return ((this->val * b.val)%MOD); }
    modint operator^(int a){
        if(a==0)return 1;
        if(a==1)return *this;
        return (((*this)*(*this))^(a>>1))*((*this)^(a&1)); 
    }
};

modint invert(modint a){
    return a^(MOD-2);
}

modint operator/(modint a, modint b){
    return a*invert(b);
}

struct segment_tree {
    long long n;
    typedef int T;
    vector<T> seg;
    const T e = 2e9;

    T merge(T a, T b){
        if(a==e)return b;
        if(b==e)return a;
        return min(a,b);
    }

    segment_tree(long long _n): n(_n),seg(4*_n+10,e) /** BUG: GCC does not initialize the elements properly this way */ {
        for(auto &i:seg)i=e;
    }

    void update(long long pos, long long l, long long r, long long idx, T val){
        if(r<idx)return;
        if(l>idx)return;
        if(l==r){
            seg[pos]=val;
            return;
        }
        update(pos*2+1,l,(l+r)/2,idx,val);
        update(pos*2+2,((l+r)/2)+1,r,idx,val);
        seg[pos]=merge(seg[pos*2+1],seg[pos*2+2]);
    }

    T query(long long pos, long long l, long long r, long long ql, long long qr){
        if(l > qr)return e;
        if(ql > r)return e;
        if(ql <= l && r <= qr)return seg[pos];
        if(l==r)return e;
        return merge(query(pos*2+1,l,(l+r)/2,ql,qr),query(pos*2+2,((l+r)/2)+1,r,ql,qr));
    }
};

vector<int> adj[200100];
int start[200100], finish[200100];
int dep[200100];

void dfs(int node, int parent){
	static int t=-1;
	static int d=0;
	if(parent==-1)t=0,d=0;
	start[node]=t++;
	dep[node]=d++;
	FORI(adj[node]){
		if(i!=parent)dfs(i,node);
	}
	d--;
	finish[node]=t++;
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
	std::vector<int> labels(n);
	REP(i,0,n)adj[i].clear();
	for (int i = 0; i < n-1; i++) {
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
	}

	dfs(0,0);

	cerr<<"LABELS ";
	REP(i,0,n){
		if(dep[i]&1)labels[i]=start[i];
		else labels[i]=finish[i];
		cerr<<labels[i]<<" ";
	}
	cerr<<endl;

	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
	SORT(c);
	if(s<c[0]) // s = start time
	{
		int par=c.back();
		c.pop_back();
		if(!c.size())return par;
		if(t<s)return par;
		FORI(c){
			if(t<=i)return i;
		}
		return par;
	} else { // s = end time
		REV(c);
		int par=c.back();
		c.pop_back();
		if(!c.size())return par;
		if(s<t)return par;
		FORI(c){
			if(i<=t)return i;
		}
		return par;
	}
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 16 / 16
• Subtask 4: 10 / 10
• Subtask 5: 41.2269 / 61