Submission #1312237

#	Time	Username	Problem	Language	Result	Execution time	Memory
1312237		exoworldgd	Mosaic (IOI24_mosaic)	C++20	12 / 100	1094 ms	2162688 KiB

mosaic

#include "mosaic.h"
#include<bits/stdc++.h>
#define ll long long
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
using namespace std;
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();
	vector<vector<int>>g(n,vector<int>(n));
	for(int i=0;i<n;i++)g[0][i]=X[i],g[i][0]=Y[i];
	for(int i=1;i<n;i++)for(int j=1;j<n;j++)g[i][j]=!(g[i-1][j]|g[i][j-1]);
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)g[i][j]+=(i?g[i-1][j]:0)+(j?g[i][j-1]:0)-(i&&j?g[i-1][j-1]:0);
	vector<ll>ans;
	for(int i=0,t,b,l,r,cnt;i<T.size();i++)t=T[i],b=B[i],l=L[i],r=R[i],cnt=g[b][r]-(t?g[t-1][r]:0)-(l?g[b][l-1]:0)+(t&&l?g[t-1][l-1]:0),ans.push_back(cnt);
	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