Submission #1014725

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014725		whitewind664	Unija (COCI17_unija)	C++17	0 / 100	241 ms	15964 KiB

unija

#include <bits/stdc++.h>

using namespace std;

#define ll long long

bool sorting(pair<ll, ll> a, pair<ll, ll> b) {
    if (a.first == b.first) {
        return a.second > b.second;
    }
    return a.first < b.first;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll n;
    cin >> n;
    vector<pair<ll, ll>> v(n + 1);
    for (int i = 0; i < n; i++) {
        cin >> v[i].first >> v[i].second;
    }
    v[n] = { 0, 100000000 };
    sort(v.begin(), v.end(), sorting);
    ll rez = 0;

    // ll prevHeight = v[0].second;
    for (int i = 1; i <= n; i++) {
        if (i != n && v[i].second == v[i + 1].second) {
            continue;
        }
        rez += (v[i].first - v[i - 1].first) * v[i].second;
    }
    cout << rez << endl;



    // int n;
    // cin >> n;
    // vector<pair<int,int>> pravoagolnik(n);
    // for (int i=0;i<n;i++) {
    //     cin >> pravoagolnik[i].first >> pravoagolnik[i].second;
    //     pravoagolnik[i].first/=2;
    //     pravoagolnik[i].second/=2;
    // }
    // sort(pravoagolnik.begin(), pravoagolnik.end());
    // int rez = pravoagolnik[0].first * pravoagolnik[0].second;
    // for (int i=1;i<n;i++) {
    //     rez += (pravoagolnik[i].first-pravoagolnik[i-1].first) * pravoagolnik[i].second;
    // }
    // cout << 4 * rez << endl;
}

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