Submission #1311894

#TimeUsernameProblemLanguageResultExecution timeMemory
1311894eri16나일강 (IOI24_nile)C++20
17 / 100
2096 ms4188 KiB
#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 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...
#Verdict Execution timeMemoryGrader output
Fetching results...