oj.uz

Submission #550826

# Submission time Handle Problem Language Result Execution time Memory
550826 2022-04-19T09:51:58 Z MilosMilutinovic Building 4 (JOI20_building4) C++14
100 / 100
 384 ms 45264 KB 
//~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define shandom_ruffle random_shuffle

using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
const int nax=1000*1007;

int n;
int tab[nax][2];

int dpl[nax][2];
int dpr[nax][2];

char ans[nax];

void no()
{
	printf("-1");
	exit(0);
}
void check()
{
	int pre=0;
	for (int i=1; i<=n; i++)
	{
		int wzn=1e9+5;
		for (int j=0; j<2; j++)
			if (tab[i][j]>=pre)
				wzn=min(wzn, tab[i][j]);
		if (wzn>1e9)
			no();
		pre=wzn;
	}
}
void rec(int i, int sl, int jos)
{
	ans[i]='A'+sl;
	jos-=(sl==1);
	if (i==1)
	{
		assert(jos==0);
		return;
	}
	for (int j=0; j<2; j++)
		if (tab[i][sl]>=tab[i-1][j] && dpl[i-1][j]<=jos && dpr[i-1][j]>=jos)
		{
			rec(i-1, j, jos);
			break;
		}
}
int main()
{
	scanf("%d", &n);
	n=2*n;
	for (int i=1; i<=n; i++)
		scanf("%d", &tab[i][0]);
	for (int i=1; i<=n; i++)
		scanf("%d", &tab[i][1]);
	check();
	for (int i=1; i<=n; i++)
		for (int j=0; j<2; j++)
			dpl[i][j]=1e9, dpr[i][j]=-1e9;
	dpl[1][0]=0;
	dpr[1][0]=0;
	dpl[1][1]=1;
	dpr[1][1]=1;
	for (int i=2; i<=n; i++)
		for (int x=0; x<2; x++)
			for (int y=0; y<2; y++)
			{
				if (tab[i-1][x]>tab[i][y])
					continue;
				dpl[i][y]=min(dpl[i][y], dpl[i-1][x]+(y==1));
				dpr[i][y]=max(dpr[i][y], dpr[i-1][x]+(y==1));
			}
	int ok=0;
	for (int i=0; i<2; i++)
		if (dpl[n][i]<=n/2 && dpr[n][i]>=n/2)
		{
			rec(n, i, n/2);
			ok=1;
			break;
		}
	if (ok==0)
		no();
	for (int i=1; i<=n; i++)
		printf("%c", ans[i]);
	return 0;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:102:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
building4.cpp:105:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |   scanf("%d", &tab[i][0]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~
building4.cpp:107:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |   scanf("%d", &tab[i][1]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 2 ms 452 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 468 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
11 Correct 2 ms 448 KB Output is correct
12 Correct 2 ms 448 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 4 ms 400 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 372 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 3 ms 444 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 2 ms 452 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 468 KB Output is correct
10 Correct 1 ms 388 KB Output is correct
11 Correct 2 ms 448 KB Output is correct
12 Correct 2 ms 448 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 3 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 4 ms 400 KB Output is correct
20 Correct 3 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 372 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 448 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 3 ms 444 KB Output is correct
34 Correct 246 ms 26976 KB Output is correct
35 Correct 287 ms 41804 KB Output is correct
36 Correct 303 ms 41084 KB Output is correct
37 Correct 351 ms 42012 KB Output is correct
38 Correct 384 ms 41988 KB Output is correct
39 Correct 282 ms 41136 KB Output is correct
40 Correct 314 ms 44616 KB Output is correct
41 Correct 333 ms 42164 KB Output is correct
42 Correct 339 ms 43592 KB Output is correct
43 Correct 350 ms 45144 KB Output is correct
44 Correct 342 ms 45052 KB Output is correct
45 Correct 296 ms 45116 KB Output is correct
46 Correct 337 ms 45108 KB Output is correct
47 Correct 327 ms 44148 KB Output is correct
48 Correct 264 ms 43980 KB Output is correct
49 Correct 281 ms 44748 KB Output is correct
50 Correct 376 ms 44232 KB Output is correct
51 Correct 290 ms 44240 KB Output is correct
52 Correct 244 ms 33368 KB Output is correct
53 Correct 218 ms 33296 KB Output is correct
54 Correct 253 ms 33264 KB Output is correct
55 Correct 216 ms 33100 KB Output is correct
56 Correct 284 ms 45264 KB Output is correct
57 Correct 250 ms 40092 KB Output is correct
58 Correct 259 ms 40268 KB Output is correct
59 Correct 275 ms 40400 KB Output is correct
60 Correct 253 ms 38196 KB Output is correct
61 Correct 261 ms 40780 KB Output is correct
62 Correct 291 ms 40164 KB Output is correct
63 Correct 254 ms 40764 KB Output is correct
64 Correct 232 ms 39384 KB Output is correct
65 Correct 259 ms 40756 KB Output is correct