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"
using namespace std;
long long b[200001];
void solve(int n, int k, long long a, int s) {
map<int,int>v;
for(int i = 0; i < n; i++) {
b[i] = skim(i + 1);
}
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
for(int t = j + 1; t < n; t++){
int tot = b[i] + b[j] + b[t];
if(tot >= a && tot <= 2 * a){
vector<int>fin = {i+1,j+1,t+1};
answer(fin);
}
}
}
}
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... |