Submission #944323

#TimeUsernameProblemLanguageResultExecution timeMemory
944323bngybongybrdA Difficult(y) Choice (BOI21_books)C++17
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
 
#include "books.h"
 
using namespace std;
 
void solve(int N, int K, long long A, int S) {
    //int diff[100005];
 
    if(skim(1)*3 > 2*A){impossible();}
    if(skim(N)*K < A){impossible();}
    //for(int i = 1; i <= S; i++){diff[i-1] = skim(i);}
 
    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...