# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
403364 | Nordway | A Difficult(y) Choice (BOI21_books) | C++17 | 2 ms | 376 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>
#define sz(v) (int)v.size()
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 1e5 + 1;
bool asked[N];
ll x[N];
ll ask (int i) {
if (asked[i]) return x[i];
asked[i] = true;
x[i] = skim(i);
return x[i];
}
void solve(int n,int k,ll A,int s){
for (int i = 1; i <= n; i++) {
asked[i] = false;
}
int l = 1, r = n, R = 0;
# | 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... |