Submission

Score: 17

User: 12345678

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

Language: cpp

Time: 0.001 second

Submitted On: 2026-02-13 10:22:54

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

using namespace std;

pair<int, int> locate_dining_cars(int N) 
{
    int l=2, r=N;
    while (l<r)
    {
        int md=(l+r+1)/2; // find last position that compare(md-1, md)!=-1
        int res=compare_cars(md-1, md); // -1 when left nearer than right
        if (res==-1) r=md-1;
        else if (res==0)
        {
            return {1, (md-1-1)+md};
        }
        else l=md;
    }
    return {1, l};
}