Submission

Score: 0

User: I_need2win

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

Language: cpp

Time: 0.000 second

Submitted On: 2026-02-15 15:54:34

#include <bits/ stdc++.h>
using namespace std;

int compare_cars(int P, int Q)

int x, y;

int findinside(int l, int r){
    while (l<r){
        int ml=(l+r)/2;
        if (compare_cars(ml, x)==-1) r=ml;
        else l=ml+1;
    }
    return l;
}

pair<int, int> locate_dining_cars (int N){
    int l=1, r=N;
    while (l<r){
        int ml=(l+r)/2;
        int side_query=compare_cars(l, r);
        if (side_query==0){
            x=findinside(l, ml);
            y=r-(x-l);
            return (x, y);
        }
        int mid_query = compare_cars(ml, ml+1);
        if (side_query==1 && mid_query==-1) r=ml;
        else if (side_query==-1 && mid_query==1) l=ml+1;
        else return (findinside(l, ml), findinside(ml+1, r));
    }
}