This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef pair<int,int> p;
p in[110000];
vector<int> apchuk;
vector<int> dis[110000];
int main()
{
int n;
cin>>n;
long long tot=0;
for(int i=0;i<n;i++)cin>>in[i].f>>in[i].s,apchuk.push_back(in[i].s);
sort(apchuk.begin(),apchuk.end());
apchuk.erase(unique(apchuk.begin(),apchuk.end()),apchuk.end());
for(int i=0;i<n;i++)
{
in[i].s=lower_bound(apchuk.begin(),apchuk.end(),in[i].s)-apchuk.begin();
dis[in[i].s].push_back(in[i].f);
}
for(int i=0;i<apchuk.size();i++)
{
int m=dis[i].size()-1;
sort(dis[i].begin(),dis[i].end());
for(int j=1;j<m;j++)tot+=min(dis[i][j]-dis[i][j-1],dis[i][j+1]-dis[i][j]);
tot+=m>0?dis[i][m]-dis[i][m-1]+dis[i][1]-dis[i][0]:0;
}
cout<<tot;
return 0;
}
Compilation message (stderr)
arrow.cpp: In function 'int main()':
arrow.cpp:23:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<apchuk.size();i++)
~^~~~~~~~~~~~~~
# | 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... |