Submission #701061

#	Time	Username	Problem	Language	Result	Execution time	Memory
701061		finn__	Teams (IOI15_teams)	C++17	0 / 100	4070 ms	90300 KiB

teams

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

struct FenwickTree2dOff
{
    vector<vector<int>> t, c;
    bool initialized = 0;

    FenwickTree2dOff() {}

    FenwickTree2dOff(int64_t n)
    {
        t = vector<vector<int>>(n);
        c = vector<vector<int>>(n);
    }

    void initialize()
    {
        for (int64_t i = 0; i < t.size(); i++)
        {
            sort(c[i].begin(), c[i].end());
            c[i].resize(unique(c[i].begin(), c[i].end()) - c[i].begin());
            t[i] = vector<int>(c[i].size(), 0);
        }
        initialized = 1;
    }

    void increment(int64_t i, int64_t j, int x)
    {
        i++, j++;

        while (i <= t.size())
        {
            if (!initialized)
                c[i - 1].push_back(j);
            else
            {
                int64_t u = upper_bound(c[i - 1].begin(), c[i - 1].end(), j) - c[i - 1].begin();
                while (u <= t[i - 1].size())
                {
                    t[i - 1][u - 1] += x;
                    u += u & -u;
                }
            }
            i += i & -i;
        }
    }

    int prefix_sum(int64_t i, int64_t j)
    {
        i++, j++;
        int x = 0;

        while (i)
        {
            int64_t u = upper_bound(c[i - 1].begin(), c[i - 1].end(), j) - c[i - 1].begin();
            while (u)
            {
                x += t[i - 1][u - 1];
                u -= u & -u;
            }
            i -= i & -i;
        }

        return x;
    }

    int sum(int64_t i1, int64_t j1, int64_t i2, int64_t j2)
    {
        return prefix_sum(i2, j2) - prefix_sum(i1 - 1, j2) -
               prefix_sum(i2, j1 - 1) + prefix_sum(i1 - 1, j1 - 1);
    }
};

FenwickTree2dOff tree;
int n;

void init(int N, int A[], int B[])
{
    n = N;
    tree = FenwickTree2dOff(N + 2);
    for (int64_t i = 0; i < N; i++)
        tree.increment(A[i], B[i], 1);
    tree.initialize();
    for (int64_t i = 0; i < N; i++)
        tree.increment(A[i], B[i], 1);
}

int can(int M, int K[])
{
    sort(K, K + M);
    int y_lim = 1, residual = 0;

    for (int64_t i = 0; i < M; i++)
    {
        if (K[i] <= residual)
        {
            residual -= K[i];
            continue;
        }
        int a = max(y_lim, K[i]), b = n + 1;
        while (a < b) // Binary search for the highest end index needed.
        {
            int const y = (a + b) / 2;
            if (tree.sum(1, y_lim, K[i], y) >= K[i] - residual)
                b = y;
            else
                a = y + 1;
        }
        if (a == n + 1)
            return 0;
        residual = tree.sum(1, y_lim, K[i], a) - (K[i] - residual);
        y_lim = a + 1;
    }

    return 1;
}

Compilation message (stderr)

teams.cpp: In member function 'void FenwickTree2dOff::initialize()':
teams.cpp:20:31: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         for (int64_t i = 0; i < t.size(); i++)
      |                             ~~^~~~~~~~~~
teams.cpp: In member function 'void FenwickTree2dOff::increment(int64_t, int64_t, int)':
teams.cpp:33:18: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         while (i <= t.size())
      |                ~~^~~~~~~~~~~
teams.cpp:36:36: warning: conversion from 'int64_t' {aka 'long int'} to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
   36 |                 c[i - 1].push_back(j);
      |                                    ^
teams.cpp:40:26: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |                 while (u <= t[i - 1].size())
      |                        ~~^~~~~~~~~~~~~~~~~~

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