제출 #575057

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
575057		Rifal	A Difficult(y) Choice (BOI21_books)	C++14	5 / 100	191 ms	976 KiB

books

#include <bits/stdc++.h>

#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) {

    long long arr[N+1] = {};
    for(int i = 1; i <= N; i++)
    {
        arr[i] = skim(i);
    }
    for(int i = 1; i <= N; i++)
    {
        for(int j = i+1; j <= N; j++)
        {
            for(int q = j+1; q <= N; q++)
            {
                long long sum = arr[i]+arr[j]+arr[q];
                if(sum >= A && sum <= A*2)
                {
                    answer({i,j,q});
                }
            }
        }
    }
    /*for(int i = 1; i <= N; i++)
    {
        arr[i] += arr[i-1];
    }
    for(int i = K; i <= N; i++)
    {
        long long sum = arr[i]-arr[i-K];
        if(sum >= A && sum <= A*2)
        {
            for(int j = (i-K)+1; j <= i; j++)
            {
                ans.push_back(j);
            }
            break;
        }
    }*/
        impossible();
}

• 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