oj.uz

답안 #856154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856154 2023-10-02T17:53:59 Z aykhn 쌀 창고 (IOI11_ricehub) C++14
17 / 100
 10 ms 4212 KB 
#include "ricehub.h"
#include <bits/stdc++.h>

// author : aykhn

using namespace std;
typedef long long ll;

#define pb push_back
#define ins insert
#define mpr make_pair
#define all(v) v.begin(), v.end()
#define bpc __builtin_popcount
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define infll 0x3F3F3F3F3F3F3F3F
#define inf 0x3F3F3F3F

int besthub(int n, int L, int X[], long long b)
{
	ll x[n];
	for (int i = 0; i < n; i++) x[i] = X[i];
	vector<ll> pref(n + 1);
	pref[0] = x[0];
	for (int i = 1; i < n; i++) pref[i] = pref[i - 1] + x[i];
	pref[n] = pref[n - 1];
	int ans = 1;
	int l = 0;
	int r = 1;
	for (int i = 0; i < n; i++)
	{
		ll sum = x[i] * (i - l + 1) - (pref[i] - (l ? pref[l - 1] : 0));
		sum += pref[r - 1] - (i ? pref[i - 1] : 0) - x[i] * (r - i); 
		while (l < i)
		{
			if (sum <= b) break;
			sum -= abs(x[i] - x[l]);
			l++;
		} 
		while (r < n)
		{
			if (sum + abs(x[r] - x[i]) <= b)
			{
				sum += abs(x[r] - x[i]);
				r++;
			}
			else break;
		}
		while (l < i)
		{
			if (sum <= b) break;
			sum -= abs(x[i] - x[l]);
			l++;
		} 
		while (r < n)
		{
			if (sum + abs(x[r] - x[i]) <= b)
			{
				sum += abs(x[r] - x[i]);
				r++;
			}
			else break;
		}
		ans = max(ans, r - l);
	}
	return ans;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 2 ms 736 KB Output is correct
3 Correct 10 ms 4188 KB Output is correct
4 Correct 9 ms 4188 KB Output is correct
5 Correct 5 ms 3420 KB Output is correct
6 Correct 4 ms 3420 KB Output is correct
7 Correct 8 ms 4184 KB Output is correct
8 Correct 8 ms 4188 KB Output is correct
9 Correct 4 ms 3444 KB Output is correct
10 Correct 4 ms 3420 KB Output is correct
11 Correct 10 ms 4188 KB Output is correct
12 Correct 10 ms 4212 KB Output is correct
13 Incorrect 5 ms 3420 KB Output isn't correct
14 Halted 0 ms 0 KB -