Submission #1278367

#TimeUsernameProblemLanguageResultExecution timeMemory
1278367avighnaMosaic (IOI24_mosaic)C++20
7 / 100
93 ms13412 KiB
#include <numeric>
#include <vector>

using int64 = long long;

std::vector<int64> mosaic(std::vector<int> X, std::vector<int> Y,
                          std::vector<int> T, std::vector<int> B,
                          std::vector<int> L, std::vector<int> R) {
  const int N = X.size();
  std::vector<int64> x(N + 1);
  for (int i = 1; i <= N; ++i) {
    x[i] = X[i - 1];
  }
  std::partial_sum(x.begin(), x.end(), x.begin());
  std::vector<int64> ans;
  for (int i = 0; i < T.size(); ++i) {
    int x1 = T[i] + 1, y1 = L[i] + 1, x2 = B[i] + 1, y2 = R[i] + 1;
    ans.push_back(x[y2] - x[y1 - 1]);
  }
  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...
#Verdict Execution timeMemoryGrader output
Fetching results...