Submission #849496

#TimeUsernameProblemLanguageResultExecution timeMemory
849496ereringUnija (COCI17_unija)C++17
100 / 100
238 ms31064 KiB
#include<bits/stdc++.h>
#define endl '\n'
#define pb push_back
using  ll = long long;
using namespace std;
int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie();

    ll n;
    cin >> n;
    pair<ll, ll> arr[n];
    for (int i = 0; i < n; i++) {
        cin >> arr[i].first >> arr[i].second;
        arr[i].first /= 2;
        arr[i].second /= 2;
    }
    sort(arr, arr + n);
    ll maxy = arr[n-1].second, sum = 0;
    for (int i = n-2; i >=0; i--) {
        if (arr[i].first != arr[i + 1].first) {
            sum += maxy*(arr[i+1].first-arr[i].first);
        }
        maxy = max(maxy, arr[i].second);
    }
    sum+=arr[0].first*maxy;
    cout << sum * 4;


    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...