제출 #1236113

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236113		Malix	Mosaic (IOI24_mosaic)	C++20	22 / 100	90 ms	29996 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));
    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;
  vector<ll> a(2*n-5);
  REP(i,0,n-2)a[i]=c[n-1-i][2];
  REP(i,n-2,2*n-5)a[i]=b[2][i-n+5];
  REP(i,0,m){
    if(T[i]<=1)ans[i]=b[T[i]][L[i]];
    else if(L[i]<=1)ans[i]=c[T[i]][L[i]];
    else ans[i]=a[L[i]-T[i]+n-3];
  }
  return ans;
}

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