제출 #1247094

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1247094		ErJ	모자이크 (IOI24_mosaic)	C++20	5 / 100	97 ms	50504 KiB

mosaic

#include "mosaic.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define pp pair<ll, ll>
#define vp vector<pp>


vi small(std::vector<int> X, std::vector<int> Y, std::vector<int> T, std::vector<int> B, std::vector<int> L, std::vector<int> R){
		ll n = X.size();
	vvi grid(n, vi(n, 0));
	for(int i = 0; i < n; i++){
		grid[i][0] = X[i];
		grid[0][i] = Y[i];
	}
	
	for(int i = 1; i < n; i++){
		for(int j = 1; j < n; j++){
			if(grid[i - 1][j] == 0 && grid[i][j - 1] == 0){
				grid[i][j] = 1;
			}
		}
	}
	vvi pref(n + 1, vi(n + 1, 0));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			pref[i + 1][j + 1] = pref[i + 1][j] + pref[i][j + 1] - pref[i][j] + grid[i][j];
			/*if(grid[i][j] == 0){
				cout << '.';
			}else{
				cout << '#';
			}*/
		}
		//cout << '\n';
	}
	ll q = (int)T.size();
	vi C(q, 0);
	for(int i = 0; i < q; i++){
		C[i] = pref[R[i] + 1][B[i] + 1] - pref[R[i] + 1][T[i]] - pref[L[i]][B[i] + 1] + pref[L[i]][T[i]];
	}
	return C;
}

vi 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) {
	ll n = X.size();


	if(n < 10){
		return small(X, Y, T, B, L, R);
	}

	vvi gridRow(n, vi(10, 0)), gridCol(10, vi(n, 0));

	for(int i = 0; i < n; i++){
		gridRow[i][0] = X[i];
	}
	for(int i = 0; i < gridRow.size(); i++){
		gridRow[0][i] = Y[i];
	}

	for(int i = 1; i < gridRow.size(); i++){
		for(int j = 1; j < gridRow[i].size(); j++){
			if(gridRow[i - 1][j] == 0 && gridRow[i][j - 1] == 0){
				gridRow[i][j] = 1;
			}
		}
	}

	for(int i = 0; i < n; i++){
		gridCol[0][i] = Y[i];
	}
	for(int i = 0; i < gridCol.size(); i++){
		gridCol[i][0] = X[i];
	}

	for(int i = 1; i < gridCol.size(); i++){
		for(int j = 1; j < gridCol[i].size(); j++){
			if(gridCol[i - 1][j] == 0 && gridCol[i][j - 1] == 0){
				gridCol[i][j] = 1;
			}
		}
	}

	set<ll> black;

	for(int i = 9; i < n; i++){
		if(gridRow[i][9] == 1){
			black.insert(i - 9);
		}
	}

	for(int i = 9; i < n; i++){
		if(gridCol[9][i] == 1){
			black.insert(9 - i);
		}
	}


	ll q = (int)T.size();
	vi C(q, 0);
	for(int i = 0; i < q; i++){
		if(L[i] < 10){
			if(gridCol[L[i]][T[i]]) C[i] = 1;
		} else if(T[i] < 10){
			if(gridRow[L[i]][T[i]]) C[i] = 1;
		} else if(black.count(L[i] - T[i])) C[i] = 1;
	}
	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