oj.uz

답안 #473458

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
473458 2021-09-15T14:36:11 Z hhhhaura 쌀 창고 (IOI11_ricehub) C++14
17 / 100
 221 ms 2248 KB 
#define wiwihorz
#include "ricehub.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)
 
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i --)
#define all(x) x.begin(), x.end()
#define ceil(a, b) ((a + b - 1) / (b))
 
#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)
 
using namespace std;
 
#define ll long long int
#define lld long double
#define pii pair<ll, ll> 
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

ll n;
vector<ll> a, pre;
pii get_val(ll x, ll len) {
	ll L, R, ans = 0, cnt = 0;
	L = 0, R = x;
	while(R - L > 1) {
		int mid = (L + R) / 2;
		if(a[x] - a[mid] <= len) R = mid;
		else L = mid;
	}
	cnt += x - R + 1;
	ans += a[x] * (x - R + 1) - (pre[x] - pre[R - 1]);
	L = x, R = n + 1;
	while(R - L > 1) {
		int mid = (L + R) / 2;
		if(a[mid] - a[x] <= len) L = mid;
		else R = mid;
	}
	cnt += L - x;
	ans += pre[L] - pre[x] - (L - x) * a[x];
	return {cnt, ans};
}
int besthub(int R, int L, int X[], ll B) {
	n = R;
	a.assign(R + 1, 0);
	pre.assign(R + 1, 0);
	rep(i, 1, R) {
		a[i] = X[i - 1];
		pre[i] = pre[i - 1] + X[i - 1];
	}
	ll ans = 0; 
	rep(i, 1, R) {
		ll l = 0, r = L;
		ll cost, cnt, val, val2, cc;
		while(r - l > 1) {
			int mid = (l + r) / 2;
			if(tie(cnt, cost) = get_val(i, mid), 
				cost <= B) val = cnt, l = mid, cc = cost;
			else r = mid, val2 = cnt; 
		}
		ans = max(ans, val + min((B - cc) / r, val2 - val));
	}
	return ans;
}

Compilation message

ricehub.cpp:5: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    5 | #pragma loop-opt(on)
      | 
ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:63:31: warning: 'cc' may be used uninitialized in this function [-Wmaybe-uninitialized]
   63 |   ans = max(ans, val + min((B - cc) / r, val2 - val));
      |                            ~~~^~~~~
ricehub.cpp:63:47: warning: 'val2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   63 |   ans = max(ans, val + min((B - cc) / r, val2 - val));
      |                                          ~~~~~^~~~~
ricehub.cpp:63:22: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
   63 |   ans = max(ans, val + min((B - cc) / r, val2 - val));
      |                  ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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