oj.uz

Submission #943669

# Submission time Handle Problem Language Result Execution time Memory
943669 2024-03-11T17:51:47 Z HiepVu217 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 42 ms 5580 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 17;
int k, n;
long long s[N], ans, ls, rs;
priority_queue <int> lpq, rpq;
vector <pair <int, int>> vt;
bool cmp (pair <int, int> x, pair <int, int> y)
{
    return x.first + x.second < y.first + y.second;
}
void add (int x)
{
    int mid;
    if (lpq.size())
    {
        mid = lpq.top();
    }
    else
    {
        mid = 1e9 + 17;
    }
    if (x <= mid)
    {
        lpq.push(x);
        ls += x;
    }
    else
    {
        rpq.push(-x);
        rs += x;
    }
    if (lpq.size() > rpq.size() + 1)
    {
        int t = lpq.top();
        lpq.pop();
        ls -= t;
        rpq.push(-t);
        rs += t;
    }
    if (rpq.size() > lpq.size())
    {
        int t = -rpq.top();
        rpq.pop();
        rs -= t;
        lpq.push(t);
        ls += t;
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> k >> n;
    long long z = 0;
    vt.push_back ({0, 0});
    for (int i = 1; i <= n; ++i)
    {
        int a, b;
        char x, y;
        cin >> x >> a >> y >> b;
        if (x == y)
        {
            z += abs (a - b);
            continue;
        }
        vt.push_back ({a, b});
    }
    sort (vt.begin(), vt.end(), cmp);
    n = vt.size() - 1;
    z += n;
    for (int i = 1; i <= n; ++i)
    {
        add (vt[i].first);
        add (vt[i].second);
        s[i] = rs - ls;
    }
    ans = s[n];
    cout << ans + z;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 480 KB Output is correct
12 Correct 20 ms 3996 KB Output is correct
13 Correct 42 ms 5456 KB Output is correct
14 Correct 33 ms 4568 KB Output is correct
15 Correct 27 ms 3536 KB Output is correct
16 Correct 29 ms 4812 KB Output is correct
17 Correct 32 ms 5324 KB Output is correct
18 Correct 33 ms 5320 KB Output is correct
19 Correct 37 ms 5324 KB Output is correct
20 Correct 27 ms 5580 KB Output is correct
21 Correct 35 ms 5072 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -