oj.uz

Submission #954673

# Submission time Handle Problem Language Result Execution time Memory
954673 2024-03-28T10:21:07 Z edogawa_something Building 4 (JOI20_building4) C++17
11 / 100
 30 ms 39664 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(v) v.begin(),v.end()
#define pow poww
const ll M=5000;
const ll inf=2e18;
const ll mod=1e9+7;
ll pow(ll x,ll y){
  ll res=1;
  x%=mod; 
  while(y>0){
    if((y&1))
    res*=x,res%=mod;
    x*=x,x%=mod;
    y=(y>>1);
  }
  return res;
}
ll n,a[M],b[M];
bool dp[M][M][2];
int main(){
  ios_base::sync_with_stdio(0),cin.tie(0);
  int TC=1;
  //cin>>TC;
  while(TC--){
    cin>>n;
    n*=2;
    for(int i=0;i<n;i++)
    cin>>a[i];
    for(int i=0;i<n;i++)
    cin>>b[i];
    dp[0][0][0]=dp[0][1][1]=1;
    for(int i=1;i<n;i++){
      if(a[i]>=b[i-1]){
        for(int j=0;j<=i;j++){
          if(dp[i-1][j][0])
          dp[i][j+1][1]=1;
        }
      }
      if(a[i]>=a[i-1]){
        for(int j=0;j<=i;j++){
          if(dp[i-1][j][1])
          dp[i][j+1][1]=1;
        }
      }
      if(b[i]>=b[i-1]){
        for(int j=0;j<=i;j++){
          if(dp[i-1][j][0])
          dp[i][j][0]=1;
        }
      }
      if(b[i]>=a[i-1]){
        for(int j=0;j<=i;j++){
        if(dp[i-1][j][1])
        dp[i][j][0]=1;
        }
      }
    }
    ll cnt=n-1,cur=n/2;
    string ans;
    if(!dp[cnt][cur][0]&&!dp[cnt][cur][1]){
      cout<<-1;
      return 0;
    }
    bool c=0;
    if(!dp[cnt][cur][0])
    c=1;
    if(c)
    ans.pb('A'),cur--;
    else
    ans.pb('B');
    cnt--;
    while(cnt>0){
      if(c){
        if(a[cnt+1]>=b[cnt]&&dp[cnt][cur][0]){
        ans.pb('B'),c=0;
        cnt--;
        }
        else{
          ans.pb('A'),c=1;
          cnt--,cur--;
        }
      }
      else{
        if(b[cnt+1]>=b[cnt]&&dp[cnt][cur][0]){
          ans.pb('B'),c=0;
          cnt--;
        }
        else{
          ans.pb('A'),c=1;
          cnt--,cur--;
        }
      }
    }
    if(cur)
    ans.pb('A');
    else
    ans.pb('B');
    reverse(all(ans));
    cout<<ans;
  }
  return 0;
}
/*

*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 11 ms 604 KB Output is correct
6 Correct 30 ms 36188 KB Output is correct
7 Correct 13 ms 33372 KB Output is correct
8 Correct 19 ms 35548 KB Output is correct
9 Correct 16 ms 35420 KB Output is correct
10 Correct 13 ms 31320 KB Output is correct
11 Correct 16 ms 37468 KB Output is correct
12 Correct 20 ms 38236 KB Output is correct
13 Correct 20 ms 35924 KB Output is correct
14 Correct 28 ms 39628 KB Output is correct
15 Correct 21 ms 39516 KB Output is correct
16 Correct 23 ms 39512 KB Output is correct
17 Correct 22 ms 39516 KB Output is correct
18 Correct 20 ms 38236 KB Output is correct
19 Correct 22 ms 39664 KB Output is correct
20 Correct 19 ms 39508 KB Output is correct
21 Correct 19 ms 38236 KB Output is correct
22 Correct 24 ms 39508 KB Output is correct
23 Correct 25 ms 39604 KB Output is correct
24 Correct 19 ms 39516 KB Output is correct
25 Correct 22 ms 39508 KB Output is correct
26 Correct 23 ms 39508 KB Output is correct
27 Correct 22 ms 39508 KB Output is correct
28 Correct 18 ms 35420 KB Output is correct
29 Correct 22 ms 39592 KB Output is correct
30 Correct 19 ms 37468 KB Output is correct
31 Correct 23 ms 39516 KB Output is correct
32 Correct 17 ms 33368 KB Output is correct
33 Correct 22 ms 39456 KB Output is correct

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 11 ms 604 KB Output is correct
6 Correct 30 ms 36188 KB Output is correct
7 Correct 13 ms 33372 KB Output is correct
8 Correct 19 ms 35548 KB Output is correct
9 Correct 16 ms 35420 KB Output is correct
10 Correct 13 ms 31320 KB Output is correct
11 Correct 16 ms 37468 KB Output is correct
12 Correct 20 ms 38236 KB Output is correct
13 Correct 20 ms 35924 KB Output is correct
14 Correct 28 ms 39628 KB Output is correct
15 Correct 21 ms 39516 KB Output is correct
16 Correct 23 ms 39512 KB Output is correct
17 Correct 22 ms 39516 KB Output is correct
18 Correct 20 ms 38236 KB Output is correct
19 Correct 22 ms 39664 KB Output is correct
20 Correct 19 ms 39508 KB Output is correct
21 Correct 19 ms 38236 KB Output is correct
22 Correct 24 ms 39508 KB Output is correct
23 Correct 25 ms 39604 KB Output is correct
24 Correct 19 ms 39516 KB Output is correct
25 Correct 22 ms 39508 KB Output is correct
26 Correct 23 ms 39508 KB Output is correct
27 Correct 22 ms 39508 KB Output is correct
28 Correct 18 ms 35420 KB Output is correct
29 Correct 22 ms 39592 KB Output is correct
30 Correct 19 ms 37468 KB Output is correct
31 Correct 23 ms 39516 KB Output is correct
32 Correct 17 ms 33368 KB Output is correct
33 Correct 22 ms 39456 KB Output is correct
34 Runtime error 2 ms 860 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -