#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E){
vector <ll> ans;
sort(W.begin(),W.end());
for (int it=0; it<E.size(); it++){
ll sm=B.size();
ll i=1;
for (i=1; i<W.size(); i++){
if (abs(W[i]-W[i-1])<=E[it]){i++;}
else{sm++;}
}
if (i==W.size()){sm++;}
ans.push_back(sm);
}
return ans;
}
| # | 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... |