oj.uz

Submission #768756

# Submission time Handle Problem Language Result Execution time Memory
768756 2023-06-28T14:41:28 Z raysh07 Taxis (POI13_tak) C++17
0 / 100
 93 ms 4180 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int m, d, n; cin >> m >> d >> n;
    
    vector <int> a(n);
    for (auto &x : a) cin >> x;
    sort(a.begin(), a.end(), greater<int>());
    int curr = 0;
    int ans = 0;
    
    for (auto x : a){
        x -= abs(d - curr);
        if (x < 0) {
            continue;
        }
        
        curr += x;
        ans++;
        if (curr >= m) break;
    }
    
    if (curr < m) {
        cout << 0 << "\n";
        return;
    }
    
    pair<int, int> mn = {INF, -1};
    for (int i = 0; i < n; i++){
        if (a[i] >= m - d){
            mn = min(mn, {a[i], i});
        }
    }
    
    int got = mn.second;
    int cnt = 0;
    curr = 0;
    for (int i = 0; i < n; i++){
        if (i == got) continue;
        
        a[i] -= abs(d - curr);
        if (a[i] < 0) continue;
        curr += a[i];
        cnt++;
        if (curr >= d) break;
    }
    
    cout << min(ans, cnt + 1) << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
   // cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
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
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1236 KB Output is correct
2 Incorrect 36 ms 2004 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2644 KB Output is correct
2 Incorrect 60 ms 2900 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 4180 KB Output is correct
2 Incorrect 72 ms 3460 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

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