Submission #423721

#	Time	Username	Problem	Language	Result	Execution time	Memory
423721		MarcoMeijer	Teams (IOI15_teams)	C++14	77 / 100	4094 ms	148368 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cerr << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

const int N=(1<<19);
const int MX=N*30;

int n;
int seg[MX], pl[MX], pr[MX], nextSeg=1;
void buildSeg(int p=0, int l=0, int r=N-1) {
    seg[p] = 0;
    pl[p] = -1;
    pr[p] = -1;
    int m=(l+r)/2;
    if(l == r) return;
    pl[p] = nextSeg;
    buildSeg(nextSeg++, l  , m);
    pr[p] = nextSeg;
    buildSeg(nextSeg++, m+1, r);
}
int setSeg(int i, int v, int p, int l=0, int r=N-1) {
    if(i < l || i > r) return p;
    if(l == r) {
        seg[nextSeg] = v;
        pl[nextSeg] = -1;
        pr[nextSeg] = -1;
        return nextSeg++;
    }
    int m=(l+r)/2;
    int np = nextSeg++;
    pl[np] = setSeg(i,v,pl[p],l  ,m);
    pr[np] = setSeg(i,v,pr[p],m+1,r);
    seg[np] = seg[pl[np]] + seg[pr[np]];
    return np;
}
int getSeg(int i, int j, int p, int l=0, int r=N-1) {
    if(j < l || i > r) return 0;
    if(i <= l && j >= r) return seg[p];
    int m = (l+r)/2;
    int a = getSeg(i,j,pl[p],l  ,m);
    int b = getSeg(i,j,pr[p],m+1,r);
    return a+b;
}
int rt[MX];

vi a, b;
vi sa;

void init(int _n, int A[], int B[]) {
    n = _n;
    RE(i,n) a.pb(A[i]), b.pb(B[i]);
    RE(i,n) sa.pb(i);
    sort(all(sa),[](int i, int j) {
        return a[i] < a[j];
    });

    int ci=0;
    rt[0] = 0; buildSeg();
    RE1(i,n) {
        rt[i] = rt[i-1];
        while(ci < n && a[sa[ci]] <= i) {
            rt[i] = setSeg(b[sa[ci]], getSeg(b[sa[ci]],b[sa[ci]],rt[i])+1, rt[i]);
            ci++;
        }
    }
}

int getRegion(int b1, int a2, int b2) {
    if(b2 < b1) return 0;
    return getSeg(b1,b2,rt[a2]);
}

int can(int m, int K[]) {
    vi k;
    RE(i,m) k.pb(K[i]);
    sort(all(k));

    if(m >= 1400) {
        priority_queue<int,vi,greater<int>> pq;
        int ci = 0;
        RE(i,m) {
            while(ci < n && a[sa[ci]] <= k[i])
                pq.push(b[sa[ci++]]);
            while(!pq.empty() && pq.top() < k[i])
                pq.pop();
            if(pq.size() < k[i])
                return 0;
            RE(_,k[i]) pq.pop();
        }
        return 1;
    } else {
        vi sm; sm.assign(m,0);
        vi lst; lst.assign(m,0);
        k.pb(n+1);

        RE(i,m) {
            int needed = k[i];
            REP(j,i,m) {
                int nLast = getRegion(k[j], k[i], k[j+1]-1);
                sm[j] += nLast - lst[j];
                lst[j] = nLast;
                if(sm[j] >= needed) {
                    int delta = needed;
                    sm[j] -= delta;
                    needed -= delta;
                } else {
                    needed -= sm[j];
                    sm[j] = 0;
                }
                if(needed == 0)
                    break;
            }
            if(needed)
                return 0;
        }
        return 1;
    }
	return 0;
}

Compilation message (stderr)

teams.cpp: In function 'int can(int, int*)':
teams.cpp:124:26: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} [-Wsign-compare]
  124 |             if(pq.size() < k[i])

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