oj.uz

Submission #590384

# Submission time Handle Problem Language Result Execution time Memory
590384 2022-07-05T22:02:38 Z tutis Uplifting Excursion (BOI22_vault) C++17
0 / 100
 5000 ms 4180 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 = 505500;
	vector<int> C(2 * D + 1, -1e9);
	C[D] = 0;
	int del = 0;
	for (int i = 1; i <= M; i++)
	{
		for (int k = 1; k <= A[i + M]; k++)
		{
			for (int j = min(D + del, 2 * D - i); j >= max(0, D - del); j--)
			{
				C[j + i] = max(C[j + i], C[j] + 1);
			}
			del += i;
		}
		for (int k = 1; k <= A[-i + M]; k++)
		{
			for (int j = max(D - del, i); j <= min(D + del, 2 * D); j++)
			{
				C[j - i] = max(C[j - i], C[j] + 1);
			}
		}
	}
	if (L + D >= 0 && L + D <= 2 * D && C[L + D] >= 0)
		cout << C[L + D] + A[M] << "\n";
	else
		cout << "impossible\n";
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 52 ms 4180 KB Output is correct
6 Incorrect 54 ms 4180 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 52 ms 4180 KB Output is correct
6 Incorrect 54 ms 4180 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Execution timed out 5040 ms 4180 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Execution timed out 5040 ms 4180 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Execution timed out 5040 ms 4180 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 52 ms 4180 KB Output is correct
6 Incorrect 54 ms 4180 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Execution timed out 5040 ms 4180 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 52 ms 4180 KB Output is correct
6 Incorrect 54 ms 4180 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Execution timed out 5040 ms 4180 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 3 ms 4180 KB Output is correct
4 Correct 2 ms 4180 KB Output is correct
5 Correct 52 ms 4180 KB Output is correct
6 Incorrect 54 ms 4180 KB Output isn't correct
7 Halted 0 ms 0 KB -