oj.uz

Submission #943684

# Submission time Handle Problem Language Result Execution time Memory
943684 2024-03-11T18:00:26 Z vjudge1 Palembang Bridges (APIO15_bridge) C++17
100 / 100
 86 ms 3604 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];
    if (k == 2)
    {
		while (lpq.size())
        {
            lpq.pop();
        }
		while (rpq.size())
        {
            rpq.pop();
        }
		ls = rs = 0;
		for (int i = n; i > 0; i--)
        {
			add (vt[i].first);
			add (vt[i].second);
			ans = min (ans, rs - ls + s[i - 1]);
		}
	}
    cout << ans + z;
}

Subtask #1
8.0 / 8.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 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 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 344 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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 348 KB Output is correct
12 Correct 21 ms 3192 KB Output is correct
13 Correct 41 ms 3336 KB Output is correct
14 Correct 36 ms 3528 KB Output is correct
15 Correct 24 ms 2180 KB Output is correct
16 Correct 24 ms 3184 KB Output is correct
17 Correct 32 ms 3028 KB Output is correct
18 Correct 30 ms 3604 KB Output is correct
19 Correct 36 ms 3288 KB Output is correct
20 Correct 29 ms 3588 KB Output is correct
21 Correct 35 ms 3028 KB Output is correct

Subtask #3
9.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 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #4
32.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 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 352 KB Output is correct
22 Correct 1 ms 352 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 1 ms 416 KB Output is correct
25 Correct 46 ms 3280 KB Output is correct
26 Correct 53 ms 3564 KB Output is correct
27 Correct 69 ms 3276 KB Output is correct
28 Correct 86 ms 3332 KB Output is correct
29 Correct 71 ms 3168 KB Output is correct
30 Correct 36 ms 1756 KB Output is correct
31 Correct 29 ms 3024 KB Output is correct
32 Correct 52 ms 3288 KB Output is correct
33 Correct 54 ms 3020 KB Output is correct
34 Correct 57 ms 3016 KB Output is correct
35 Correct 36 ms 3544 KB Output is correct
36 Correct 83 ms 3180 KB Output is correct
37 Correct 23 ms 3288 KB Output is correct