Submission #1246489

#	Time	Username	Problem	Language	Result	Execution time	Memory
1246489		CyberCow	Mosaic (IOI24_mosaic)	C++20	53 / 100	142 ms	59824 KiB

mosaic

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

vector<int> a[200005];
vector<int> pref[200005];

int n;

vector<ll> hart, hartpref, hartpp;
vector<ll> hartR, hartprefR, hartppR;

ll getachox(int x, int y)
{
  if(x > y)return 0;
  if(x == 0)return hartpp[y];
  return hartpp[y] - hartpp[x - 1] - x * (hartpref[y] - hartpref[x - 1]);
}

ll getnvaz(int x, int y)
{
  swap(x, y);
  x = hartppR.size() - x - 1;
  y = hartppR.size() - y - 1;
  if(x > y)return 0;
  if(x == 0)return hartppR[y];
  return hartppR[y] - hartppR[x - 1] - x * (hartprefR[y] - hartprefR[x - 1]);
}


int gumqaq(int x, int x1, int y, int y1)
{
  if(x > x1)
  {
    swap(x, x1);
    swap(y, y1);
  }
  if(y > y1)
  {
    swap(x, x1);
    swap(y, y1);
  }
  int arj = pref[x1][y1];
  if(x)arj -= pref[x - 1][y1];
  if(y)arj-=pref[x1][y - 1];
  if(x && y)arj += pref[x - 1][y - 1];
  return arj;
}

ll getzayobexa(int x, int y)
{
  if(x > y)return 0;
  if(x == 0)return hartpref[y];
  return hartpref[y] - hartpref[x - 1];
}

int gum(int x, int x1, int y, int y1)
{
  if(x1 <= 2 || y1 <= 2)
  {
    return gumqaq(x, x1, y, y1);
  }
  ll qaq = 0;
  if(y <= 0)
    qaq += gum(x, x1, 0 ,0);
  if(y <= 1 && 1 <= y1)
    qaq += gum(x, x1, 1, 1);
  y = max(y, 2);
  if(x <= 0)
    qaq += gum(0, 0, y, y1);
  if(x <= 1 && 1 <= x1)
    qaq += gum(1, 1, y, y1);
  x = max(x, 2);

  int erk = y1 - y + 1;
  int qan = x1 - x + 1;

  int sksel = min(erk, qan);

  swap(x, x1);

  int han = min(x - 2, y - 2);
  x -= han;
  y -= han;
  han = min(x1 - 2, y1 - 2);
  x1 -= han;
  y1 -= han;

  int ind = a[x][y];
  int ind1 = a[x1][y1];

  ll ans = 0;

  ans += getachox(ind, ind + sksel - 2);
  ans += getnvaz(ind1 - sksel + 2, ind1);
  ans += getzayobexa(ind + sksel - 1, ind1 - sksel + 1) * sksel;
  return ans + qaq;
}

vector<long long> mosaic(vector<int> X, vector<int> Y,
                              vector<int> T, vector<int> B,
                              vector<int> L, vector<int> R) {
  int Q = (int)T.size();
  vector<long long> C(Q, 0);
  pref[0].push_back(X[0]);
  a[0].push_back(X[0]);
  for (int i = 1; i < X.size(); i++)
  {
    a[0].push_back(X[i]);
    pref[0].push_back(pref[0][i - 1] + a[0][i]);
  }
  for (int i = 1; i < Y.size(); i++)
  {
    a[i].push_back(Y[i]);
    pref[i].push_back(pref[i - 1][0] + a[i][0]);
  }
  int n = X.size();
  for (int i = 1; i < n; i++)
  {
    for (int j = 1; j < n; j++)
    {
      if(i <= 2 || j <= 2)
      {
        if(a[i - 1][j] == 0 && a[i][j - 1] == 0)
        {
          a[i].push_back(1);
        }
        else
        {
          a[i].push_back(0);
        }
        pref[i].push_back(pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1] + a[i][j]);
      }
      else
      break;
    }
  }
  if(X.size() <= 2)
  {
    for (int i = 0; i < Q; i++)
    {
      C[i] = gum(T[i], B[i], L[i], R[i]);
    }
    return C;
  }
  for (int i = X.size() - 1; i >= 2; i--)
  {
    hart.push_back(a[i][2]);
    a[i][2] = hart.size() - 1;
  }
  for (int i = 3; i < X.size(); i++)
  {
    hart.push_back(a[2][i]);
    a[2][i] = hart.size() - 1;
  }
  hartpref.push_back(hart[0]);
  for (int i = 1; i < hart.size(); i++)
  {
    hartpref.push_back(hartpref[i - 1] + hart[i]);
  }
  hartpp.push_back(hartpref[0]);
  for (int i = 1; i < hartpref.size(); i++)
  {
    hartpp.push_back(hartpp[i - 1] + hartpref[i]);
  }
  hartR = hart;
  
  reverse(hartR.begin(), hartR.end());
//
hartprefR.push_back(hartR[0]);
  for (int i = 1; i < hartR.size(); i++)
  {
    hartprefR.push_back(hartprefR[i - 1] + hartR[i]);
  }
  hartppR.push_back(hartprefR[0]);
  for (int i = 1; i < hartprefR.size(); i++)
  {
    hartppR.push_back(hartppR[i - 1] + hartprefR[i]);
  }
  //
  for (int i = 0; i < Q; i++)
  {
    C[i] = gum(T[i], B[i], L[i], R[i]);
  }
  return C;
}

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