SRM508 Div2 Easy(250) CandyShop
#include <vector> using namespace std; class CandyShop{public: int countProbablePlaces( vector <int> X, vector <int> Y, vector <int> R ) { int n = (int)X.size(); int c = 0; for ( int x=-200; x<=200; x++ ) for ( int y=-200; y<=200; y++ ) { bool f = true; for ( int i=0; i<n; i++ ) if ( abs(X[i]-x)+abs(Y[i]-y) > R[i] ) f = false; if ( f ) c++; } return c; }};