답안 #782972

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782972 2023-07-14T13:10:41 Z Elias 건물 4 (JOI20_building4) C++17
100 / 100
202 ms 68972 KB
#ifndef _DEBUG
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define all(x) (x).begin(), (x).end()

template <class T>
istream &operator>>(istream &in, vector<T> &a)
{
	for (T &x : a)
		in >> x;
	return in;
}

template <class T>
ostream &operator<<(ostream &out, const vector<T> &a)
{
	for (T x : a)
		out << x << " ";
	out << "\n";
	return out;
}

struct Range
{
	int low, high;

	Range operator+(Range other)
	{
		if (low < 0)
			return other;

		if (other.low < 0)
			return *this;

		assert(max(low, other.low) <= min(high, other.high) + 1);

		return {min(low, other.low), max(high, other.high)};
	}

	Range operator+(int x)
	{
		return {low + x, high + x};
	}
};

signed main()
{
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	int n;
	cin >> n;

	vector<int> a(2 * n);
	vector<int> b(2 * n);
	cin >> a >> b;

	vector<Range> rA(2 * n, {-1000000000, -1000000000}), rB(2 * n, {-1000000000, -1000000000});

	rA[0] = {0, 0};
	rB[0] = {1, 1};

	for (int i = 1; i < n * 2; i++)
	{
		if (a[i] >= a[i - 1])
			rA[i] = rA[i] + rA[i - 1];
		if (a[i] >= b[i - 1])
			rA[i] = rA[i] + rB[i - 1];
		if (b[i] >= a[i - 1])
			rB[i] = (rB[i] + rA[i - 1]);
		if (b[i] >= b[i - 1])
			rB[i] = (rB[i] + rB[i - 1]);
		rB[i] = rB[i] + 1;
	}

	string out;
	int needed = n;
	int last_taken = 10000000000000;

	while (rA.size())
	{
		if (needed >= rA.back().low && needed <= rA.back().high && a.back() <= last_taken)
		{
			out.push_back('A');
			last_taken = a.back();
		}
		else if (needed >= rB.back().low && needed <= rB.back().high && b.back() <= last_taken)
		{
			out.push_back('B');
			last_taken = b.back();
			needed--;
		}
		else
		{
			cout << -1;
			return 0;
		}
		rA.pop_back();
		rB.pop_back();
		a.pop_back();
		b.pop_back();
	}

	reverse(out.begin(), out.end());
	cout << out;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 584 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 456 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 436 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 588 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 584 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 456 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 174 ms 65504 KB Output is correct
35 Correct 184 ms 63664 KB Output is correct
36 Correct 182 ms 62848 KB Output is correct
37 Correct 174 ms 64052 KB Output is correct
38 Correct 168 ms 63964 KB Output is correct
39 Correct 162 ms 63272 KB Output is correct
40 Correct 177 ms 68116 KB Output is correct
41 Correct 194 ms 64648 KB Output is correct
42 Correct 183 ms 66488 KB Output is correct
43 Correct 187 ms 68692 KB Output is correct
44 Correct 202 ms 68972 KB Output is correct
45 Correct 192 ms 68688 KB Output is correct
46 Correct 181 ms 68692 KB Output is correct
47 Correct 194 ms 67812 KB Output is correct
48 Correct 188 ms 67668 KB Output is correct
49 Correct 199 ms 68468 KB Output is correct
50 Correct 189 ms 67884 KB Output is correct
51 Correct 186 ms 67904 KB Output is correct
52 Correct 137 ms 57056 KB Output is correct
53 Correct 129 ms 56932 KB Output is correct
54 Correct 127 ms 57028 KB Output is correct
55 Correct 122 ms 56724 KB Output is correct
56 Correct 184 ms 68972 KB Output is correct
57 Correct 154 ms 63616 KB Output is correct
58 Correct 159 ms 63968 KB Output is correct
59 Correct 170 ms 63880 KB Output is correct
60 Correct 174 ms 60432 KB Output is correct
61 Correct 174 ms 64368 KB Output is correct
62 Correct 178 ms 63456 KB Output is correct
63 Correct 164 ms 64428 KB Output is correct
64 Correct 177 ms 62180 KB Output is correct
65 Correct 181 ms 64352 KB Output is correct