Submission #1224418

#TimeUsernameProblemLanguageResultExecution timeMemory
1224418JerA Difficult(y) Choice (BOI21_books)C++20
5 / 100
8 ms420 KiB
#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);

	
	ll sum;
	int 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();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...