提出 #73185865


ソースコード 拡げる

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

const int N = 2e5 + 5;
int n,m,a[N],b[N];

signed main()
{
	cin >> n >> m;
	for(int i = 1;i <= n;i++) cin >> a[i] >> b[i];
	int ans = 0;
	for(int i = 1;i <= n;i++) ans = max(ans,(int)(ceil((m * 1.0 - a[i]) / b[i])));
	cout << ans;
}

提出情報

提出日時
問題 C - 植物の成長観察
ユーザ world_kiana
言語 C++23 (GCC 15.2.0)
得点 300
コード長 315 Byte
結果 AC
実行時間 95 ms
メモリ 6800 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 3536 KiB
in02.txt AC 1 ms 3516 KiB
in03.txt AC 1 ms 3512 KiB
in04.txt AC 1 ms 3616 KiB
in05.txt AC 1 ms 3440 KiB
in06.txt AC 43 ms 6660 KiB
in07.txt AC 91 ms 6576 KiB
in08.txt AC 1 ms 3420 KiB
in09.txt AC 1 ms 3544 KiB
in10.txt AC 3 ms 3660 KiB
in11.txt AC 91 ms 6632 KiB
in12.txt AC 66 ms 6724 KiB
in13.txt AC 91 ms 6716 KiB
in14.txt AC 70 ms 6648 KiB
in15.txt AC 80 ms 6632 KiB
in16.txt AC 91 ms 6660 KiB
in17.txt AC 33 ms 6632 KiB
in18.txt AC 91 ms 6640 KiB
in19.txt AC 95 ms 6576 KiB
in20.txt AC 46 ms 6712 KiB
in21.txt AC 62 ms 6576 KiB
in22.txt AC 62 ms 6748 KiB
in23.txt AC 62 ms 6716 KiB
in24.txt AC 65 ms 6712 KiB
in25.txt AC 62 ms 6576 KiB
in26.txt AC 1 ms 3524 KiB
in27.txt AC 1 ms 3540 KiB
in28.txt AC 1 ms 3544 KiB
in29.txt AC 1 ms 3544 KiB
in30.txt AC 1 ms 3616 KiB
in31.txt AC 1 ms 3540 KiB
in32.txt AC 1 ms 3376 KiB
in33.txt AC 1 ms 3532 KiB
in34.txt AC 1 ms 3540 KiB
in35.txt AC 1 ms 3360 KiB
in36.txt AC 1 ms 3512 KiB
in37.txt AC 1 ms 3516 KiB
in38.txt AC 1 ms 3376 KiB
in39.txt AC 1 ms 3360 KiB
in40.txt AC 1 ms 3572 KiB
in41.txt AC 1 ms 3488 KiB
in42.txt AC 1 ms 3420 KiB
in43.txt AC 1 ms 3512 KiB
in44.txt AC 1 ms 3572 KiB
in45.txt AC 1 ms 3572 KiB
in46.txt AC 93 ms 6632 KiB
in47.txt AC 36 ms 6660 KiB
in48.txt AC 79 ms 6800 KiB
in49.txt AC 91 ms 6680 KiB
in50.txt AC 58 ms 6632 KiB
in51.txt AC 65 ms 6660 KiB
in52.txt AC 70 ms 6632 KiB
in53.txt AC 90 ms 6724 KiB
in54.txt AC 68 ms 6784 KiB
in55.txt AC 67 ms 6716 KiB
in56.txt AC 1 ms 3548 KiB
in57.txt AC 1 ms 3440 KiB
in58.txt AC 1 ms 3544 KiB
in59.txt AC 1 ms 3516 KiB
in60.txt AC 1 ms 3524 KiB
in61.txt AC 1 ms 3532 KiB
in62.txt AC 1 ms 3616 KiB
in63.txt AC 1 ms 3548 KiB
in64.txt AC 1 ms 3548 KiB
in65.txt AC 1 ms 3376 KiB
in66.txt AC 1 ms 3544 KiB
in67.txt AC 1 ms 3356 KiB
in68.txt AC 1 ms 3532 KiB
in69.txt AC 1 ms 3516 KiB
in70.txt AC 1 ms 3532 KiB
in71.txt AC 70 ms 6560 KiB
in72.txt AC 91 ms 6744 KiB
sample01.txt AC 1 ms 3440 KiB
sample02.txt AC 1 ms 3616 KiB
sample03.txt AC 1 ms 3616 KiB