oj.uz

Submission #751318

# Submission time Handle Problem Language Result Execution time Memory
751318 2023-05-31T11:37:49 Z Sam_a17 Building 4 (JOI20_building4) C++17
11 / 100
 1806 ms 260540 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
 
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 4e3 + 10;
int dp[N][N / 2][2];
int n, a[N], b[N];

pair<pair<int, int>, int> prv[N][N / 2][2];

string cont(int i, int j, int k) {
  string answ = "";

  while(i) {
    if(k == 1) {
      answ += "A";
    } else {
      answ += "B";
    }

    auto u = prv[i][j][k];
    i = u.first.first;
    j = u.first.second;
    k = u.second;
  }

  reverse(all(answ));
  return answ;
}

void solve_() {
  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][1][1] = 1;
  dp[1][0][0] = 1;

  for(int i = 1; i < 2 * n; i++) {
    for(int j = 0; j <= min(i, n); j++) {
      if(j < n) {
        int ok = 0;
        dp[i + 1][j + 1][1] |= dp[i][j][1] & (a[i] <= a[i + 1]);
        if(dp[i + 1][j + 1][1]) {
          prv[i + 1][j + 1][1] = make_pair(make_pair(i, j), 1);
          ok = 1;
        }
        dp[i + 1][j + 1][1] |= dp[i][j][0] & (b[i] <= a[i + 1]);
        if(dp[i + 1][j + 1][1] && !ok) {
          prv[i + 1][j + 1][1] = make_pair(make_pair(i, j), 0);
        }
      }

      if((i - j) < n) {
        int ok = 0;
        dp[i + 1][j][0] |= dp[i][j][1] & (a[i] <= b[i + 1]);
        if(dp[i + 1][j][0]) {
          prv[i + 1][j][0] = make_pair(make_pair(i, j), 1);
          ok = 1;
        }
        dp[i + 1][j][0] |= dp[i][j][0] & (b[i] <= b[i + 1]);
        if(dp[i + 1][j][0] && !ok) {
          prv[i + 1][j][0] = make_pair(make_pair(i, j), 0);
        }
      }
    }
  }


  if(dp[2 * n][n][0]) {
    cout << cont(2 * n, n, 0) << '\n';
  } else if(dp[2 * n][n][1]) {
    cout << cont(2 * n, n, 1) << '\n';
  } else {
    cout << -1 << '\n';
  }
  
}
 
int main() {
  setIO();
  
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1; 
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

building4.cpp: In function 'void setIO(std::string)':
building4.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
building4.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 44 ms 49612 KB Output is correct
6 Correct 54 ms 63300 KB Output is correct
7 Correct 38 ms 54916 KB Output is correct
8 Correct 66 ms 128604 KB Output is correct
9 Correct 57 ms 97512 KB Output is correct
10 Correct 59 ms 111792 KB Output is correct
11 Correct 50 ms 66100 KB Output is correct
12 Correct 64 ms 71004 KB Output is correct
13 Correct 55 ms 70956 KB Output is correct
14 Correct 91 ms 164008 KB Output is correct
15 Correct 71 ms 117744 KB Output is correct
16 Correct 73 ms 117648 KB Output is correct
17 Correct 75 ms 122364 KB Output is correct
18 Correct 53 ms 70936 KB Output is correct
19 Correct 53 ms 70952 KB Output is correct
20 Correct 58 ms 71152 KB Output is correct
21 Correct 57 ms 70960 KB Output is correct
22 Correct 90 ms 163668 KB Output is correct
23 Correct 88 ms 147152 KB Output is correct
24 Correct 87 ms 164020 KB Output is correct
25 Correct 84 ms 142168 KB Output is correct
26 Correct 83 ms 142572 KB Output is correct
27 Correct 90 ms 163992 KB Output is correct
28 Correct 72 ms 99264 KB Output is correct
29 Correct 77 ms 119848 KB Output is correct
30 Correct 64 ms 96100 KB Output is correct
31 Correct 78 ms 111712 KB Output is correct
32 Correct 51 ms 85276 KB Output is correct
33 Correct 70 ms 113584 KB Output is correct

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 44 ms 49612 KB Output is correct
6 Correct 54 ms 63300 KB Output is correct
7 Correct 38 ms 54916 KB Output is correct
8 Correct 66 ms 128604 KB Output is correct
9 Correct 57 ms 97512 KB Output is correct
10 Correct 59 ms 111792 KB Output is correct
11 Correct 50 ms 66100 KB Output is correct
12 Correct 64 ms 71004 KB Output is correct
13 Correct 55 ms 70956 KB Output is correct
14 Correct 91 ms 164008 KB Output is correct
15 Correct 71 ms 117744 KB Output is correct
16 Correct 73 ms 117648 KB Output is correct
17 Correct 75 ms 122364 KB Output is correct
18 Correct 53 ms 70936 KB Output is correct
19 Correct 53 ms 70952 KB Output is correct
20 Correct 58 ms 71152 KB Output is correct
21 Correct 57 ms 70960 KB Output is correct
22 Correct 90 ms 163668 KB Output is correct
23 Correct 88 ms 147152 KB Output is correct
24 Correct 87 ms 164020 KB Output is correct
25 Correct 84 ms 142168 KB Output is correct
26 Correct 83 ms 142572 KB Output is correct
27 Correct 90 ms 163992 KB Output is correct
28 Correct 72 ms 99264 KB Output is correct
29 Correct 77 ms 119848 KB Output is correct
30 Correct 64 ms 96100 KB Output is correct
31 Correct 78 ms 111712 KB Output is correct
32 Correct 51 ms 85276 KB Output is correct
33 Correct 70 ms 113584 KB Output is correct
34 Runtime error 1806 ms 260540 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -