제출 #221874

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
221874		davooddkareshki	Collecting Stamps 3 (JOI20_ho_t3)	C++17	0 / 100	4 ms	384 KiB

ho_t3

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define F first
#define S second
#define int long long

const int maxn = 5e5+10;
const ll inf = 1e18+10;

int n, L;
int x[maxn], t[maxn];

signed main()
{
    cin>> n >> L;
    for(int i = 1; i <= n; i++) cin>> x[i];
    for(int i = 1; i <= n; i++) cin>> t[i];

    ll ans = 0;
    for(int l = 0; l <= n; l++)
        for(int R = l+1; R <= n+1; R++)
        {
            int r = R;

            int A = 0, tim = 0;
            for(int i = 1; i <= l; i++)
                if(tim + x[i] <= t[i])
                    A++;

            ans = max(ans,A);
            tim = 2*x[l];
            for(int i = n; i >= r; i--)
                if(tim + (L-x[i]) <= t[i])
                    A++;

            ans = max(ans,A);

            A = 0, tim = 2*(L-x[r]);
            if(r == n+1) tim = 0;
            for(int i = 1; i <= l; i++)
                if(tim + x[i] <= t[i])
                    A++;

            ans = max(ans,A);
            tim = 0;
            for(int i = n; i >= r; i--)
                if(tim + (L-x[i]) <= t[i])
                    A++;
            ans = max(ans,A);
        }
    cout<< ans;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75