oj.uz

Submission #714702

# Submission time Handle Problem Language Result Execution time Memory
714702 2023-03-25T08:09:07 Z four_specks Sails (IOI07_sails) C++17
80 / 100
 22 ms 2824 KB 
#include <bits/stdc++.h>

using namespace std;

namespace
{
} // namespace

void solve()
{
    int n;
    cin >> n;

    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++)
        cin >> a[i] >> b[i];

    const int X = *max_element(a.begin(), a.end());

    vector<long> run(X + 1);
    for (int i = 0; i < n; i++)
    {
        run[a[i] - b[i]]++;
        run[a[i]]--;
    }
    for (int x = 0; x < X; x++)
        run[x + 1] += run[x];

    stack<pair<long, int>> st;
    for (int x = 0; x < X; x++)
    {
        long cur = run[x];
        int cnt = 1;
        while (!st.empty() && st.top().first <= run[x])
        {
            auto [x, y] = st.top();
            st.pop();

            cur += x * y;
            cnt += y;
        }

        long q = cur / cnt, d = cur % cnt;

        if (d > 0)
            st.emplace(q + 1, d);
        st.emplace(q, cnt - d);
    }

    long res = 0;

    while (!st.empty())
    {
        auto [x, y] = st.top();
        st.pop();

        res += y * x * (x - 1) / 2;
    }

    cout << res << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(NULL);

    solve();

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 1092 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 5 ms 796 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1236 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1748 KB Output is correct
2 Correct 14 ms 2824 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2528 KB Output is correct
2 Correct 12 ms 2380 KB Output is correct

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 2120 KB Output isn't correct
2 Halted 0 ms 0 KB -