제출 #575420

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
575420		AbdullahMW	A Difficult(y) Choice (BOI21_books)	C++14	5 / 100	234 ms	976 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"
 
#define all(vec) vec.begin(), vec.end()
#define ll long long
#define db double
#define pb push_back
#define pf push_front
#define newl "\n"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define f first
#define s second
#define MOD 1000000007
 
using namespace std;

void solve(int n, int k, long long targ, int skm)
{
    vector <ll> ans(n + 1);
    for (ll i = 1; i <= n; i++) ans[i] = skim(i);
    
    for (ll i = 1; i <= n; i++)
    {
        ll l = 1, r = n;
        while (l < r)
        {
            if (l == i) 
            {
                l++;
                continue;
            }
            if (r == i)
            {
                r--;
                continue;
            }
            
            ll sum = ans[i] + ans[l] + ans[r];
            if (targ <= sum && sum <= 2 * targ)
            {
                vector <int> fin;
                fin.pb(i);
                fin.pb(l);
                fin.pb(r);
                answer(fin);
                return;
            }
            else if (sum > 2 * targ) r--;
            else if (sum < targ) l++;
        }
    }
    impossible();
    
}

// int main()
// {
//     fast
//     //setIO("");
// 
// 
// }

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