제출 #542035

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
542035		AJ00	Unija (COCI17_unija)	C++14	100 / 100	285 ms	31044 KiB

unija

#include <bits/stdc++.h>
using namespace std;
#define int long long
pair<int,int> rect[1000001]; 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t=1,n,curx,cury; 
    //cin >> t; 
    while (t--){
        cin >> n;
        for (int i = 0; i < n; i++){
            cin >> rect[i].first >> rect[i].second;
            rect[i].first /= 2;
            rect[i].second /= 2;
        }    
        rect[n] = {0,0};
        sort(rect,rect+n+1,greater<pair<int,int>>());
        curx = rect[0].first;
        cury = rect[0].second;
       // cout << rect[0].first << " " << rect[0].second << "\n";
        int  i = 1,ans=0;
        while(i<=n){
            while(cury >= rect[i].second && i<n){
               // cout << rect[i].first << " " << rect[i].second << "\n";
                i++;
            }
            ans += ((curx-rect[i].first)*cury);
            curx = rect[i].first;
            cury = rect[i].second;
           // cout << rect[i].first << " " << rect[i].second << " " << ans << "\n";
            i++;
        }
        ans *= 4;
        cout << ans << "\n";
    }
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10