제출 #1103497

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1103497		ezzzay	모자이크 (IOI24_mosaic)	C++17	0 / 100	380 ms	423496 KiB

mosaic

#include <vector>
#include<bits/stdc++.h>
using namespace std;
const int N=5055;
#define ll long long
#define pb push_back
ll a[N][N];
ll ps[N][N];
std::vector<long long> 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) {
    int n=X.size();
	for(int i=0;i<n;i++){
		a[0][i]=X[i];
		a[i][0]=Y[i];
	}            
	for(int i=1;i<n;i++){
		for(int j=1;j<n;j++){
			if(a[i][j-1]+a[i-1][j]==0)a[i][j]=1;
			else a[i][j]=0;
		}
	}      	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			ps[i][j]=ps[i-1][j]+ps[i][j-1]-ps[i-1][j-1]+a[i-1][j-1];
		}
	}
	int Q = (int)T.size();
	vector<ll>ans;
    for(int f=0;f<Q;f++){
    	int x=T[f],y=B[f],l=L[f],r=R[f];
    
    	y++;
    	r++;
    	ll g= ps[y][r]-ps[y][l]-ps[x][r]-ps[x][l];
    	ans.pb(g);
	}
	return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 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