提出 #74603738

ソースコード 拡げる

#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;

const int N = 2e5 + 10, M = 4e5 + 10;

int n, k;
int a[N], b[N], v[N];
int prea[N], preb[N];

vector<int> st[N];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> k;
    for(int i=1;i<=n;i++){
        cin >> a[i];
    }
    for(int i=1;i<=n;i++){
        cin >> b[i];
    }
    int ans = 0;
    queue<int> q;
    int sa=0, sb=0;
    for(int i=1;i<=n;i++){
        q.push(i);
        sa += a[i], sb+=b[i];
        while(sb > k){
            int t = q.front();
            sa -= a[t], sb -= b[t];
            q.pop();
        }
        ans = max(ans, sa);
    }
    cout << ans;
    return 0;
}

提出情報

提出日時
問題 C - 本棚の整理
ユーザ Queryme
言語 C++23 (GCC 15.2.0)
得点 366
コード長 807 Byte
結果 AC
実行時間 19 ms
メモリ 8244 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 366 / 366
結果
AC × 3
AC × 77
セット名 テストケース
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, in73.txt, in74.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 2 ms 3680 KiB
in02.txt AC 2 ms 3552 KiB
in03.txt AC 2 ms 3688 KiB
in04.txt AC 15 ms 6752 KiB
in05.txt AC 18 ms 8168 KiB
in06.txt AC 2 ms 3656 KiB
in07.txt AC 2 ms 3652 KiB
in08.txt AC 2 ms 3440 KiB
in09.txt AC 18 ms 8172 KiB
in10.txt AC 18 ms 6792 KiB
in11.txt AC 17 ms 8244 KiB
in12.txt AC 18 ms 7536 KiB
in13.txt AC 17 ms 6760 KiB
in14.txt AC 14 ms 6760 KiB
in15.txt AC 15 ms 6796 KiB
in16.txt AC 15 ms 6852 KiB
in17.txt AC 15 ms 8180 KiB
in18.txt AC 2 ms 3576 KiB
in19.txt AC 17 ms 7592 KiB
in20.txt AC 17 ms 6640 KiB
in21.txt AC 14 ms 8180 KiB
in22.txt AC 14 ms 7708 KiB
in23.txt AC 13 ms 8224 KiB
in24.txt AC 13 ms 8172 KiB
in25.txt AC 15 ms 6836 KiB
in26.txt AC 14 ms 7752 KiB
in27.txt AC 15 ms 7732 KiB
in28.txt AC 17 ms 6752 KiB
in29.txt AC 15 ms 8208 KiB
in30.txt AC 17 ms 6752 KiB
in31.txt AC 14 ms 8032 KiB
in32.txt AC 8 ms 5620 KiB
in33.txt AC 16 ms 8096 KiB
in34.txt AC 2 ms 3732 KiB
in35.txt AC 2 ms 3496 KiB
in36.txt AC 2 ms 3552 KiB
in37.txt AC 2 ms 3780 KiB
in38.txt AC 13 ms 7156 KiB
in39.txt AC 2 ms 3568 KiB
in40.txt AC 2 ms 3776 KiB
in41.txt AC 2 ms 3596 KiB
in42.txt AC 2 ms 3624 KiB
in43.txt AC 14 ms 6988 KiB
in44.txt AC 1 ms 3596 KiB
in45.txt AC 17 ms 6748 KiB
in46.txt AC 2 ms 3496 KiB
in47.txt AC 2 ms 3764 KiB
in48.txt AC 14 ms 8152 KiB
in49.txt AC 16 ms 8176 KiB
in50.txt AC 17 ms 8148 KiB
in51.txt AC 15 ms 7748 KiB
in52.txt AC 15 ms 7464 KiB
in53.txt AC 15 ms 7748 KiB
in54.txt AC 18 ms 6696 KiB
in55.txt AC 18 ms 6836 KiB
in56.txt AC 19 ms 6812 KiB
in57.txt AC 18 ms 8168 KiB
in58.txt AC 17 ms 6856 KiB
in59.txt AC 2 ms 3684 KiB
in60.txt AC 2 ms 3636 KiB
in61.txt AC 11 ms 7696 KiB
in62.txt AC 11 ms 7732 KiB
in63.txt AC 2 ms 3592 KiB
in64.txt AC 2 ms 3652 KiB
in65.txt AC 2 ms 3624 KiB
in66.txt AC 2 ms 3780 KiB
in67.txt AC 2 ms 3496 KiB
in68.txt AC 2 ms 3496 KiB
in69.txt AC 1 ms 3656 KiB
in70.txt AC 1 ms 3440 KiB
in71.txt AC 1 ms 3780 KiB
in72.txt AC 2 ms 3720 KiB
in73.txt AC 14 ms 6808 KiB
in74.txt AC 15 ms 6808 KiB
sample01.txt AC 2 ms 3780 KiB
sample02.txt AC 1 ms 3656 KiB
sample03.txt AC 1 ms 3576 KiB