FlandreScarle7/Codeforces-SolutionsA
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

updated logic of 1904A

Browse Source
This commit is contained in:
ShazidMahsrafi 2023-12-10 02:19:35 +06:00
parent 8eefda517b
commit b651b71134
1 changed files with 11 additions and 31 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
1904A Forked!/1904A.cpp
View File

@ -80,39 +80,19 @@ void solve()
int a,b,k1,k2,q1,q2;
cin>>a>>b>>k1>>k2>>q1>>q2;
set<pair<int,int> > k,q;
k.ins({k1+a,k2+b});
k.ins({k1+a,k2-b});
k.ins({k1+b,k2+a});
k.ins({k1-b,k2+a});
k.ins({k1-a,k2+b});
k.ins({k1-a,k2-b});
k.ins({k1+b,k2-a});
k.ins({k1-b,k2-a});
q.ins({q1+a,q2+b});
q.ins({q1+a,q2-b});
q.ins({q1+b,q2+a});
q.ins({q1-b,q2+a});
q.ins({q1-a,q2+b});
q.ins({q1-a,q2-b});
q.ins({q1+b,q2-a});
q.ins({q1-b,q2-a});
int x[4]={-1,1,-1,1}, y[4]={-1,-1,1,1};
for(int i=0; i<4; ++i)
{
k.insert({k1+a*x[i],k2+b*y[i]});
k.insert({k1+b*x[i],k2+a*y[i]});
q.insert({q1+a*x[i],q2+b*y[i]});
q.insert({q1+b*x[i],q2+a*y[i]});
}
int ct=0;
for(auto x:k)
{
for(auto y:q)
{
if(x==y)
ct++;
}
}
for(auto it:k)
if(q.find(it)!=q.end())
ct++;
cout<<ct<<endl;
}