Submission #575028

#	Time	Username	Problem	Language	Result	Execution time	Memory
575028		Dos	A Difficult(y) Choice (BOI21_books)	C++14	10 / 100	3 ms	244 KiB

books

#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

#include "books.h"

using namespace std;
//
// --- Sample implementation for the task books ---
//
// To compile this program with the sample grader, place:
//     books.h books_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ books_sample.cpp sample_grader.cpp
// in this folder.
//

void solve(int N, int K, long long A, int S) {
    // TODO implement this function


    if(S == N && K == 3)
    {

        int a[N+1];

        for(int i =1; i <= N; i++)
        {
            a[i] = skim(i);
        }

        for(int i = 3; i <= N; i++)
        {
            int l, r;
            l = 1;
            r = i - 1;

            while(l < r)
            {
                if(a[l] + a[r] + a[i] > 2*A)
                {
                    r--;
                } else if(a[l] + a[r] + a[i] < A)
                {
                    l++;
                } else
                {
                    vector<int> ans;
                    ans.push_back(i);
                    ans.push_back(l);
                    ans.push_back(r);
                    answer(ans);
                    return;
                }
            }

        }

        impossible();
        return;

    }

    int l, r;
    l = 1;
    r = N;

    //int firstBook = INT_MAX;

    while(l <= r)
    {
        int mid = (l+r+1)/2;

        long long sum = skim(mid);

        bool f = false;

        for(int i = mid+1; i < mid + K; i++)
        {
            if(i > N)
            {
                r = mid-1;
                f = true;
                break;
            }
            sum += skim(i);
        }

        if(f)
        {
            continue;
        }

        if(sum < A)
        {
            l = mid+1;
        } else if(sum > 2*A)
        {
            r = mid-1;
        } else
        {
            vector<int> ans;
            for(int i = mid; i < mid + K; i++)
            {
                ans.push_back(i);
            }

            answer(ans);
        }
    }

    impossible();


}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 10 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20