oj.uz

답안 #906185

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
906185 2024-01-13T15:15:34 Z alexdd 건물 4 (JOI20_building4) C++17
100 / 100
 186 ms 43576 KB 
#include<bits/stdc++.h>
using namespace std;
const int INF = 2e9;
int n;
int a[1000005];
int b[1000005];
pair<int,int> dp[1000005][2];
pair<int,int> combine(pair<int,int> x, pair<int,int> y)
{
    return {min(x.first,y.first), max(x.second,y.second)};
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n;
    for(int i=1;i<=2*n;i++)
        cin>>a[i];
    for(int i=1;i<=2*n;i++)
        cin>>b[i];
    dp[1][0] = {1,1};
    dp[1][1] = {0,0};
    for(int i=2;i<=2*n;i++)
    {
        dp[i][0] = {n+1,0};
        dp[i][1] = {n+1,0};
        if(a[i]>=a[i-1])
        {
            dp[i][0] = combine(dp[i][0], {dp[i-1][0].first+1, dp[i-1][0].second+1});
        }
        if(a[i]>=b[i-1])
        {
            dp[i][0] = combine(dp[i][0], {dp[i-1][1].first+1, dp[i-1][1].second+1});
        }
        if(b[i]>=a[i-1])
        {
            dp[i][1] = combine(dp[i][1], dp[i-1][0]);
        }
        if(b[i]>=b[i-1])
        {
            dp[i][1] = combine(dp[i][1], dp[i-1][1]);
        }
    }
    if((dp[2*n][0].first<=n && dp[2*n][0].second>=n) || (dp[2*n][1].first<=n && dp[2*n][1].second>=n))
    {
        int cur = n, ult = INF;
        string s = "";
        for(int i=2*n;i>0;i--)
        {
            if(dp[i][0].first<=cur && dp[i][0].second>=cur && a[i] <= ult)
            {
                ult = a[i];
                s.push_back('A');
                cur--;
            }
            else
            {
                ult = b[i];
                s.push_back('B');
            }
        }
        reverse(s.begin(),s.end());
        cout<<s;
    }
    else
        cout<<-1;
    return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4572 KB Output is correct
10 Correct 2 ms 4444 KB Output is correct
11 Correct 2 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 2 ms 4568 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 3 ms 4696 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4444 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 2 ms 4444 KB Output is correct
24 Correct 2 ms 4700 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct
27 Correct 2 ms 4576 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 2 ms 4616 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 3 ms 4440 KB Output is correct
32 Correct 3 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 3 ms 4444 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4572 KB Output is correct
10 Correct 2 ms 4444 KB Output is correct
11 Correct 2 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 2 ms 4568 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct
16 Correct 2 ms 4700 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 3 ms 4696 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4444 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 2 ms 4444 KB Output is correct
24 Correct 2 ms 4700 KB Output is correct
25 Correct 2 ms 4444 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct
27 Correct 2 ms 4576 KB Output is correct
28 Correct 2 ms 4444 KB Output is correct
29 Correct 2 ms 4616 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 3 ms 4440 KB Output is correct
32 Correct 3 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 167 ms 40788 KB Output is correct
35 Correct 157 ms 41740 KB Output is correct
36 Correct 160 ms 41232 KB Output is correct
37 Correct 162 ms 41616 KB Output is correct
38 Correct 154 ms 41760 KB Output is correct
39 Correct 155 ms 41072 KB Output is correct
40 Correct 175 ms 43020 KB Output is correct
41 Correct 168 ms 41584 KB Output is correct
42 Correct 167 ms 42308 KB Output is correct
43 Correct 173 ms 43216 KB Output is correct
44 Correct 176 ms 43268 KB Output is correct
45 Correct 185 ms 43400 KB Output is correct
46 Correct 164 ms 43340 KB Output is correct
47 Correct 175 ms 42496 KB Output is correct
48 Correct 163 ms 42284 KB Output is correct
49 Correct 176 ms 43052 KB Output is correct
50 Correct 186 ms 42508 KB Output is correct
51 Correct 171 ms 42568 KB Output is correct
52 Correct 119 ms 33320 KB Output is correct
53 Correct 119 ms 33100 KB Output is correct
54 Correct 117 ms 33208 KB Output is correct
55 Correct 111 ms 32772 KB Output is correct
56 Correct 165 ms 43576 KB Output is correct
57 Correct 145 ms 38988 KB Output is correct
58 Correct 140 ms 39044 KB Output is correct
59 Correct 137 ms 38956 KB Output is correct
60 Correct 140 ms 38276 KB Output is correct
61 Correct 151 ms 39820 KB Output is correct
62 Correct 140 ms 39456 KB Output is correct
63 Correct 142 ms 39496 KB Output is correct
64 Correct 157 ms 38672 KB Output is correct
65 Correct 141 ms 39464 KB Output is correct