UVa 10324 - Zeros and Ones (simplify using 1D array: change counter)

Link: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=15&page=show_problem&problem=1265
Sol:

#include<bits/stdc++.h>
	using namespace std;
	/// M A C R O Starts Here
	#define pf printf
	#define sf scanf
	#define MAX 500000
	#define MOD 100000007
	#define INF INT_MAX
	#define pi acos(-1.0)
	#define get_stl(s) getline(cin,s)
	#define sif(a) scanf("%d",&a)
	#define pif(a) printf("%d\n",a)
	#define puf(a) printf("%llu\n",a)
	#define pii pair<int, int>
	#define pdd pair<double, double>
	#define mem(name, value) memset(name, value, sizeof(name))
	#define all(name) name.begin(),name.end()
	typedef long long ll;
	typedef unsigned long long ull;
	int dx[]={0,0,1,-1,-1,1,-1,1};
	int dy[]={-1,1,0,0,1,1,-1,-1};
	int dz[]={0,0,1,-1,-1,1,-1,1};
	int isLeft(double a, double b, double c, double d, double e, double f)
	{
	double r = 0.5*((a*(d-f))+(b*(e-c))+((c*f)-(d*e)));
	if(r==0.00) return 0;
	if(r<0) return -1;
	return 1;
	}
	double _distance(double x1,double y1,double x2,double y2)
	{
	double x1x2 = x1 - x2;
	double y1y2 = y1 - y2;
	return sqrt((x1x2*x1x2)+(y1y2*y1y2));
	}
	char s[1000001];
	int cum[1000001];
	int main()
	{
	//freopen("in.txt","r", stdin);
	//freopen("out.txt","w", stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int kase = 0;
	while(scanf("%s",s)==1)
	{
	cum[0]=0;
	int len = strlen(s);
	for(int i=0;i<len;i++)
	cum[i+1]=(s[i]-48);
	for (int i=2;i<=len;i++)
	cum[i]+=cum[i-1];
	int q;
	printf("Case %d:\n",++kase);
	scanf("%d",&q);
	while(q--)
	{
	int a,b;
	scanf("%d%d",&a,&b);
	int sum = cum[max(a,b)+1] - cum[min(a,b)];
	if(s[min(a,b)]=='0'&&sum==0)
	printf("Yes\n");
	else if(s[min(a,b)]=='1'&&sum ==(max(a,b)-min(a,b)+1))
	printf("Yes\n");
	else
	printf("No\n");
	}
	}
	return 0;
	}