oj.uz

Submission #471514

# Submission time Handle Problem Language Result Execution time Memory
471514 2021-09-09T15:58:14 Z prvocislo Building 4 (JOI20_building4) C++17
100 / 100
 319 ms 48212 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
typedef long long ll;
using namespace std;

const int inf = 1e9 + 5;
void chmin(int& a, const int& b) { a = min(a, b); }
void chmax(int& a, const int& b) { a = max(a, b); }
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	n *= 2;
	vector<vector<int> > l(2, vector<int>(n + 2, inf)), r(2, vector<int>(n + 2, -inf));
	vector<vector<int> > a(2, vector<int>(n + 2));
	a[0][0] = a[1][0] = -inf;
	for (int l = 0; l < 2; l++) for (int i = 0; i < n; i++) cin >> a[l][i + 1];
	a[0][n + 1] = a[1][n + 1] = inf;
	l[0][0] = l[1][0] = r[0][0] = r[1][0] = 0;
	for (int i = 1; i <= n + 1; i++)
	{
		for (int l1 = 0; l1 < 2; l1++) for (int l2 = 0; l2 < 2; l2++) if (a[l1][i - 1] <= a[l2][i] && l[l1][i - 1] != inf)
		{
			chmin(l[l2][i], l[l1][i - 1]);
			chmax(r[l2][i], r[l1][i - 1]);
		}
		l[1][i]++;
		r[1][i]++;
	}
	int pos = 0, b = n / 2;
	string ans;
	for (int i = n; i > 0; i--)
	{
		if (l[0][i] <= b && b <= r[0][i] && a[0][i] <= a[pos][i + 1])
		{
			ans.push_back('A');
			pos = 0;
		}
		else if (l[1][i] <= b && b <= r[1][i] && a[1][i] <= a[pos][i + 1])
		{
			ans.push_back('B');
			pos = 1;
			b--;
		}
		else
		{
			cout << "-1\n";
			return 0;
		}
	}
	reverse(ans.begin(), ans.end());
	cout << ans << "\n";
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 456 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 456 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 456 KB Output is correct
25 Correct 1 ms 452 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 456 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 460 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 2 ms 456 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 456 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 456 KB Output is correct
25 Correct 1 ms 452 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 2 ms 336 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 456 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 287 ms 46180 KB Output is correct
35 Correct 280 ms 44508 KB Output is correct
36 Correct 280 ms 43712 KB Output is correct
37 Correct 287 ms 44616 KB Output is correct
38 Correct 278 ms 44620 KB Output is correct
39 Correct 269 ms 43840 KB Output is correct
40 Correct 303 ms 47456 KB Output is correct
41 Correct 287 ms 44908 KB Output is correct
42 Correct 297 ms 46452 KB Output is correct
43 Correct 309 ms 47912 KB Output is correct
44 Correct 298 ms 47924 KB Output is correct
45 Correct 305 ms 47996 KB Output is correct
46 Correct 298 ms 47992 KB Output is correct
47 Correct 299 ms 47020 KB Output is correct
48 Correct 282 ms 46840 KB Output is correct
49 Correct 290 ms 47736 KB Output is correct
50 Correct 319 ms 47144 KB Output is correct
51 Correct 305 ms 47140 KB Output is correct
52 Correct 230 ms 36212 KB Output is correct
53 Correct 227 ms 36216 KB Output is correct
54 Correct 220 ms 36216 KB Output is correct
55 Correct 223 ms 36016 KB Output is correct
56 Correct 300 ms 48212 KB Output is correct
57 Correct 260 ms 42928 KB Output is correct
58 Correct 259 ms 43256 KB Output is correct
59 Correct 262 ms 43156 KB Output is correct
60 Correct 255 ms 40944 KB Output is correct
61 Correct 273 ms 43632 KB Output is correct
62 Correct 258 ms 43044 KB Output is correct
63 Correct 262 ms 43776 KB Output is correct
64 Correct 256 ms 42128 KB Output is correct
65 Correct 267 ms 43640 KB Output is correct