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>
using namespace std;
long long a[100009];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long x,y;
int n;cin>>n;
for(int i=0;i<n;i++)
{
cin>>x>>y;
x/=2;
y/=2;
a[y]=max(a[y],x);
}
long long sum=0;
for(int i=1;i<10000;i++)
{
if (a[i]>a[i-1])
{
sum+=(a[i]-a[i-1])*(i-1)+a[i];
}
else sum+=a[i];
}
cout<<sum*4;
return 0;
}
# | 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... |
# | 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... |