Submission #1245249

#	Time	Username	Problem	Language	Result	Execution time	Memory
1245249		Hamed_Ghaffari	Mosaic (IOI24_mosaic)	C++20	12 / 100	64 ms	9796 KiB

mosaic

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

using ll = long long;

const int MXN = 200;

int a[MXN][MXN];

vector<ll> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) {
    int n = X.size(), q = L.size();
    assert(n<=200 && q<=200);
    for(int i=0; i<n; i++) a[0][i] = X[i], a[i][0] = Y[i];
    if(n>=2)
        for(int i=1; i<n; i++)
            a[1][i] = !(a[1][i-1]|a[0][i]);
    auto DO = [&](int i, int j) -> void {
        for(int x=i,y=j; x<n && y<n; x++,y++)
            a[x][y] = 1;
    };
    int fir=-1;
    if(n>=3) {
        for(int i=1; i<n; i++) {
            a[2][i] = !(a[2][i-1]|a[1][i]);
            if(a[2][i]) {
                DO(2, i);
                if(fir==-1) fir = i;
            }
        }
    }
    for(int i=3; i<n; i++) {
        if(fir!=1) {
            if(a[i][0]==0) DO(i, 1), fir=0;
            else if(fir!=2) DO(i, 2), fir=1;
        }
        fir++;
    }
    vector<ll> ans(q);
    for(int i=0; i<q; i++) {
        int res=0;
        for(int x=T[i]; x<=B[i]; x++)
            for(int y=L[i]; y<=R[i]; y++)
                res += a[x][y];
        ans[i] = res;
    }
    return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 7 / 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