Submission #1320292

#TimeUsernameProblemLanguageResultExecution timeMemory
1320292unknown나일강 (IOI24_nile)C++20
17 / 100
2095 ms4628 KiB
#include <vector> #include <numeric> #include <algorithm> using namespace std; vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) { int N = W.size(); int Q = E.size(); vector<long long> R(Q, 2*N); sort(W.begin(), W.end()); vector<int> X(N-1); for (int i = 0; i < N-1; i++) { X[i] = W[i+1] - W[i]; } int count; for (int j = 0; j < Q; j++) { count = 0; for (int i = 0; i < N-1; i++) { if (X[i] <= E[j]) { count++; i++; } } R[j] -= 2*count; } 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...