oj.uz

Submission #234269

# Submission time Handle Problem Language Result Execution time Memory
234269 2020-05-23T15:44:18 Z shashwatchandra Building 4 (JOI20_building4) C++17
100 / 100
 352 ms 68892 KB 
/*input
3
2 5 4 9 15 11
6 7 6 8 12 14
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}

const int N = 5e5+1;
int n;
int a[2*N];
int b[2*N];
pair<int,int> fa[2*N];
pair<int,int> fb[2*N];

void solve(){
    cin >> n;
    RE(i,2*n){
      cin >> a[i];
    }
    RE(i,2*n){
      cin >> b[i];
    }
    fa[1] = {0,0};
    fb[1] = {1,1};
    for(int i = 2;i <= 2*n;i++){
      fa[i] = {INF,-INF};
      fb[i] = {INF,-INF};
      if(fb[i-1].f != INF and a[i] >= b[i-1]){
        fa[i].f = min(fb[i-1].f,fa[i].f);
        fa[i].s = max(fb[i-1].s,fa[i].s);
      }
      if(fa[i-1].f != INF and a[i] >= a[i-1]){
        fa[i].f = min(fa[i-1].f,fa[i].f);
        fa[i].s = max(fa[i-1].s,fa[i].s);
      }
      if(fb[i-1].f != INF and b[i] >= b[i-1]){
        fb[i].f = min(fb[i-1].f+1,fb[i].f);
        fb[i].s = max(fb[i-1].s+1,fb[i].s);
      }
      if(fa[i-1].f != INF and b[i] >= a[i-1]){
        fb[i].f = min(fa[i-1].f+1,fb[i].f);
        fb[i].s = max(fa[i-1].s+1,fb[i].s);
      }
      /*cout << "FOR " << i << endl;
      cout << fa[i].f << " " << fa[i].s << endl;
      cout << fb[i].f << " " << fb[i].s << endl;*/
    }
    stack<char> ans;
    int cur = 2*n;
    int which = 0;
    if(fa[2*n].f <= n and n <= fa[2*n].s)which = 1;
    if(fb[2*n].f <= n and n <= fb[2*n].s)which = 2;
    if(which == 0){
      cout << -1;
      return;
    }
    while(cur > 0){
      int val;
      if(which == 1){
        ans.push('A');
        val = a[cur];
      }
      else{
        ans.push('B');
        n--;
        val = b[cur];
      }
      cur--;
      if(a[cur] <= val and fa[cur].f <= n and fa[cur].s >= n){
        which = 1;
        continue;
      }
      if(b[cur] <= val and fb[cur].f <= n and fb[cur].s >= n){
        which = 2;
        continue;
      }
    }
    while(ans.size()){
      cout << ans.top();
      ans.pop();
    }
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 6 ms 640 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 6 ms 640 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 640 KB Output is correct
25 Correct 5 ms 640 KB Output is correct
26 Correct 6 ms 640 KB Output is correct
27 Correct 5 ms 640 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 640 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 640 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 6 ms 640 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 6 ms 640 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 640 KB Output is correct
25 Correct 5 ms 640 KB Output is correct
26 Correct 6 ms 640 KB Output is correct
27 Correct 5 ms 640 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 640 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 312 ms 65656 KB Output is correct
35 Correct 326 ms 63608 KB Output is correct
36 Correct 330 ms 62712 KB Output is correct
37 Correct 323 ms 63992 KB Output is correct
38 Correct 326 ms 63608 KB Output is correct
39 Correct 313 ms 63424 KB Output is correct
40 Correct 325 ms 58804 KB Output is correct
41 Correct 308 ms 64632 KB Output is correct
42 Correct 335 ms 66424 KB Output is correct
43 Correct 349 ms 68724 KB Output is correct
44 Correct 352 ms 68728 KB Output is correct
45 Correct 348 ms 68640 KB Output is correct
46 Correct 344 ms 68600 KB Output is correct
47 Correct 329 ms 67700 KB Output is correct
48 Correct 335 ms 67576 KB Output is correct
49 Correct 324 ms 68344 KB Output is correct
50 Correct 351 ms 67960 KB Output is correct
51 Correct 340 ms 67832 KB Output is correct
52 Correct 224 ms 56952 KB Output is correct
53 Correct 222 ms 56952 KB Output is correct
54 Correct 212 ms 56952 KB Output is correct
55 Correct 216 ms 56824 KB Output is correct
56 Correct 342 ms 68892 KB Output is correct
57 Correct 293 ms 63608 KB Output is correct
58 Correct 286 ms 63864 KB Output is correct
59 Correct 289 ms 63864 KB Output is correct
60 Correct 279 ms 60664 KB Output is correct
61 Correct 296 ms 64380 KB Output is correct
62 Correct 301 ms 63480 KB Output is correct
63 Correct 286 ms 64376 KB Output is correct
64 Correct 302 ms 62328 KB Output is correct
65 Correct 310 ms 64472 KB Output is correct