Submission #1244466

#	Time	Username	Problem	Language	Result	Execution time	Memory
1244466		AlperenT_	Mosaic (IOI24_mosaic)	C++20	5 / 100	1095 ms	30536 KiB

mosaic

#include "mosaic.h"

#include <vector>
#include <bits/stdc++.h> 
#pragma GCC optimize("O3,unroll-loops") 
#pragma GCC target("avx2") 
#define pb push_back
#define F first
#define pii pair<int,int> 
#define all(a) a.begin(),a.end()
#define S second 
#define sz(a) (int)a.size()
#define rep(i , a , b) for(int i = (a) ; i <= (b) ; i++)
#define per(i , a , b) for(int i = (a) ; i >= (b) ; i--)
#define ld double
#define ll long long 
using namespace std ;
const int maxn = 5000  + 100 , inf = 1e9 , mod = 998244353;
ll a[maxn][maxn]  , s[maxn][maxn] ; 
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 = sz(X) ;
  rep(i , 0 , n-1){
    a[0][i] = X[i] ;
    a[i][0] = Y[i] ;
  }
  rep(i , 1, n-1){
    rep(j ,1, n-1){
      if(a[i-1][j]==0 && a[i][j-1]==0){
        a[i][j] = 1; 
      }else{
        a[i][j] = 0 ;
      }
    }
    if(i > 100){
      rep(j ,2 ,n-1){
        if(a[i][j-1] == a[i][j]){
          while(1){

          }
        }
      }
    }
  }
  rep(i, 0 ,n-1){
    rep( j, 0 ,n-1){
      s[i][j] = a[i][j] ;
      if(i)s[i][j] += s[i-1][j] ;
      if(j)s[i][j] += s[i][j-1];
      if(i&&j)s[i][j] -= s[i-1][j-1] ;
    }
  }
  vector <ll> C ;
  rep(i , 0 , sz(T)-1){
    ll ans = s[B[i]][R[i]] ;
    if(L[i])ans -= s[B[i]][L[i]-1] ;
    if(T[i])ans -= s[T[i]-1][R[i]] ;
    if(L[i] && T[i])ans += s[T[i]-1][L[i]-1] ;
    C.pb(ans) ;
  }
  return C;
}

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