Submission #1244412

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244412		MarwenElarbi	Mosaic (IOI24_mosaic)	C++20	22 / 100	1075 ms	2162688 KiB

mosaic

#include "mosaic.h"
#include <bits/stdc++.h>
using namespace std;

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 n = X.size();
  int q = T.size();
  vector<long long> ans;
  int tab[n][n];
  for (int i = 0; i < n; ++i)
  {
    for (int j = 0; j < n; ++j)
    {
      if(i==0) tab[i][j]=X[j];
      else if(j==0) tab[i][j]=Y[i];
      else tab[i][j]=(tab[i-1][j]+tab[i][j-1]==0 ? 1 : 0);
    }
  }
  int pre[n][n];
  for (int i = 0; i < n; ++i)
  {
    for (int j = 0; j < n; ++j)
    {
      pre[i][j]=tab[i][j];
      if(i) pre[i][j]+=pre[i-1][j];
      if(j) pre[i][j]+=pre[i][j-1];
      if(i>0&&j>0) pre[i][j]-=pre[i-1][j-1];
    }
  }
  for (int i = 0; i < q; ++i)
  {
    ans.push_back(pre[B[i]][R[i]]-(T[i] ? pre[T[i]-1][R[i]] : 0)-(L[i] ? pre[B[i]][L[i]-1] : 0)+(L[i]>0&&T[i]>0 ? pre[T[i]-1][L[i]-1] : 0));
  }
  return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 0 / 7
• Subtask 4: 10 / 10
• Subtask 5: 0 / 8
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19
• Subtask 8: 0 / 22