oj.uz

Submission #720080

# Submission time Handle Problem Language Result Execution time Memory
720080 2023-04-07T11:40:05 Z Juan Collecting Stamps 3 (JOI20_ho_t3) C++17
0 / 100
 1 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define tii tuple<int, int, int>
#define pii pair<int, int>
#define ff first
#define ss second
const int maxn = 1e2 + 5, INF = 0x3f3f3f3f3f3f3f3f;

int X[maxn], T[maxn];

int32_t main(){
	int n, L; cin >> n >> L;
	for(int i = 1; i <= n; i++) cin >> X[i];
	for(int i = 1; i <= n; i++) cin >> T[i];

	int ans = 0;
	for(int i = 0; i <= n; i++){
		int tans = 0;
		for(int j = 1; j <= i; j++){
			if(T[j] >= X[j]) tans++;
		}

		for(int j = n; j > i; j--){
			if(T[j] >= L-X[j] + 2*X[i]) tans++;
		}

		ans = max(ans, tans);
	}

	for(int i = 0; i <= n; i++){
		int tans = 0;
		for(int j = n; j > i; j--){
			if(T[j] >= L-X[j]) tans++;
		}

		for(int j = 1; j <= i; j++){
			if(T[j] >= X[j] + 2*X[i+1]) tans++;
		}

		ans = max(ans, tans);
	}

	cout << ans << '\n';
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -