Submission #142575

#	Time	Username	Problem	Language	Result	Execution time	Memory
142575		andreiomd	Detecting Molecules (IOI16_molecules)	C++11	19 / 100	2 ms	376 KiB

molecules

#include <bits/stdc++.h>
#include "molecules.h"

using namespace std;

const int NMAX = 2e5 + 5;

int N, A[NMAX];

long long dp[NMAX];

static long long Sum (int Left, int Right)
{
    if(Left > Right)
        return 0LL;

    return dp[Right] - dp[Left - 1];
}

vector < int > find_subset (int l, int u, vector < int > w)
{
    int N = (int)w.size();

    for(int i = 0; i < N; ++i)
        A[i + 1] = w[i];

    for(int i = 1; i <= N; ++i)
        dp[i] = dp[i - 1] + 1LL * A[i];

    bool Ok = false;

    int Left = 1, Right = 0;

    for(Left = 1, Right = 0; Left <= N; ++Left)
    {
        while(Sum(Left, Right) < l && Left <= N && Right <= N)
            ++Right;

        if(Sum(Left, Right) >= l && Sum(Left, Right) <= u)
        {
            Ok = true;

            break;
        }

        while(Sum(Left, Right) > u && Left <= N && Right <= N)
            ++Left;

        if(Sum(Left, Right) >= l && Sum(Left, Right) <= u)
        {
            Ok = true;

            break;
        }
    }

    vector < int > Sol;

    if(Ok)
    {
        for(int i = Left; i <= Right; ++i)
            Sol.push_back(i - 1);

        return Sol;
    }

    Left = 1;
    Right = 0;

    for(Left = 1, Right = 0; Left <= N && Right <= N && !Ok; ++Left)
    {

        for(int i = 1; i <= 16; ++i)
        {
            while(Sum(Left, Right) < l && Left <= N && Right <= N)
                ++Right;

            while(Sum(Left, Right) > u && Left <= N && Right <= N)
                ++Left;

            if(Sum(Left, Right) >= l && Sum(Left, Right) <= u)
            {
                Ok = true;

                break;
            }
        }
    }

    if(Ok)
    {
        for(int i = Left; i <= Right; ++i)
            Sol.push_back(i - 1);

        return Sol;
    }

    return Sol;
}

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 23
• Subtask 6: 0 / 31