Submission
Status:
(PP-SSSSSSSSSSSS)(P-SSSSSS)(PPPPPPPPPP)(-SSSSSSSSS)(-SSSSSSSSS)(-SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS)
Subtask/Task Score:
{0/3}{0/7}{12/12}{0/17}{0/21}{0/40}
Score: 12
User: koon
Problemset: รถไฟตู้เสบียง (Dining Car)
Language: cpp
Time: 0.002 second
Submitted On: 2026-04-24 13:27:14
#include <bits/stdc++.h>
#include "dining_car.h"
using namespace std;
int find_min(int l, int r) {
while (l < r) {
int mid = (l + r) / 2;
if (compare_cars(mid, mid+1) == -1)
r = mid;
else
l = mid + 1;
}
return l;
}
pair<int,int> locate_dining_cars(int N) {
int A = find_min(1, N);
return {A-1, A};
}