Submission #135173

#	Time	Username	Problem	Language	Result	Execution time	Memory
135173		evpipis	Teams (IOI15_teams)	C++11	13 / 100	1542 ms	356400 KiB

teams

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

#define pb push_back
const int len = 5e5+5;
vector<int> stud[len];
int team[len], n, dp[len]; //pref[len], extra[len], every[len];

struct node{
    int sum;
    node *left, *right;

    node(int s = 0, node *l = NULL, node *r = NULL){
        sum = s;
        left = l;
        right = r;
    }
};

typedef node* pnode;
pnode null = new node(), root[len];

pnode update(pnode t, int l, int r, int i){
    if (l == r)
        return new node(t->sum+1, null, null);

    int mid = (l+r)/2;
    if (i <= mid)
        return new node(t->sum+1, update(t->left, l, mid, i), t->right);
    return new node(t->sum+1, t->left, update(t->right, mid+1, r, i));
}

int ask(pnode a, pnode b, int l, int r, int i, int j){
    if (r < i || j < l || i > j)
        return 0;
    if (i <= l && r <= j)
        return (a->sum-b->sum);

    int mid = (l+r)/2;
    return ask(a->left, b->left, l, mid, i, j) + ask(a->right, b->right, mid+1, r, i, j);
}

void init(int N, int A[], int B[]){
    n = N;
    for (int i = 0; i < n; i++)
        stud[A[i]].pb(B[i]);

    root[0] = null->left = null->right = null;
    for (int i = 1; i <= n; i++){
        root[i] = root[i-1];
        for (int j = 0; j < stud[i].size(); j++)
            root[i] = update(root[i], 1, n, stud[i][j]);
    }
}

int can(int m, int K[]){
    for (int i = 1; i <= m; i++)
        team[i] = K[i-1];
    sort(team+1, team+m+1);

    int sum = 0;
    for (int i = 1; i <= m; i++)
        sum = min(n+1, team[i]+sum);

    if (sum > n)
        return 0;

    /*printf("team =\n");
    for (int i = 1; i <= m; i++)
        printf("%d ", team[i]);
    printf("\n");*/

    int ans = 1;
    for (int i = 1, j = 0; i <= m; i++){
        if (dp[i-1]+ask(root[team[i]], root[team[i-1]], 1, n, team[i], n) < dp[j]+ask(root[team[i]], root[team[j]], 1, n, team[i], n))
            j = i-1;

        dp[i] = dp[j]+ask(root[team[i]], root[team[j]], 1, n, team[i], n)-team[i];

        //printf("i = %d, j = %d, dp = %d\n", i, j, dp[i]);

        if (dp[i] < 0)
            ans = 0;
    }

    //printf("ans = %d\n", ans);
	return ans;
}

Compilation message (stderr)

teams.cpp: In function 'void init(int, int*, int*)':
teams.cpp:52:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < stud[i].size(); j++)
                         ~~^~~~~~~~~~~~~~~~

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