제출 #1105673

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1105673		Zicrus	모자이크 (IOI24_mosaic)	C++17	12 / 100	1240 ms	1466196 KiB

mosaic

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

typedef long long ll;

ll n, q;
vector<vector<ll>> lay, layPref;
vector<ll> stairs;

/*ll test(ll t, ll b, ll l, ll r) {
    if (t == 0) t++;
    if (l == 0) l++;
    ll ans = (b-t+1)*(r-l+1);
    if ((t-l)&1) ans = ans/2;
    else ans = (ans+1)/2;
    return ans;
}*/

vector<ll> mosaicNaive(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) {
    n = X.size();
    q = T.size();
    vector<vector<bool>> grid(n, vector<bool>(n));
    for (int i = 0; i < n; i++) {
        grid[0][i] = X[i];
        grid[i][0] = Y[i];
    }
    for (int row = 1; row < n; row++) {
        for (int col = 1; col < n; col++) {
            grid[row][col] = !grid[row-1][col] && !grid[row][col-1];
        }
    }

    vector<ll> res(q);
    for (int k = 0; k < q; k++) {
        ll ans = 0;
        for (int row = T[k]; row <= B[k]; row++) {
            for (int col = L[k]; col <= R[k]; col++) {
                ans += grid[row][col];
            }
        }
        res[k] = ans;
    }
    return res;
}

vector<ll> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) {
    n = X.size();
    q = T.size();
    vector<vector<bool>> grid(n, vector<bool>(n));
    for (int i = 0; i < n; i++) {
        grid[0][i] = X[i];
        grid[i][0] = Y[i];
    }
    for (int row = 1; row < n; row++) {
        for (int col = 1; col < n; col++) {
            grid[row][col] = !grid[row-1][col] && !grid[row][col-1];
        }
    }

    vector<ll> res(q);
    for (int k = 0; k < q; k++) {
        ll ans = 0;
        for (int row = T[k]; row <= B[k]; row++) {
            for (int col = L[k]; col <= R[k]; col++) {
                ans += grid[row][col];
            }
        }
        res[k] = ans;
    }
    return res;
}

#ifdef TEST
#include "grader.cpp"
#endif

• 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