This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "books.h"
typedef long long ll;
using namespace std;
void solve(int N, int K, long long A, int S) {
vector<ll> v(N+1);
for(int i=1; i<=N; i++){
v[i] = skim(i);
}
for(int i=1; i<=N; i++)
{
for(int j=i+1; j<=N; j++)
{
for(int z=j+1; z<=N; z++)
{
ll cnt = v[i] + v[j] + v[z];
if(cnt <= A*2 && cnt >= A && i != j && i != z && z != j)
{
vector<int> ans;
ans.push_back(i);
ans.push_back(j);
ans.push_back(z);
answer(ans);
}
}
}
}
impossible();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |