| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1333995 | GoBananas69 | Nile (IOI24_nile) | C++20 | 2094 ms | 4144 KiB |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
vector<ll> calculate_costs(vector<int> w, vector<int> A, vector<int> B, vector<int> E) {
int n = w.size();
sort(w.begin(), w.end());
int q = E.size();
vector<ll> res(q);
for (int k = 0; k < q; ++k) {
int d = E[k];
int ans = 0;
for (int i = 0; i < n; ) {
if (i + 1 < n && w[i + 1] - w[i] <= d) {
ans += 2;
i += 2;
} else {
i += 1;
}
}
res[k] = 2LL * n - ans;
}
return res;
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
