oj.uz

Submission #956261

# Submission time Handle Problem Language Result Execution time Memory
956261 2024-04-01T12:29:57 Z serifefedartar Taxis (POI13_tak) C++17
100 / 100
 99 ms 8696 KB 
#include <bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define LOGN 20
const ll MOD = 998244353;
const ll MAXN = 1e5 + 100;

#define int long long
vector<ll> x;
signed main() {
    fast
    ll m, d, n;
    cin >> m >> d >> n;

    x = vector<ll>(n);
    for (int i = 0; i < n; i++)
        cin >> x[i];
    sort(x.begin(), x.end());

    auto it = lower_bound(x.begin(), x.end(), m - d);
    if (it == x.end()) {
        cout << "0\n";
        return 0;
    }
    int goal = d - (*it - m + d) / 2;
    x.erase(it);

    int cnt = 1;
    int plc = 0;
    while (x.size()) {
        int now = x.back();
        x.pop_back();

        if (now <= d - plc)
            break;

        plc += now - d + plc;
        cnt++;

        if (plc >= goal)
            break;
    }

    cout << (plc < goal ? 0 : cnt - (plc >= m)) << "\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 604 KB Output is correct
2 Correct 2 ms 604 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 860 KB Output is correct
2 Correct 11 ms 860 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1372 KB Output is correct
2 Correct 40 ms 2140 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2652 KB Output is correct
2 Correct 62 ms 8696 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 4184 KB Output is correct
2 Correct 72 ms 3428 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 4188 KB Output is correct
2 Correct 89 ms 4188 KB Output is correct