This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
بسم الله الرحمن الرحيم
Author:
(:Muhammad Aneeq:)
*/
#include <iostream>
#include <vector>
using namespace std;
void solve()
{
int k,n;
cin>>k>>n;
int ans=0;
vector<pair<int,int>>d;
int z=0;
for (int i=0;i<n;i++)
{
char a,b;
int x,y;
cin>>a>>x>>b>>y;
if (a==b)
ans+=abs(x-y);
else
{
z+=abs(x-y);
d.push_back({x,y});
}
}
z/=max(1,int(d.size()));
for (auto i:d)
ans+=(abs(i.first-z)+abs(i.second-z))+1;
cout<<ans<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |