Submission #1176809

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176809		ackhava	Teams (IOI15_teams)	C++20	0 / 100	1092 ms	223440 KiB

teams

#include "teams.h"
#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;

struct segment_tree {
    struct node {
        long long lmin=0;
        long long rmin=0;
        long long min =0;
        long long sum =0;
        long long lpas=0;
        long long rpas=0;

        bool operator==(const node &n){
            return (n.lmin == this->lmin) &&
                   (n.rmin == this->rmin) &&
                   (n.min  == this->min ) &&
                   (n.sum  == this->sum ) &&
                   (n.lpas == this->lpas) &&
                   (n.rpas == this->rpas);
        };
    };

    node e = {-1,-1,-1,-1,-1,-1};

    node merge(node a, node b){
        if(a==e)return b;
        if(b==e)return a;
        node c;
        assert(a.rpas == b.lpas);
        assert(a.min <= a.sum);
        assert(a.lmin <= a.sum);
        assert(a.rmin <= a.sum);
        assert(b.min <= b.sum);
        assert(b.lmin <= b.sum);
        assert(b.rmin <= b.sum);
        c.lmin = min(a.lmin, a.sum+b.lmin-a.rpas);
        c.rmin = min(b.rmin, b.sum+a.rmin-b.lpas);
        c.lpas = a.lpas;
        c.rpas = b.rpas;
        c.sum = a.sum + b.sum - a.rpas;
        c.min = min(min(min(a.min,b.min),a.rmin + b.lmin - a.rpas),min(min(a.rmin,a.lmin),min(b.rmin,b.lmin)));
        assert(c.min <= c.sum);
        assert(c.lmin <= c.sum);
        assert(c.rmin <= c.sum);
        return c;
    }

    vector<node> seg;
    vector<long long> laz;

    segment_tree(long long n){
        seg.resize(4*n+20);
        laz.resize(4*n+20,0);
    }

    void propogate(long long node){
        seg[node*2+1].lmin+=laz[node];
        seg[node*2+1].rmin+=laz[node];
        seg[node*2+1].min +=laz[node];
        seg[node*2+1].sum +=laz[node];
        seg[node*2+1].lpas+=laz[node];
        seg[node*2+1].rpas+=laz[node];
        seg[node*2+2].lmin+=laz[node];
        seg[node*2+2].rmin+=laz[node];
        seg[node*2+2].min +=laz[node];
        seg[node*2+2].sum +=laz[node];
        seg[node*2+2].lpas+=laz[node];
        seg[node*2+2].rpas+=laz[node];
        laz[node*2+1]+=laz[node];
        laz[node*2+2]+=laz[node];
        laz[node]=0;
    }

    void add_student(long long node, long long l, long long r, long long ql, long long qr){
        if(ql > r)return;
        if(qr < l)return;
        if(ql < l && r < qr){
            laz[node]++;
            seg[node].lmin++;
            seg[node].rmin++;
            seg[node].min ++;
            seg[node].sum ++;
            seg[node].lpas++;
            seg[node].rpas++;
            return;
        }
        if(l == r){
            seg[node].lmin++;
            seg[node].rmin++;
            seg[node].min ++;
            seg[node].sum ++;
            if(l!=ql)seg[node].lpas++;
            if(r!=qr)seg[node].rpas++;
            return;
        }
        propogate(node);
        add_student(node*2+1,l,(l+r)/2,ql,qr);
        add_student(node*2+2,(l+r)/2 + 1,r,ql,qr);
        seg[node]=merge(seg[node*2+1],seg[node*2+2]);
    }

    void update(long long node, long long l, long long r, long long pos, long long v){
        if(l > pos)return;
        if(pos > r)return;
        if(l==r){
            seg[node].lmin+=v;
            seg[node].rmin+=v;
            seg[node].min +=v;
            seg[node].sum +=v;
            return;
        }
        propogate(node);
        update(node*2+1,l,(l+r)/2,pos,v);
        update(node*2+2,(l+r)/2 + 1,r,pos,v);
        seg[node]=merge(seg[node*2+1],seg[node*2+2]);
    }

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

long long N;
segment_tree tree(0);

void init(signed N, signed A[], signed B[]) {
    ::N = N;
    segment_tree segtree(N);
    tree=segtree;
    REP(i,0,N){
        tree.add_student(0,0,N,A[i],B[i]);
    }
}

signed can(signed M, signed K[]) {
    REP(i,0,M){
        tree.update(0,0,N,K[i],-K[i]);
    }
    bool can=tree.query(0,0,N,0,N).min >= 0;
    REP(i,0,M){
        tree.update(0,0,N,K[i],K[i]);
    }
	return can;
}

• Subtask 1: 0 / 21
• Subtask 2: 0 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23