oj.uz

답안 #221873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
221873 2020-04-11T11:27:50 Z davooddkareshki Collecting Stamps 3 (JOI20_ho_t3) C++17
0 / 100
 4 ms 384 KB 
#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++;
            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++;
            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.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -