제출 #1111307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1111307		thieunguyenhuy	모자이크 (IOI24_mosaic)	C++17	22 / 100	1180 ms	1580684 KiB

mosaic

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

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

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 = T.size();
	vector<vector<int>> c(n, vector<int>(n));
	for (int i = 0; i < n; ++i) c[0][i] = X[i];
	for (int i = 0; i < n; ++i) c[i][0] = Y[i];

	for (int i = 1; i < n; ++i) for (int j = 1; j < n; ++j) {
		c[i][j] = !(c[i - 1][j] | c[i][j - 1]);
	}

	vector<vector<ll>> pref(n, vector<ll>(n, 0));
	for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) {
		pref[i][j] = c[i][j];
		if (i > 0) pref[i][j] += pref[i - 1][j];
		if (j > 0) pref[i][j] += pref[i][j - 1];
		if (i > 0 && j > 0) pref[i][j] -= pref[i - 1][j - 1];
	}

	auto get = [&](int x, int y, int u, int v) {
		ll ans = pref[u][v];
		if (x > 0) ans -= pref[x - 1][v];
		if (y > 0) ans -= pref[u][y - 1];
		if (x > 0 && y > 0) ans += pref[x - 1][y - 1];
		return ans;
	};

	vector<ll> ans(q);
	for (int i = 0; i < q; ++i) {
		ans[i] = get(T[i], L[i], B[i], R[i]);
	}

	return ans;
}

void get(vector<int> &container) {
	for (auto &x : container) cin >> x;
}

#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    int n, q; cin >> n >> q;

    vector<int> X(n), Y(n), T(q), B(q), L(q), R(q);
    
    get(X), get(Y), get(T), get(B), get(L), get(R);

   	vector<ll> ans = mosaic(X, Y, T, B, L, R);
   	for (auto &x : ans) cerr << x << ' ';
   	cerr << '\n';

    cerr << '\n'; return 0;
}
#endif

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