제출 #799562

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

books

#include <bits/stdc++.h>

#include "books.h"

#define vv vector<int>
#define FOR(i, a, n) for (int i = a; i < n; i++)
#define mkp make_pair
#define INF 1000000003
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

    vector<long long> v(N);
    FOR(i, 0, N){
        v[i]=skim(i+1);
    }
    FOR(i,0,N){
        FOR(j,i+1,N){
            FOR(h,j+1,N){
                long long temp=v[i]+v[j]+v[h];
                if (temp >=A && temp<=2*A){
                    answer({i+1, j+1,h+1});
                    return;
                }
            }
        }
    }

    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