提出 #73186134

ソースコード 拡げる

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

using ll=long long;
using ull=unsigned long long;

void solve(){
    ll N, M; cin>>N>>M;
    vector<ll> A(N), B(N);
    for(int i=0; i<N; ++i)cin>>A[i]>>B[i];

    ll d=0;
    for(int i=0; i<N; ++i){
        ll l=-1, r=1e9+7;
        while(r-l>1){
            ll m=(l+r)/2LL;
            if(A[i]>=M-B[i]*m)r=m;
            else l=m;
        }
        d=max(d, r);
    }
    cout<<d<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout<<fixed<<setprecision(17);
    int T=1; //cin>>T;
    while(T--)solve();
    return 0;
}

提出情報

提出日時
問題 C - 植物の成長観察
ユーザ Aseteyan
言語 C++23 (GCC 15.2.0)
得点 300
コード長 654 Byte
結果 AC
実行時間 32 ms
メモリ 6500 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 300 / 300
結果
AC × 3
AC × 75
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3540 KiB
in02.txt AC 1 ms 3560 KiB
in03.txt AC 1 ms 3536 KiB
in04.txt AC 1 ms 3572 KiB
in05.txt AC 1 ms 3700 KiB
in06.txt AC 24 ms 6324 KiB
in07.txt AC 30 ms 6376 KiB
in08.txt AC 1 ms 3616 KiB
in09.txt AC 1 ms 3552 KiB
in10.txt AC 2 ms 3692 KiB
in11.txt AC 32 ms 6408 KiB
in12.txt AC 28 ms 6448 KiB
in13.txt AC 29 ms 6432 KiB
in14.txt AC 28 ms 6372 KiB
in15.txt AC 28 ms 6324 KiB
in16.txt AC 30 ms 6472 KiB
in17.txt AC 24 ms 6472 KiB
in18.txt AC 29 ms 6404 KiB
in19.txt AC 29 ms 6324 KiB
in20.txt AC 25 ms 6492 KiB
in21.txt AC 26 ms 6452 KiB
in22.txt AC 27 ms 6472 KiB
in23.txt AC 27 ms 6420 KiB
in24.txt AC 27 ms 6376 KiB
in25.txt AC 26 ms 6452 KiB
in26.txt AC 1 ms 3476 KiB
in27.txt AC 1 ms 3560 KiB
in28.txt AC 1 ms 3424 KiB
in29.txt AC 1 ms 3568 KiB
in30.txt AC 1 ms 3476 KiB
in31.txt AC 1 ms 3572 KiB
in32.txt AC 1 ms 3424 KiB
in33.txt AC 1 ms 3604 KiB
in34.txt AC 1 ms 3536 KiB
in35.txt AC 1 ms 3492 KiB
in36.txt AC 1 ms 3532 KiB
in37.txt AC 1 ms 3568 KiB
in38.txt AC 1 ms 3560 KiB
in39.txt AC 1 ms 3540 KiB
in40.txt AC 1 ms 3392 KiB
in41.txt AC 1 ms 3604 KiB
in42.txt AC 1 ms 3476 KiB
in43.txt AC 1 ms 3424 KiB
in44.txt AC 1 ms 3568 KiB
in45.txt AC 1 ms 3604 KiB
in46.txt AC 29 ms 6412 KiB
in47.txt AC 25 ms 6472 KiB
in48.txt AC 30 ms 6376 KiB
in49.txt AC 30 ms 6472 KiB
in50.txt AC 26 ms 6432 KiB
in51.txt AC 27 ms 6500 KiB
in52.txt AC 27 ms 6344 KiB
in53.txt AC 30 ms 6448 KiB
in54.txt AC 28 ms 6452 KiB
in55.txt AC 27 ms 6444 KiB
in56.txt AC 1 ms 3448 KiB
in57.txt AC 1 ms 3604 KiB
in58.txt AC 1 ms 3492 KiB
in59.txt AC 1 ms 3608 KiB
in60.txt AC 1 ms 3540 KiB
in61.txt AC 1 ms 3536 KiB
in62.txt AC 1 ms 3500 KiB
in63.txt AC 1 ms 3564 KiB
in64.txt AC 1 ms 3476 KiB
in65.txt AC 1 ms 3536 KiB
in66.txt AC 1 ms 3568 KiB
in67.txt AC 1 ms 3540 KiB
in68.txt AC 1 ms 3564 KiB
in69.txt AC 1 ms 3492 KiB
in70.txt AC 1 ms 3604 KiB
in71.txt AC 28 ms 6432 KiB
in72.txt AC 31 ms 6432 KiB
sample01.txt AC 1 ms 3572 KiB
sample02.txt AC 1 ms 3572 KiB
sample03.txt AC 1 ms 3572 KiB