# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
219037 | Nightlight | Building 4 (JOI20_building4) | C++14 | 518 ms | 125672 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define mn first
#define mx second
using namespace std;
int N;
int fix[1000005][2];
//apakah fixed
int to[1000005][2];
//menyimpan lokasi bridge terdekat (A ke B) dan (B ke A)
int A[1000005][2];
//tinggi building
int b[2];
//banyak yang diperlukan untuk setiap A B
bool vis[1000005][2];
pair<int, int> dp[1000005][2];
void DFS(int u, int i) {
if(vis[u][i]) return;
vis[u][i] = 1;
int mn = 2000000000, mx = -2000000000;
if(A[u][i] <= A[u + 1][0]) {
DFS(u + 1, 0);
mn = min(dp[u + 1][0].mn + 1, mn);
mx = max(dp[u + 1][0].mx + 1, mx);
}
if(A[u][i] <= A[u + 1][1]) {
DFS(u + 1, 1);
mn = min(dp[u + 1][1].mn, mn);
mx = max(dp[u + 1][1].mx, mx);
}
dp[u][i] = make_pair(mn, mx);
}
string ans;
void backtrack() {
if(dp[0][0] == make_pair(2000000000, -2000000000) || dp[0][0].mn > N/2 || dp[0][0].mx < N/2) {
puts("-1");
exit(0);
}
int last = 0, cur = N / 2;
for(int i = 0; i < N; i++) {
if(A[i][last] <= A[i + 1][0] && dp[i + 1][0].mn <= cur - 1 && cur - 1 <= dp[i + 1][0].mx) {
last = 0; cur--;
ans += 'A';
continue;
}
if(A[i][last] <= A[i + 1][1] && dp[i + 1][1].mn <= cur && cur <= dp[i + 1][1].mx) {
last = 1;
ans += 'B';
}
}
cout << ans << "\n";
}
int main() {
scanf("%d", &N);
N <<= 1;
for(int i = 1; i <= N; i++) {
scanf("%d", &A[i][0]);
}
for(int i = 1; i <= N; i++) {
scanf("%d", &A[i][1]);
}
vis[N][0] = 1, vis[N][1] = 1;
dp[N][0] = make_pair(0, 0), dp[N][1] = make_pair(0, 0);
DFS(0, 0);
backtrack();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |