Submission #1235814

#TimeUsernameProblemLanguageResultExecution timeMemory
1235814repsakMosaic (IOI24_mosaic)C++20
12 / 100
1099 ms2162688 KiB
#include "mosaic.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) {
	int N = (int)X.size();
	int Q = (int)T.size();

	vector<vector<int>> grid(N, vector<int>(N));

	for(int i = 0; i < N; i++){
		grid[0][i] = X[i];
		grid[i][0] = Y[i];
	}

	for(int y = 1; y < N; y++){
		for(int x = 1; x < N; x++){
			int color = grid[y][x - 1] == 0 && grid[y - 1][x] == 0 ? 1 : 0; 
			grid[y][x] = color;
		}
	}

	vector<ll> r(Q);

	for(int i = 0; i < Q; i++){
		ll amount = 0;

		for(int y = T[i]; y <= B[i]; y++){
			for(int x = L[i]; x <= R[i]; x++){
				if(grid[y][x] == 1) amount++;
			}
		}

		r[i] = amount;
	}

  	return r;
}

// #include "grader.cpp"
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...