Submission #1192106

#TimeUsernameProblemLanguageResultExecution timeMemory
1192106sakibulislamNile (IOI24_nile)C++17
0 / 100
20 ms2772 KiB
#include <bits/stdc++.h> #include "nile.h" std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A, std::vector<int> B, std::vector<int> E) { int Q = (int)E.size(); std::vector<long long> R; sort(W.begin(), W.end()); for (int d:E){ long long res=0; int f=0, l=1; while (l<Q){ if (abs(B[f]-B[l])<=d){ res+= abs(B[f]-B[l]); f=+2; l+=2; } else{ res+= A[f]; f=l; l++; } } R.push_back(res); } return R; }
#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...