oj.uz

Submission #951864

# Submission time Handle Problem Language Result Execution time Memory
951864 2024-03-22T20:57:15 Z Mohamed_Kachef06 Fuel Station (NOI20_fuelstation) C++17
0 / 100
 3000 ms 19004 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long 

void doWork(){
    int n , d;
    cin >> n >> d;
    vector<array<int , 3>> v;
    vector<int> B(1 , 1e18); 
    for (int i = 1 ; i <= n ; i++){
        int x , a , b;
        cin >> x >> a >> b;
        v.push_back({x , b , a});
        B.push_back(b); 
    }
    sort(v.begin() , v.end()); 
    sort(B.begin() , B.end()); 
    int x[n+2] = {} , a[n+2] = {} , b[n+2] = {};
    for (int i = 1 ; i <= n ; i++){
        x[i] = v[i-1][0];
        a[i] = v[i-1][2];
        b[i] = v[i-1][1]; 
    }
    x[n+1] = d; 
    int ans = 1e18;
    for (int i = 0 ; i <= n ; i++){
       // cout << B[i] << '\n' << '\n';
        int mn = 0 , sum = 0;
        for (int j = 1 ; j <= n+1 ; j++){
         //  cout << mn << ' ' << sum << '\n';
           mn = min(mn , -x[j] + sum);
           if (b[j] <= B[i]) sum += a[j];
        }
        //cout << '\n';
        if (-mn <= B[i]) ans = min(ans , -mn); 
    }
   cout << ans; 
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    doWork(); 
}

Subtask #1
0 / 7.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3053 ms 19004 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 19.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 21.0

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