Submission #1320426

#TimeUsernameProblemLanguageResultExecution timeMemory
1320426unknown나일강 (IOI24_nile)C++20
17 / 100
2091 ms4628 KiB
#include <vector> #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(); sort(W.begin(), W.end()); vector<int> diff(N-1); for (int i = 0; i < N-1; i++) { diff[i] = W[i+1] - W[i]; } int Q = E.size(); vector<long long> R(Q, N); int run; for (int j = 0; j < Q; j++) { run = 0; for (int i = 0; i < N-1; i++) { if (diff[i] > E[j]) { if ((i - run) % 2 == 0) { R[j]++; } run = i+1; } } if ((N - run) % 2 == 1) { R[j]++; } } 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...