提出 #74619071

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const ll mod = 998244353;

// #include <atcoder/all>
// using mint = atcoder::modint998244353;
// using namespace atcoder;

void yn(bool b) {
    if (b) cout << "Yes" << endl;
    else cout << "No" << endl;
}

int main() {
    int n, k;
    cin >> n >> k;

    vector<ll> x(n);
    for (int i=0; i<n; i++) cin >> x[i];
    sort(x.begin(), x.end());
    
    int ans = 0;
    for (int i=0; i<n; i++) {
      int l = x[i], r = x[i]+k;
      int j = lower_bound(x.begin(), x.end(), l) - x.begin();
      int k = lower_bound(x.begin(), x.end(), r+1) - x.begin();
      ans = max(ans, k-j);
    }
    cout << ans << endl;

    return 0;
}

提出情報

提出日時
問題 C - りんご収穫
ユーザ aonyx64
言語 C++23 (GCC 15.2.0)
得点 366
コード長 785 Byte
結果 AC
実行時間 86 ms
メモリ 4988 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 366 / 366
結果
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 3608 KiB
in02.txt AC 1 ms 3608 KiB
in03.txt AC 1 ms 3668 KiB
in04.txt AC 1 ms 3664 KiB
in05.txt AC 1 ms 3608 KiB
in06.txt AC 1 ms 3660 KiB
in07.txt AC 1 ms 3624 KiB
in08.txt AC 85 ms 4852 KiB
in09.txt AC 78 ms 4844 KiB
in10.txt AC 81 ms 4792 KiB
in11.txt AC 85 ms 4812 KiB
in12.txt AC 82 ms 4792 KiB
in13.txt AC 81 ms 4940 KiB
in14.txt AC 83 ms 4816 KiB
in15.txt AC 65 ms 4876 KiB
in16.txt AC 1 ms 3460 KiB
in17.txt AC 67 ms 4860 KiB
in18.txt AC 79 ms 4852 KiB
in19.txt AC 72 ms 4860 KiB
in20.txt AC 70 ms 4832 KiB
in21.txt AC 67 ms 4832 KiB
in22.txt AC 75 ms 4812 KiB
in23.txt AC 71 ms 4904 KiB
in24.txt AC 73 ms 4852 KiB
in25.txt AC 85 ms 4844 KiB
in26.txt AC 66 ms 4904 KiB
in27.txt AC 1 ms 3460 KiB
in28.txt AC 1 ms 3644 KiB
in29.txt AC 1 ms 3584 KiB
in30.txt AC 1 ms 3724 KiB
in31.txt AC 86 ms 4860 KiB
in32.txt AC 68 ms 4784 KiB
in33.txt AC 1 ms 3676 KiB
in34.txt AC 1 ms 3616 KiB
in35.txt AC 1 ms 3648 KiB
in36.txt AC 1 ms 3460 KiB
in37.txt AC 1 ms 3408 KiB
in38.txt AC 1 ms 3460 KiB
in39.txt AC 1 ms 3664 KiB
in40.txt AC 1 ms 3588 KiB
in41.txt AC 79 ms 4876 KiB
in42.txt AC 1 ms 3596 KiB
in43.txt AC 2 ms 3664 KiB
in44.txt AC 85 ms 4812 KiB
in45.txt AC 86 ms 4872 KiB
in46.txt AC 84 ms 4872 KiB
in47.txt AC 78 ms 4852 KiB
in48.txt AC 2 ms 3460 KiB
in49.txt AC 75 ms 4988 KiB
in50.txt AC 75 ms 4852 KiB
in51.txt AC 84 ms 4852 KiB
in52.txt AC 75 ms 4960 KiB
in53.txt AC 84 ms 4880 KiB
in54.txt AC 1 ms 3596 KiB
in55.txt AC 1 ms 3668 KiB
in56.txt AC 1 ms 3604 KiB
in57.txt AC 1 ms 3608 KiB
in58.txt AC 1 ms 3608 KiB
in59.txt AC 1 ms 3664 KiB
in60.txt AC 1 ms 3620 KiB
in61.txt AC 1 ms 3604 KiB
in62.txt AC 1 ms 3604 KiB
in63.txt AC 1 ms 3460 KiB
in64.txt AC 1 ms 3668 KiB
in65.txt AC 66 ms 4880 KiB
in66.txt AC 1 ms 3620 KiB
in67.txt AC 1 ms 3460 KiB
in68.txt AC 1 ms 3616 KiB
in69.txt AC 1 ms 3616 KiB
in70.txt AC 1 ms 3616 KiB
in71.txt AC 1 ms 3664 KiB
in72.txt AC 73 ms 4976 KiB
sample01.txt AC 1 ms 3608 KiB
sample02.txt AC 1 ms 3608 KiB
sample03.txt AC 1 ms 3588 KiB