Submission #223031

# Submission time Handle Problem Language Result Execution time Memory
223031 2020-04-14T14:01:59 Z savacska Building 4 (JOI20_building4) C++14
100 / 100
431 ms 36600 KB
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;

int mas[5][1000005], ans[1000005], type[1000005];

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
 	ios_base::sync_with_stdio(0); cin.tie(0);
 	int n;
 	cin >> n;
 	for (int i = 1; i <= 2 * n; i++) cin >> mas[1][i];
 	for (int i = 1; i <= 2 * n; i++) cin >> mas[2][i];

 	for (int i = 1; i <= 2 * n; i++) ans[i] = min(mas[1][i], mas[2][i]);
 	for (int i = 2; i <= 2 * n; i++)
 	{
 	 	if (ans[i] < ans[i - 1]) ans[i] = max(mas[1][i], mas[2][i]);
 	 	if (ans[i] < ans[i - 1]) cout << "-1\n", exit(0);
 	}

 	int bal = 0;
 	for (int i = 1; i <= 2 * n; i++)
 		if (ans[i] == mas[1][i]) bal++, type[i] = 1;
 		else bal--, type[i] = 2;

 	int uk = 1;
 	while (uk <= 2 * n && bal != 0)
 	{
 	    if (ans[uk] != min(mas[1][uk], mas[2][uk])) {uk++; continue;}
 	    int cop = uk;
 	    while (cop + 1 <= 2 * n && ans[cop + 1] == min(mas[1][cop + 1], mas[2][cop + 1])
 	    		&& max(mas[1][cop + 1], mas[2][cop + 1]) >= max(mas[1][cop], mas[2][cop])
 	    		&& min(mas[1][cop + 1], mas[2][cop + 1]) < max(mas[1][cop], mas[2][cop])) cop++;

 	    if (cop == 2 * n || max(mas[1][cop], mas[2][cop]) <= min(mas[1][cop + 1], mas[2][cop + 1])
 	    	|| (ans[cop + 1] != min(mas[1][cop + 1], mas[2][cop + 1]) && ans[cop + 1] >= max(mas[1][cop], mas[2][cop])))
 	    {
 	    	int mx = 0, del = 0;
 	    	for (int i = cop; i >= uk; i--)
 	    	{
 	    	 	if (type[i] == 1) del -= 2;
 	    	 	else del += 2;
 	    	 	if (bal > 0) mx = min(mx, del);
 	    	 	else mx = max(mx, del);
 	     	}
 	     	del = 0;
 	     	if (bal > 0 && bal + mx < 0) mx = -bal;
 	     	if (bal < 0 && bal + mx > 0) mx = -bal;
 	     	if (mx != 0)
 	     	{
 	     		for (int i = cop; i >= uk; i--)
 	     		{
 	     	 		if (type[i] == 1) del -= 2;
 	     	 		else del += 2;
 	     	 		type[i] = 3 - type[i];
 	     	 		if (del == mx) break; 
 	     		}
 	     	}
 	     	bal += mx;
 	    }
 		uk = cop + 1;
 	}
 	if (bal != 0) cout << "-1\n", exit(0);

 	for (int i = 1; i <= 2 * n; i++)
 		if (type[i] == 1) cout << 'A';
 		else cout << 'B';
 	cout << '\n';
 	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 6 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 269 ms 30840 KB Output is correct
35 Correct 319 ms 33528 KB Output is correct
36 Correct 317 ms 33144 KB Output is correct
37 Correct 304 ms 33560 KB Output is correct
38 Correct 317 ms 33788 KB Output is correct
39 Correct 304 ms 33272 KB Output is correct
40 Correct 321 ms 32760 KB Output is correct
41 Correct 288 ms 33784 KB Output is correct
42 Correct 298 ms 32640 KB Output is correct
43 Correct 322 ms 27000 KB Output is correct
44 Correct 335 ms 27000 KB Output is correct
45 Correct 329 ms 27000 KB Output is correct
46 Correct 431 ms 27000 KB Output is correct
47 Correct 312 ms 33272 KB Output is correct
48 Correct 301 ms 34296 KB Output is correct
49 Correct 329 ms 32244 KB Output is correct
50 Correct 341 ms 33464 KB Output is correct
51 Correct 321 ms 33272 KB Output is correct
52 Correct 189 ms 24568 KB Output is correct
53 Correct 204 ms 24568 KB Output is correct
54 Correct 186 ms 24776 KB Output is correct
55 Correct 182 ms 24312 KB Output is correct
56 Correct 324 ms 36600 KB Output is correct
57 Correct 273 ms 31480 KB Output is correct
58 Correct 272 ms 31548 KB Output is correct
59 Correct 264 ms 31420 KB Output is correct
60 Correct 250 ms 30048 KB Output is correct
61 Correct 273 ms 31992 KB Output is correct
62 Correct 278 ms 31612 KB Output is correct
63 Correct 300 ms 32120 KB Output is correct
64 Correct 266 ms 30968 KB Output is correct
65 Correct 283 ms 31992 KB Output is correct