Submission

Status:

(PPPPP-SSSSSSSSS)(P-SSSSSS)(PPPPPPPPPP)(-SSSSSSSSS)(-SSSSSSSSS)(PP-SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS)

Subtask/Task Score:

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

Score: 12

User: Tai

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-11-21 16:56:48

#pragma GCC optimize("O5, unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
#include "dining_car.h"
using namespace std;

pair<int, int> locate_dining_cars(int n){
	int l=1, r=n,i=1;
	while(l<r){
		int m = (l+r-1)/2;
		int call = compare_cars(m, m+1);
		if(call<=0) r=m;
		else l=m+1;
		} int g=l; ++l; r=n;
	while(l<r){
		int m = (l+r+1)/2;
		int call = compare_cars(m-1, m);
		if(call>=0) l=m;
		else r=m-1;
		}
		return {g, l};
}