提出 #76969383

ソースコード 拡げる

 #include <bits/stdc++.h>
 using namespace std;
 typedef pair<long long, long long> pii;
 typedef pair<long long, pair<long long, long long>> piii;
 typedef long long ll;
 #define F first
 #define S second
 #define pb push_back
 #define all(a) a.begin(), a.end()
 #define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
 #define int long long
 #define fr(n) for (int i = 0; i < n; i++)

const int maxn = 2e5 + 7;
int n, k,  arr[maxn], par[maxn];

int bs(int ind) {
  int l = -1, r = ind;
  while(r - l > 1) {
    int mid = (l+r)/2;
    if (par[ind] - par[mid] >= k) l = mid;
    else r = mid;
  }
  return l;
}

signed main() {
  cin >> n >> k;
  fr (n) cin >> arr[i];
  par[0] = arr[0];
  int cnt =  0;
  for (int i = 1; i < n; i++) par[i] = par[i-1] + arr[i];
  for (int i = 0; i < n; i++) {
    int j = bs(i);
  //  cout << j << endl;
    //j is true;
    cnt += (j+1);
    if (par[i] >= k) cnt++;
  }
  cout << cnt << endl;
}

提出情報

提出日時
問題 F - 連続区間の売上目標
ユーザ tahaaaa
言語 C++23 (GCC 15.2.0)
得点 366
コード長 983 Byte
結果 AC
実行時間 63 ms
メモリ 6720 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 366 / 366
結果
AC × 3
AC × 61
セット名 テストケース
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
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3356 KiB
in02.txt AC 1 ms 3456 KiB
in03.txt AC 1 ms 3456 KiB
in04.txt AC 1 ms 3520 KiB
in05.txt AC 1 ms 3300 KiB
in06.txt AC 1 ms 3356 KiB
in07.txt AC 1 ms 3520 KiB
in08.txt AC 25 ms 6556 KiB
in09.txt AC 63 ms 6656 KiB
in10.txt AC 59 ms 6452 KiB
in11.txt AC 58 ms 6564 KiB
in12.txt AC 26 ms 6500 KiB
in13.txt AC 1 ms 3244 KiB
in14.txt AC 25 ms 6572 KiB
in15.txt AC 1 ms 3228 KiB
in16.txt AC 26 ms 6620 KiB
in17.txt AC 26 ms 6556 KiB
in18.txt AC 44 ms 6444 KiB
in19.txt AC 44 ms 6452 KiB
in20.txt AC 45 ms 6556 KiB
in21.txt AC 57 ms 6620 KiB
in22.txt AC 63 ms 6444 KiB
in23.txt AC 60 ms 6496 KiB
in24.txt AC 63 ms 6720 KiB
in25.txt AC 1 ms 3292 KiB
in26.txt AC 1 ms 3464 KiB
in27.txt AC 26 ms 6516 KiB
in28.txt AC 1 ms 3464 KiB
in29.txt AC 1 ms 3484 KiB
in30.txt AC 34 ms 6572 KiB
in31.txt AC 1 ms 3464 KiB
in32.txt AC 26 ms 6608 KiB
in33.txt AC 1 ms 3300 KiB
in34.txt AC 45 ms 6496 KiB
in35.txt AC 62 ms 6620 KiB
in36.txt AC 1 ms 3420 KiB
in37.txt AC 1 ms 3456 KiB
in38.txt AC 1 ms 3464 KiB
in39.txt AC 26 ms 6716 KiB
in40.txt AC 59 ms 6496 KiB
in41.txt AC 25 ms 6556 KiB
in42.txt AC 59 ms 6516 KiB
in43.txt AC 33 ms 6620 KiB
in44.txt AC 26 ms 6656 KiB
in45.txt AC 27 ms 6452 KiB
in46.txt AC 58 ms 6572 KiB
in47.txt AC 1 ms 3420 KiB
in48.txt AC 1 ms 3516 KiB
in49.txt AC 1 ms 3252 KiB
in50.txt AC 1 ms 3244 KiB
in51.txt AC 1 ms 3420 KiB
in52.txt AC 1 ms 3316 KiB
in53.txt AC 25 ms 6712 KiB
in54.txt AC 25 ms 6620 KiB
in55.txt AC 25 ms 6452 KiB
in56.txt AC 31 ms 5184 KiB
in57.txt AC 25 ms 6572 KiB
in58.txt AC 26 ms 6572 KiB
sample01.txt AC 1 ms 3420 KiB
sample02.txt AC 1 ms 3356 KiB
sample03.txt AC 1 ms 3316 KiB