Submission #1236142

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236142		Malix	모자이크 (IOI24_mosaic)	C++20	100 / 100	168 ms	86584 KiB

mosaic

#include "mosaic.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

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 m=T.size();
  vector<ll> ans(m,0);
  int n=X.size();
  if(n<=2){
    vii a(n,vi(n,0));
    REP(i,0,n)a[0][i]=X[i];
    REP(i,0,n)a[i][0]=Y[i];
    if(n==2)a[1][1]=(a[0][1]==0&&a[1][0]==0);
    REP(i,0,m)REP(j,T[i],B[i]+1)REP(k,L[i],R[i]+1)ans[i]+=a[j][k];
    return ans;
  }
  vector<vector<ll>> b(3,vector<ll>(n,0)),c(n,vector<ll>(3,0));
  REP(i,0,n)b[0][i]=X[i];
  REP(i,0,n)c[i][0]=Y[i];
  REP(i,0,3)b[i][0]=Y[i];
  REP(i,0,3)c[0][i]=X[i];
  REP(i,1,n)REP(j,1,3)if(c[i][j-1]==0&&c[i-1][j]==0)c[i][j]=1;
  REP(i,1,3)REP(j,1,n)if(b[i][j-1]==0&&b[i-1][j]==0)b[i][j]=1;
  int k=log2(n)+1;
  vector<vector<ll>> a(k,vector<ll>(2*n-5,0));
  REP(i,0,n-2)a[0][i]=c[n-1-i][2];
  REP(i,n-2,2*n-5)a[0][i]=b[2][i-n+5];
  REP(i,1,k)REP(j,0,2*n-5)if(j+(1<<(i-1))<2*n-5)a[i][j]=a[i-1][j]+a[i-1][j+(1<<(i-1))];
  REP(i,0,k)REP(j,1,2*n-5)a[i][j]+=a[i][j-1];
  REP(i,0,2)REP(j,1,n)b[i][j]+=b[i][j-1];
  REP(i,1,n)REP(j,0,2)c[i][j]+=c[i-1][j];
  REP(i,0,m){
    if(T[i]==0){
      ans[i]+=b[T[i]][R[i]]-(L[i]-1>=0?b[T[i]][L[i]-1]:0);
      T[i]=min(1,B[i]);
    }
    if(T[i]==1){
      ans[i]+=b[T[i]][R[i]]-(L[i]-1>=0?b[T[i]][L[i]-1]:0);
      T[i]=min(2,B[i]);
    }
    if(B[i]<=1)continue;
    if(L[i]==0){
      ans[i]+=c[B[i]][L[i]]-(T[i]-1>=0?c[T[i]-1][L[i]]:0);
      L[i]=min(1,R[i]);
    }
    if(L[i]==1){
      ans[i]+=c[B[i]][L[i]]-(T[i]-1>=0?c[T[i]-1][L[i]]:0);
      L[i]=min(2,R[i]);
    }
    if(R[i]<=1)continue;
    int x=L[i]-B[i]+n-3,y=L[i]-T[i]+n-3,z=R[i]-L[i]+1;
    for(int j=k-1;j>=0;j--)if(z&(1<<j)){
      ans[i]+=a[j][y]-(x-1>=0?a[j][x-1]:0);
      x+=(1<<j);
      y+=(1<<j);
    }
  }
  return ans;
}

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