oj.uz

Submission #947800

# Submission time Handle Problem Language Result Execution time Memory
947800 2024-03-17T03:19:43 Z willychan A Difficult(y) Choice (BOI21_books) C++17
0 / 100
 1 ms 344 KB 
#include <bits/stdc++.h>

#include "books.h"

using namespace std;
typedef long long ll;
//
// --- 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(K!=3) return;
	vector<ll> v(N);
	for(int i=1;i<=N;i++) v[i-1] = skim(i);
	for(int i=0;i<N;i++){
		for(int j=i+1;j<N;j++){
			ll g = v[i]+v[j];
			int l = lower_bound(v.begin()+j+1,v.end(),A-g)-v.begin();
			cout<<i<<" "<<j<<" "<<l<<"\n";
			if(l>j && v[l]+g<=2*A){
				answer({i+1,j+1,l+1});
				return;
			}
		}
	}
	impossible();
	return ;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Do not print anything to stdout
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Do not print anything to stdout
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -