oj.uz

Submission #735920

# Submission time Handle Problem Language Result Execution time Memory
735920 2023-05-05T02:54:17 Z marvinthang Building 4 (JOI20_building4) C++17
100 / 100
 236 ms 45520 KB 
/*************************************
*    author: marvinthang             *
*    created: 03.05.2023 17:09:59    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int MAX = 1e6 + 6;
const int INF = 1e9;

int N, A[MAX][2];

void init(void) {
	cin >> N;
	REP(t, 2) REP(i, 2 * N) cin >> A[i][t];
}

int ma[MAX][2], mi[MAX][2];

void process(void) {
	memset(ma, 0xc3, sizeof(ma));
	memset(mi, 0x3f, sizeof(ma));
	mi[1][0] = ma[1][0] = 0;
	mi[1][1] = ma[1][1] = 1;
	FOR(i, 1, 2 * N) REP(k, 2) {
		REP(l, 2) if (A[i - 1][k] <= A[i][l]) {
			maximize(ma[i + 1][l], ma[i][k] + l);
			minimize(mi[i + 1][l], mi[i][k] + l);
		}
	}
	int t = mi[2 * N][1] <= N && N <= ma[2 * N][1];
	if (mi[2 * N][t] > N || ma[2 * N][t] < N) return void(cout << "-1\n");
	string res(1, 'A' + t);
	int rem = N;
	FORD(i, 2 * N, 1) {
		rem -= t;
		REP(k, 2) if (A[i - 1][k] <= A[i][t] && mi[i][k] <= rem && rem <= ma[i][k]) {
			t = k;
			break;
		}
		res += char('A' + t);
	}
	reverse(ALL(res));
	cout << res << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("C");
	init();
	process();
	cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
building4.cpp:88:2: note: in expansion of macro 'file'
   88 |  file("C");
      |  ^~~~
building4.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
building4.cpp:88:2: note: in expansion of macro 'file'
   88 |  file("C");
      |  ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 6 ms 15956 KB Output is correct
3 Correct 7 ms 15956 KB Output is correct
4 Correct 7 ms 15944 KB Output is correct
5 Correct 8 ms 16084 KB Output is correct
6 Correct 7 ms 16020 KB Output is correct
7 Correct 9 ms 16084 KB Output is correct
8 Correct 7 ms 16084 KB Output is correct
9 Correct 7 ms 16084 KB Output is correct
10 Correct 7 ms 16084 KB Output is correct
11 Correct 7 ms 16084 KB Output is correct
12 Correct 7 ms 16016 KB Output is correct
13 Correct 7 ms 16052 KB Output is correct
14 Correct 8 ms 16084 KB Output is correct
15 Correct 7 ms 16104 KB Output is correct
16 Correct 7 ms 16084 KB Output is correct
17 Correct 8 ms 16048 KB Output is correct
18 Correct 7 ms 16092 KB Output is correct
19 Correct 7 ms 16088 KB Output is correct
20 Correct 6 ms 16080 KB Output is correct
21 Correct 7 ms 15960 KB Output is correct
22 Correct 7 ms 15952 KB Output is correct
23 Correct 7 ms 15960 KB Output is correct
24 Correct 7 ms 16212 KB Output is correct
25 Correct 7 ms 15988 KB Output is correct
26 Correct 7 ms 16012 KB Output is correct
27 Correct 7 ms 16020 KB Output is correct
28 Correct 7 ms 15956 KB Output is correct
29 Correct 7 ms 15956 KB Output is correct
30 Correct 7 ms 16068 KB Output is correct
31 Correct 7 ms 16052 KB Output is correct
32 Correct 7 ms 15968 KB Output is correct
33 Correct 7 ms 15992 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15956 KB Output is correct
2 Correct 6 ms 15956 KB Output is correct
3 Correct 7 ms 15956 KB Output is correct
4 Correct 7 ms 15944 KB Output is correct
5 Correct 8 ms 16084 KB Output is correct
6 Correct 7 ms 16020 KB Output is correct
7 Correct 9 ms 16084 KB Output is correct
8 Correct 7 ms 16084 KB Output is correct
9 Correct 7 ms 16084 KB Output is correct
10 Correct 7 ms 16084 KB Output is correct
11 Correct 7 ms 16084 KB Output is correct
12 Correct 7 ms 16016 KB Output is correct
13 Correct 7 ms 16052 KB Output is correct
14 Correct 8 ms 16084 KB Output is correct
15 Correct 7 ms 16104 KB Output is correct
16 Correct 7 ms 16084 KB Output is correct
17 Correct 8 ms 16048 KB Output is correct
18 Correct 7 ms 16092 KB Output is correct
19 Correct 7 ms 16088 KB Output is correct
20 Correct 6 ms 16080 KB Output is correct
21 Correct 7 ms 15960 KB Output is correct
22 Correct 7 ms 15952 KB Output is correct
23 Correct 7 ms 15960 KB Output is correct
24 Correct 7 ms 16212 KB Output is correct
25 Correct 7 ms 15988 KB Output is correct
26 Correct 7 ms 16012 KB Output is correct
27 Correct 7 ms 16020 KB Output is correct
28 Correct 7 ms 15956 KB Output is correct
29 Correct 7 ms 15956 KB Output is correct
30 Correct 7 ms 16068 KB Output is correct
31 Correct 7 ms 16052 KB Output is correct
32 Correct 7 ms 15968 KB Output is correct
33 Correct 7 ms 15992 KB Output is correct
34 Correct 211 ms 42652 KB Output is correct
35 Correct 215 ms 43032 KB Output is correct
36 Correct 210 ms 42724 KB Output is correct
37 Correct 209 ms 43268 KB Output is correct
38 Correct 192 ms 43324 KB Output is correct
39 Correct 200 ms 42376 KB Output is correct
40 Correct 219 ms 44824 KB Output is correct
41 Correct 195 ms 43012 KB Output is correct
42 Correct 226 ms 44200 KB Output is correct
43 Correct 224 ms 45188 KB Output is correct
44 Correct 226 ms 45268 KB Output is correct
45 Correct 227 ms 45328 KB Output is correct
46 Correct 210 ms 45232 KB Output is correct
47 Correct 210 ms 44268 KB Output is correct
48 Correct 206 ms 44124 KB Output is correct
49 Correct 216 ms 44920 KB Output is correct
50 Correct 236 ms 44544 KB Output is correct
51 Correct 221 ms 44408 KB Output is correct
52 Correct 149 ms 33476 KB Output is correct
53 Correct 150 ms 33516 KB Output is correct
54 Correct 138 ms 33732 KB Output is correct
55 Correct 143 ms 33152 KB Output is correct
56 Correct 208 ms 45520 KB Output is correct
57 Correct 181 ms 40388 KB Output is correct
58 Correct 184 ms 40412 KB Output is correct
59 Correct 179 ms 40372 KB Output is correct
60 Correct 177 ms 39560 KB Output is correct
61 Correct 177 ms 40904 KB Output is correct
62 Correct 180 ms 40664 KB Output is correct
63 Correct 187 ms 40840 KB Output is correct
64 Correct 171 ms 40068 KB Output is correct
65 Correct 192 ms 40880 KB Output is correct