Submission #1231270

#TimeUsernameProblemLanguageResultExecution timeMemory
1231270banganNile (IOI24_nile)C++20
17 / 100
2096 ms4212 KiB
#include "nile.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ALL(a) a.begin(), a.end() std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A, std::vector<int> B, std::vector<int> E) { int N = W.size(); int Q = E.size(); vector<int> ord(N); iota(ALL(ord), 0); sort(ALL(ord), [&](int i, int j) { return W[i]<W[j]; }); vector<ll> ret; for (int D : E) { ll res = 0; for (int i=0; i<N;) { int j = i+1; while (j<N && W[ord[j]] - W[ord[j-1]] <= D) j++; int sz = j-i; res += sz + sz%2; i=j; } ret.pb(res); } return ret; }
#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...