Submission #162281

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
162281	2019-11-07 12:14:30	rama_pang	Palembang Bridges (APIO15_bridge)	C++14	100 / 100	588 ms	18508 KiB

bridge

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
lint solve(lint K, vector<pair<lint, lint>> A) {
    if (A.empty()) 
        return 0;
    lint N = A.size();
    vector<lint> points;
    sort(A.begin(), A.end(), [&](pair<lint, lint> l, pair<lint, lint> r) {
        return l.first + l.second < r.first + r.second;
    });
    auto running_median = [&](vector<pair<lint, lint>> A) {
        multiset<lint> sml;
        multiset<lint> big;
        lint sum_sml = 0, sum_big = 0;
        vector<lint> res(N + 1, 0);
        for (int i = 1; i <= N; i++) {
            sml.emplace(A[i - 1].first);
            sum_sml += A[i - 1].first;
            big.emplace(A[i - 1].second);
            sum_big += A[i - 1].second;
            while (*sml.rbegin() > *big.begin()) {
                sum_sml += *big.begin() - *sml.rbegin();
                sum_big += *sml.rbegin() - *big.begin();
                big.emplace(*sml.rbegin());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 9 / 9
• Subtask 4: 32 / 32
• Subtask 5: 37 / 37