Submission #1207805

#TimeUsernameProblemLanguageResultExecution timeMemory
1207805tamzidMosaic (IOI24_mosaic)C++20
7 / 100
75 ms12104 KiB
#include "mosaic.h"
#include <vector>

std::vector<long long> 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) {
  int Q = (int)T.size();
  std::vector<long long> C(Q, 0);

  int n = X.size();
  std::vector<int> prefix(n+1,0);
  for(int i=1;i<=n;++i)
  {
    prefix[i]+=prefix[i-1];
    if(X[i-1] == 1)
    {
      ++prefix[i];
    }
  }

  for(int i=0;i<Q;++i)
  {
    int x = L[i] + 1, y = R[i] + 1;
    C[i] = prefix[y] - prefix[x - 1];
  }

  return C;
}
#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...