oj.uz

Submission #941696

# Submission time Handle Problem Language Result Execution time Memory
941696 2024-03-09T09:56:24 Z vjudge1 Building 4 (JOI20_building4) C++17
0 / 100
 2 ms 860 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll

#define endl '\n'
#define pb push_back
using pi = array<int, 2>;
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

/*
iau mereu cel mai mic posibil si dau switch

daca v[i][min] <= v[i + 1][min] si v[i][max] >= v[i + 1][min] si v[i][max] <= v[i + 1][max] atunci daca schimb i, schimb si i+1

pot sa iau sufix la cel mai mare interval
sufixul e un interval de valori (se schimba cu 1 costul)
v[i][0] = minimu
v[i][1] = maximu

balance = A - B
*/

const int INF = 1e9;

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  
  int n;
  cin >> n;
  n *= 2;
  
  vector<bool> swappedv(n + 1), is_max(n + 1);
  vector<int> cost(n + 1);
  vector<vector<int>> v(n + 1, vector<int>(2));
  for (int i = 1; i <= n; ++i) cin >> v[i][0];
  for (int i = 1; i <= n; ++i) cin >> v[i][1];
  
  bool ok = true;
  int balance = 0, lastc = 0;
  for (int i = 1; i <= n; ++i) {
    if (v[i][0] <= v[i][1]) {
      if (v[i][0] >= lastc) {
        balance += 1;
        cost[i] = -1;
        
        lastc = v[i][0];
      } else {
        ok &= (v[i][1] >= lastc);
        balance -= 1;
        cost[i] = 0;
        is_max[i] = true;
        
        lastc = v[i][1];
      }
    } else {
      swappedv[i] = true;
      swap(v[i][0], v[i][1]);
      if (v[i][0] >= lastc) {
        balance -= 1;
        cost[i] = 1;
        
        lastc = v[i][0];
      } else {
        ok &= (v[i][1] >= lastc);
        balance += 1;
        cost[i] = 0;
        is_max[i] = true;
        
        lastc = v[i][1];
      }
    }
  }
  
  if (!ok) {
    cout << -1;
    return 0;
  }
  balance /= 2;
  
  vector<pi> segments;
  int st = 1;
  for (int dr = 1; dr < n; ++dr) {
    if (cost[dr] == 0) continue; // sunt deja max
    
    if (v[dr][1] > v[dr + 1][1]) { // nu pot da swap la asta, segmentul e invalidat
      st = dr + 1;
      continue;
    }
    
    if (v[dr][1] > v[dr + 1][0]) continue; // trebuie sa dau swap si la urmatorul
    
    // segmentul se termina aici
    segments.pb({st, dr});
    st = dr + 1;
  }
  segments.pb({st, n});
  
  /*cout << endl << endl << balance << endl;
  for (pi s : segments) {
    cout << s[0] << " " << s[1] << " | ";
    for (int i = s[0]; i <= s[1]; ++i) cout << cost[i] << " ";
    cout << endl;
  }
  cout << endl;*/
  
  for (pi s : segments) {
    int l = s[0], r = s[1];
    
    int suf = 0;
    if (balance < 0) {
      int maxi = 0, maxidx = l - 1;
      for (int i = r; i >= l; --i) {
        suf += cost[i];
        if (balance + suf <= 0 && suf > maxi) {
          maxi = suf;
          maxidx = i;
        }
      }
      for (int i = r; i >= maxidx; --i) is_max[i] = true;
      
      balance += maxi;
    } else if (balance > 0) {
      int mini = 0, minidx = -1;
      for (int i = r; i >= l; --i) {
        suf += cost[i];
        if (balance + suf >= 0 && suf < mini) {
          mini = suf;
          minidx = i;
        }
      }
      for (int i = r; i >= minidx; --i) is_max[i] = true;
      
      balance += mini;
    }
  }
  
  if (balance != 0) {
    cout << -1;
    return 0;
  }
  
  for (int i = 1; i <= n; ++i) {
    bool is_a = true;
    if (swappedv[i]) is_a = !is_a;
    if (is_max[i]) is_a = !is_a;
    cout << (is_a ? 'A' : 'B');
  }
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Runtime error 1 ms 860 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Runtime error 1 ms 860 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -