Submission

Status:

(-SSSSSSSSSSSSSS)(P-SSSSSS)(PPPPPPPP-S)(-SSSSSSSSS)(-SSSSSSSSS)(-SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS)

Subtask/Task Score:

{0/3}{0/7}{0/12}{0/17}{0/21}{0/40}

Score: 0

User: usman

Problemset: รถไฟตู้เสบียง (Dining Car)

Language: cpp

Time: 0.001 second

Submitted On: 2025-05-25 03:57:33

#include <bits/stdc++.h>
#include "dining_car.h"

using namespace std;
pair < int, int > locate_dining_cars(int N)
{
    int l=1,r=N-1,cnt=0;
    while(l<r){
        int m=(l+r+1)>>1;
        int rs=compare_cars(m,m+1);
        cnt++;
        if(rs>-1)l=m;
        else r=m-1;
    }int tl=l+1;
    l=1,r=N-1;
    while(l<r){
        int m=(l+r)>>1;
        int rs=compare_cars(m,m+1);
        if(rs==-1)r=m;
        else l=m+1;
    }int tr=l-1;
    if(tr<tl)swap(tl,tr);
    return make_pair(tl,tr);
}