Submission #575023

#TimeUsernameProblemLanguageResultExecution timeMemory
575023m_fenaisA Difficult(y) Choice (BOI21_books)C++14
5 / 100
492 ms976 KiB
#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 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...