제출 #1000030

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1000030		dilanyan	A Difficult(y) Choice (BOI21_books)	C++17	0 / 100	117 ms	344 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) {
    if (n == s) {
        vector<long long> a(n + 1);
        for (int i = 1;i <= n;i++) a[i] = skim(i);
        for (int i = 1;i <= n;i++) {
            if (a[i] >= 2 * A) break;
            for (int j = i + 1;j <= n;j++) {
                if (a[i] + a[j] >= 2 * A) break;
                for (int x = j + 1;x <= n;x++) {
                    if (a[i] + a[j] + a[x] > 2 * A) break;
                    if (a[i] + a[j] + a[x] > A) {
                        answer({ i,j,x });
                    }
                }
            }
        }
        impossible();
    }
}

• Subtask 1: 0 / 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