oj.uz

답안 #579153

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
579153 2022-06-18T12:28:37 Z cheissmart Uplifting Excursion (BOI22_vault) C++14
20 / 100
 928 ms 628 KB 
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

string _reset = "\u001b[0m", _yellow = "\u001b[33m", _bold = "\u001b[1m";
void DBG() { cerr << "]" << _reset << endl; }
template<class H, class...T> void DBG(H h, T ...t) {
	cerr << to_string(h);
	if(sizeof ...(t)) cerr << ", ";
	DBG(t...);
}
#ifdef CHEISSMART
#define debug(...) cerr << _yellow << _bold << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define debug(...)
#endif

const int INF = 1e9 + 7, mxM = 101;

template<class T> void cmax(T& a, T b) { a = max(a, b); }

int m, l;
ll a[mxM * 2], b[mxM * 2];

signed main()
{
	IO_OP;

	cin >> m >> l;
	ll tot = 0, ans = 0;
	for(int i = -m; i <= m; i++) {
		cin >> a[i + m];
		tot += a[i + m] * i;
	}
	if(tot < l) {
		tot = -tot;
		l = -l;
		for(int i = 0; i < m; i++)
			swap(a[i], a[2 * m - i]);
	}
	tot = 0;
	for(int i = -m; i <= 0; i++) {
		tot += a[i + m] * i;
		b[i + m] = a[i + m];
		ans += b[i + m];
	}

	if(tot > l) {
		cout << "impossible\n";
		return 0;
	}
	for(int i = 1; i <= m; i++) {
		assert(tot <= l);
		b[i + m] = min((l - tot) / i, a[i + m]);
		tot += b[i + m] * i;
		ans += b[i + m];
	}
	assert(tot <= l);
	if(tot + mxM < l) {
		cout << "impossible\n";
		return 0;
	}

	int C = mxM * mxM * 2;
	vi dp(C * 2, -INF);
	dp[0 + C] = 0;

	for(int i = -m; i <= m; i++) {
		vi ndp(C * 2, -INF);
		for(int delta = -2 * m; delta <= 2 * m; delta++) {
			if(b[i + m] + delta < 0 || b[i + m] + delta > a[i + m]) continue;
			for(int j = 0; j < C * 2; j++) if(0 <= j + delta * i && j + delta * i < C * 2) {
				cmax(ndp[j + delta * i], dp[j] + delta);
			}
		}
		swap(dp, ndp);
	}
	ans += dp[l - tot + C];
	if(ans < 0) cout << "impossible\n";
	else cout << ans << '\n';

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 159 ms 620 KB Output is correct
7 Correct 56 ms 620 KB Output is correct
8 Correct 125 ms 628 KB Output is correct
9 Correct 272 ms 620 KB Output is correct
10 Correct 21 ms 596 KB Output is correct
11 Correct 19 ms 596 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 159 ms 620 KB Output is correct
7 Correct 56 ms 620 KB Output is correct
8 Correct 125 ms 628 KB Output is correct
9 Correct 272 ms 620 KB Output is correct
10 Correct 21 ms 596 KB Output is correct
11 Correct 19 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 8 ms 596 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 142 ms 596 KB Output is correct
18 Correct 68 ms 620 KB Output is correct
19 Correct 136 ms 624 KB Output is correct
20 Correct 234 ms 596 KB Output is correct
21 Correct 14 ms 596 KB Output is correct
22 Correct 13 ms 596 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 513 ms 624 KB Output is correct
25 Correct 216 ms 624 KB Output is correct
26 Correct 928 ms 628 KB Output is correct
27 Correct 885 ms 620 KB Output is correct
28 Correct 26 ms 596 KB Output is correct
29 Correct 25 ms 620 KB Output is correct

Subtask #3-1
0 / 10.0

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

Subtask #3-2
0 / 10.0

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

Subtask #4-1
0 / 10.0

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

Subtask #4-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 159 ms 620 KB Output is correct
7 Correct 56 ms 620 KB Output is correct
8 Correct 125 ms 628 KB Output is correct
9 Correct 272 ms 620 KB Output is correct
10 Correct 21 ms 596 KB Output is correct
11 Correct 19 ms 596 KB Output is correct
12 Correct 9 ms 596 KB Output is correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

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

Subtask #5-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 159 ms 620 KB Output is correct
7 Correct 56 ms 620 KB Output is correct
8 Correct 125 ms 628 KB Output is correct
9 Correct 272 ms 620 KB Output is correct
10 Correct 21 ms 596 KB Output is correct
11 Correct 19 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 8 ms 596 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 142 ms 596 KB Output is correct
18 Correct 68 ms 620 KB Output is correct
19 Correct 136 ms 624 KB Output is correct
20 Correct 234 ms 596 KB Output is correct
21 Correct 14 ms 596 KB Output is correct
22 Correct 13 ms 596 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 513 ms 624 KB Output is correct
25 Correct 216 ms 624 KB Output is correct
26 Correct 928 ms 628 KB Output is correct
27 Correct 885 ms 620 KB Output is correct
28 Correct 26 ms 596 KB Output is correct
29 Correct 25 ms 620 KB Output is correct
30 Correct 9 ms 596 KB Output is correct
31 Incorrect 1 ms 212 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

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

Subtask #6-2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 159 ms 620 KB Output is correct
7 Correct 56 ms 620 KB Output is correct
8 Correct 125 ms 628 KB Output is correct
9 Correct 272 ms 620 KB Output is correct
10 Correct 21 ms 596 KB Output is correct
11 Correct 19 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 8 ms 596 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 142 ms 596 KB Output is correct
18 Correct 68 ms 620 KB Output is correct
19 Correct 136 ms 624 KB Output is correct
20 Correct 234 ms 596 KB Output is correct
21 Correct 14 ms 596 KB Output is correct
22 Correct 13 ms 596 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 513 ms 624 KB Output is correct
25 Correct 216 ms 624 KB Output is correct
26 Correct 928 ms 628 KB Output is correct
27 Correct 885 ms 620 KB Output is correct
28 Correct 26 ms 596 KB Output is correct
29 Correct 25 ms 620 KB Output is correct
30 Correct 9 ms 596 KB Output is correct
31 Incorrect 1 ms 212 KB Output isn't correct
32 Halted 0 ms 0 KB -