oj.uz

Submission #590369

# Submission time Handle Problem Language Result Execution time Memory
590369 2022-07-05T21:38:18 Z tutis Uplifting Excursion (BOI22_vault) C++17
5 / 100
 1438 ms 2476 KB 
/*input
2 5
2 3 1 1 4

*/
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
using ull = unsigned long long;
using ld = long double;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int M;
	ll L;
	cin >> M >> L;
	ll A[2 * M + 1];
	for (int i = 0; i <= 2 * M; i++)
		cin >> A[i];
	int D = 63750;
	vector<ll> C(2 * D + 1, -1e18);
	C[D] = 0;
	for (int i = -M; i <= M; i++)
	{
		if (i < 0)
		{
			for (int j = 0; j <= 2 * D; j++)
			{
				for (int k = 1; k <= A[i + M]; k++)
				{
					if (j + k * i >= 0 && j + k * i <= 2 * D)
						C[j + k * i] = max(C[j + k * i], C[j] + k);
				}
			}
		}
		else if (i > 0)
		{
			for (int j = 2 * D; j >= 0; j--)
			{
				for (int k = 1; k <= A[i + M]; k++)
				{
					if (j + k * i >= 0 && j + k * i <= 2 * D)
						C[j + k * i] = max(C[j + k * i], C[j] + k);
				}
			}
		}
		else
		{
			for (int j = 0; j <= 2 * D; j++)
			{
				C[j] += A[i + M];
			}
		}
	}
	if (L + D >= 0 && L + D <= 2 * D && C[L + D] >= 0)
		cout << C[L + D] << "\n";
	else
		cout << "impossible\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 2 ms 1220 KB Output is correct
3 Correct 2 ms 1236 KB Output is correct
4 Correct 9 ms 1236 KB Output is correct
5 Correct 344 ms 1236 KB Output is correct
6 Correct 403 ms 1236 KB Output is correct
7 Correct 158 ms 1236 KB Output is correct
8 Correct 350 ms 1236 KB Output is correct
9 Correct 686 ms 1236 KB Output is correct
10 Correct 24 ms 1236 KB Output is correct
11 Correct 27 ms 1236 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 2 ms 1220 KB Output is correct
3 Correct 2 ms 1236 KB Output is correct
4 Correct 9 ms 1236 KB Output is correct
5 Correct 344 ms 1236 KB Output is correct
6 Correct 403 ms 1236 KB Output is correct
7 Correct 158 ms 1236 KB Output is correct
8 Correct 350 ms 1236 KB Output is correct
9 Correct 686 ms 1236 KB Output is correct
10 Correct 24 ms 1236 KB Output is correct
11 Correct 27 ms 1236 KB Output is correct
12 Correct 3 ms 1236 KB Output is correct
13 Correct 3 ms 1236 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 9 ms 1236 KB Output is correct
16 Correct 350 ms 1236 KB Output is correct
17 Correct 404 ms 1236 KB Output is correct
18 Correct 158 ms 1236 KB Output is correct
19 Correct 370 ms 1236 KB Output is correct
20 Correct 682 ms 1236 KB Output is correct
21 Correct 31 ms 1236 KB Output is correct
22 Correct 23 ms 1236 KB Output is correct
23 Correct 1438 ms 1236 KB Output is correct
24 Incorrect 1437 ms 1236 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1236 KB Output is correct
2 Runtime error 784 ms 2476 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1236 KB Output is correct
2 Runtime error 784 ms 2476 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1236 KB Output is correct
2 Runtime error 784 ms 2476 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 2 ms 1220 KB Output is correct
3 Correct 2 ms 1236 KB Output is correct
4 Correct 9 ms 1236 KB Output is correct
5 Correct 344 ms 1236 KB Output is correct
6 Correct 403 ms 1236 KB Output is correct
7 Correct 158 ms 1236 KB Output is correct
8 Correct 350 ms 1236 KB Output is correct
9 Correct 686 ms 1236 KB Output is correct
10 Correct 24 ms 1236 KB Output is correct
11 Correct 27 ms 1236 KB Output is correct
12 Correct 10 ms 1236 KB Output is correct
13 Runtime error 784 ms 2476 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1236 KB Output is correct
2 Runtime error 784 ms 2476 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 2 ms 1220 KB Output is correct
3 Correct 2 ms 1236 KB Output is correct
4 Correct 9 ms 1236 KB Output is correct
5 Correct 344 ms 1236 KB Output is correct
6 Correct 403 ms 1236 KB Output is correct
7 Correct 158 ms 1236 KB Output is correct
8 Correct 350 ms 1236 KB Output is correct
9 Correct 686 ms 1236 KB Output is correct
10 Correct 24 ms 1236 KB Output is correct
11 Correct 27 ms 1236 KB Output is correct
12 Correct 3 ms 1236 KB Output is correct
13 Correct 3 ms 1236 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 9 ms 1236 KB Output is correct
16 Correct 350 ms 1236 KB Output is correct
17 Correct 404 ms 1236 KB Output is correct
18 Correct 158 ms 1236 KB Output is correct
19 Correct 370 ms 1236 KB Output is correct
20 Correct 682 ms 1236 KB Output is correct
21 Correct 31 ms 1236 KB Output is correct
22 Correct 23 ms 1236 KB Output is correct
23 Correct 1438 ms 1236 KB Output is correct
24 Incorrect 1437 ms 1236 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1236 KB Output is correct
2 Runtime error 784 ms 2476 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 2 ms 1220 KB Output is correct
3 Correct 2 ms 1236 KB Output is correct
4 Correct 9 ms 1236 KB Output is correct
5 Correct 344 ms 1236 KB Output is correct
6 Correct 403 ms 1236 KB Output is correct
7 Correct 158 ms 1236 KB Output is correct
8 Correct 350 ms 1236 KB Output is correct
9 Correct 686 ms 1236 KB Output is correct
10 Correct 24 ms 1236 KB Output is correct
11 Correct 27 ms 1236 KB Output is correct
12 Correct 3 ms 1236 KB Output is correct
13 Correct 3 ms 1236 KB Output is correct
14 Correct 2 ms 1236 KB Output is correct
15 Correct 9 ms 1236 KB Output is correct
16 Correct 350 ms 1236 KB Output is correct
17 Correct 404 ms 1236 KB Output is correct
18 Correct 158 ms 1236 KB Output is correct
19 Correct 370 ms 1236 KB Output is correct
20 Correct 682 ms 1236 KB Output is correct
21 Correct 31 ms 1236 KB Output is correct
22 Correct 23 ms 1236 KB Output is correct
23 Correct 1438 ms 1236 KB Output is correct
24 Incorrect 1437 ms 1236 KB Output isn't correct
25 Halted 0 ms 0 KB -