# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574844 | Majid | A Difficult(y) Choice (BOI21_books) | C++17 | 3 ms | 976 KiB |
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;
using ll = long long;
using db = double;
#define pb push_back
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(), vec.end()
#define f first
#define s second
const int MOD = 1e9 + 7;
const ll BIGINF = ((ll)1e18) + 7;
#define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL);
// ll answer(vector<int> x){
//
// cout<<"ok";
// }
//
// ll skim(ll x){
//
// return x+2;
// }
//
// void impossible(){
//
// cout<<"not ok";
// }
void solve(int n, int k, ll a, int s){
vector<ll> vec(n);
for(ll i = 0; i < n; i++){
vec[i] = skim(i+1);
}
ll sum = 0;
if(k==3){
for(ll i = 0; i < n; i++){
for(ll j = i+1; j < n; j++){
for(ll l = j+1; l < n; l++){
ll sum = vec[i] + vec[j] + vec[l];
if(sum>=a and sum<=2*a){
vector<int> temp(3);
temp.pb(vec[i]);
temp.pb(vec[j]);
temp.pb(vec[l]);
answer(temp);
}
}
}
}
}
impossible();
// answer(temp);
}
//
// int main(){
//
// solve(5, 3, 10, 0);
// }
Compilation message (stderr)
# | 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... |