Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- ifstream fin("pavaj.in");
- ofstream fout("pavaj.out");
- int s[1001][1001];
- int main()
- {
- int n,m,i,j,k,sum=0,l1=0,l2=0,c1=0,c2=0;
- fin>>n>>m>>k;
- for(i=1;i<=n;i++)
- {
- for(j=1;j<=m;j++)
- {
- fin>>s[i][j];
- s[i][j]=s[i][j]+s[i-1][j]+s[i][j-1]-s[i-1][j-1];
- }
- }
- for(i=1;i<=k;i++)
- {
- fin>>l1>>c1>>l2>>c2;
- if(c1>c2)
- {
- swap(c1,c2);
- }
- if(l1>l2)
- {
- swap(l1,l2);
- }
- sum=s[l2][c2]-s[l1-1][c2]-s[l2][c1-1]+s[l1-1][c1-1];
- if(sum==0)
- {
- fout<<0<<'\n';
- }
- else
- {
- if(sum==(l2-l1+1)*(c2-c1+1))
- {
- fout<<1<<'\n';
- }
- else
- {
- fout<<2<<'\n';
- }
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement