oj.uz

Submission #958036

# Submission time Handle Problem Language Result Execution time Memory
958036 2024-04-04T17:53:10 Z Zena_Hossam Fuel Station (NOI20_fuelstation) C++14
0 / 100
 105 ms 15908 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
using namespace std;
namespace __gnu_pbds
{
typedef tree<ll,
        null_type,
        less_equal<ll>,
        rb_tree_tag,
        tree_order_statistics_node_update> ordered_set;
}
using namespace __gnu_pbds;
#define fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define ll double

#define ll1 long long
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
ll mod=1e9+7;
int main()
{
    fi
    //freopen("stdin.in","r",stdin);freopen("stdout.out","w",stdout);
    //cin>>T;ll oo=0;
    ll n,k;
    cin>>n>>k;
    pair<ll,pair<ll,ll>>a[n];
    for(ll i=0;i<n;i++){
        cin>>a[i].F>>a[i].S.F>>a[i].S.S;
    }
    sort(a,a+n);
    ll l=0,r=1e9;ll ans;
    while(l<=r){
        ll mid=(l+r)/2;ll o=mid;ll p=0;ll u=0;
        for(ll i=0;i<n;i++){
            if(a[i].S.F>=mid){
                o+=a[i].S.S-(a[i].F-u);u=a[i].F;
            }
        }
        if(o-(k-u)>=0){
            ans=mid;r=mid-1;
        }else l=mid+1;
    }cout<<ans;
}

Compilation message

FuelStation.cpp: In function 'int main()':
FuelStation.cpp:39:36: warning: unused variable 'p' [-Wunused-variable]
   39 |         ll mid=(l+r)/2;ll o=mid;ll p=0;ll u=0;
      |                                    ^

Subtask #1
0 / 7.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 17.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 19.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 21.0

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