제출 #1224414

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224414		Jer	A Difficult(y) Choice (BOI21_books)	C++20	0 / 100	1 ms	416 KiB

books

#include <bits/stdc++.h>

#include "books.h"

typedef long long ll;

using namespace std;

const int MAXN = 1005;
ll books[MAXN];
int n;


void solve(int N, int K, long long A, int S) {
	n = N;

    for (int i = 1; i <= n; i++)
		books[i] = skim(i);

	
	int sum, l, r;
	for (int i = 1; i <= n - 2; i++){

		l = i + 1, r = n;

		while (l < r){
			sum = books[i] + books[l] + books[r];

			if (sum < A)
				l++;
			else if (sum > 2 * A)
				r--;
			else
				answer({i, l, r});
		}
	}

	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