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;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector <pair<int,int>> v;
for(int i = 0; i < n; i++){
int x,y;
cin >> x >> y;
x /= 2;
y /= 2;
v.push_back(make_pair(x,y));
}
sort(v.rbegin(), v.rend());
int mx = 0, my = 0;
int lasty = 0;
long long sol = 0;
for(int i = 0; i < n; i++){
if(v[i].first <= mx && v[i].second <= my) continue;
//cout << "x -> " << v[i].first << " y -> " << v[i].second << " lasty -> " << lasty << "\n";
sol += v[i].first * (v[i].second - lasty);
mx = max(mx, v[i].first);
my = max(my, v[i].second);
lasty = v[i].second;
}
cout << sol * 4;
}
# | 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... |