oj.uz

답안 #220223

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
220223 2020-04-07T11:20:29 Z atoiz 건물 4 (JOI20_building4) C++14
100 / 100
 388 ms 47356 KB 
/*input
6
25 18 40 37 29 95 41 53 39 69 61 90
14 18 22 28 18 30 32 32 63 58 71 78
*/

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstring>
#include <cassert>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <random>
#include <chrono>
#include <utility>
#include <fstream>

using namespace std;

// #define LOCAL
#define endl '\n'

#define deb err_stream()
struct err_stream
{
	template <typename T>
	err_stream& operator<< (T x)
	{
		#ifdef LOCAL
		cout << x << flush;
		#endif
		return *this;
	}
};

using ll = int64_t;
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second

#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORA(i, a) for (auto &i : a)
#define FORB(i, a, b) for (int i = a; i >= b; --i)
#define SZ(a) ((int) a.size())
#define ALL(a) begin(a), end(a)

mt19937 rng(chrono::system_clock().now().time_since_epoch().count());

const int MAXN = 1000007, INF = 1e9 + 7;
int N, A[MAXN][2], L[MAXN][2], R[MAXN][2];
bool ok[MAXN][2], ans[MAXN];

void trace(int i, int k, int x)
{
	if (i == 0) return;
	assert(ok[i][k]);
	ans[i] = k;

	x -= k;
	FOR(j, 0, 1) if (ok[i - 1][j] && A[i - 1][j] <= A[i][k] && L[i - 1][j] <= x && x <= R[i - 1][j]) {
		trace(i - 1, j, x);
		return;
	}
	assert(0);
}

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

	cin >> N;
	N <<= 1;
	FOR(i, 1, N) cin >> A[i][0];
	FOR(i, 1, N) cin >> A[i][1];

	ok[0][0] = ok[0][1] = 1; A[N + 1][0] = INF;
	FOR(i, 1, N + 1) FOR(k, 0, 1) FOR(j, 0, 1) {
		if (ok[i - 1][j] && A[i - 1][j] <= A[i][k]) {
			if (!ok[i][k]) {
				ok[i][k] = 1;
				L[i][k] = L[i - 1][j] + k;
				R[i][k] = R[i - 1][j] + k;
			} else {
				// assert(R[i][k] >= L[i - 1][j] + k - 1);
				// assert(L[i][k] <= R[i - 1][j] + k + 1);
				L[i][k] = min(L[i][k], L[i - 1][j] + k);
				R[i][k] = max(R[i][k], R[i - 1][j] + k);
			}
		}
	}

	if (!ok[N + 1][0] || N / 2 < L[N + 1][0] || R[N + 1][0] < N / 2) cout << -1 << endl;
	else {
		trace(N + 1, 0, N / 2);
		FOR(i, 1, N) cout << (ans[i] ? 'B' : 'A');
		cout << endl;
	}

	deb << "Execution time: " << 1.0 * clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 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 7 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 7 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 640 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 14 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 12 ms 616 KB Output is correct
20 Correct 6 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 8 ms 512 KB Output is correct
24 Correct 6 ms 640 KB Output is correct
25 Correct 9 ms 512 KB Output is correct
26 Correct 6 ms 544 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 9 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 7 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 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 7 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 7 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 640 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 14 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 12 ms 616 KB Output is correct
20 Correct 6 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 8 ms 512 KB Output is correct
24 Correct 6 ms 640 KB Output is correct
25 Correct 9 ms 512 KB Output is correct
26 Correct 6 ms 544 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 9 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 7 ms 512 KB Output is correct
34 Correct 287 ms 18424 KB Output is correct
35 Correct 318 ms 43644 KB Output is correct
36 Correct 324 ms 43008 KB Output is correct
37 Correct 343 ms 43900 KB Output is correct
38 Correct 316 ms 43896 KB Output is correct
39 Correct 322 ms 43000 KB Output is correct
40 Correct 355 ms 46452 KB Output is correct
41 Correct 328 ms 44060 KB Output is correct
42 Correct 331 ms 45472 KB Output is correct
43 Correct 384 ms 47300 KB Output is correct
44 Correct 357 ms 47120 KB Output is correct
45 Correct 357 ms 47224 KB Output is correct
46 Correct 353 ms 47096 KB Output is correct
47 Correct 336 ms 46196 KB Output is correct
48 Correct 361 ms 46048 KB Output is correct
49 Correct 354 ms 46784 KB Output is correct
50 Correct 388 ms 46304 KB Output is correct
51 Correct 371 ms 46304 KB Output is correct
52 Correct 222 ms 35448 KB Output is correct
53 Correct 221 ms 35368 KB Output is correct
54 Correct 240 ms 35340 KB Output is correct
55 Correct 215 ms 35088 KB Output is correct
56 Correct 339 ms 47356 KB Output is correct
57 Correct 295 ms 42100 KB Output is correct
58 Correct 318 ms 42364 KB Output is correct
59 Correct 352 ms 42136 KB Output is correct
60 Correct 273 ms 40124 KB Output is correct
61 Correct 302 ms 42744 KB Output is correct
62 Correct 306 ms 42156 KB Output is correct
63 Correct 305 ms 42720 KB Output is correct
64 Correct 285 ms 41340 KB Output is correct
65 Correct 323 ms 42788 KB Output is correct