제출 #849495

#제출 시각아이디문제언어결과실행 시간메모리
849495ereringUnija (COCI17_unija)C++17
60 / 100
22 ms5208 KiB
#include<bits/stdc++.h> #define endl '\n' #define pb push_back using ll = long long; const int mod = 1e5+5; using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(); ll n; pair<ll, ll> arr[mod]; cin >> 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...